메뉴 건너뛰기




Volumn 42, Issue 1, 2012, Pages 24-30

Internet and the erlang formula

Author keywords

Congestion; Erlang formula; Traffc

Indexed keywords

BANDWIDTH SHARING; CONGESTION; ERLANG FORMULA; ERLANG LOSS FORMULA; LINK CAPACITIES; MAX-MIN; NETWORK ENGINEERING; TRAFFC; TRAFFIC MODEL; UPPER BOUND;

EID: 84868516414     PISSN: 01464833     EISSN: 19435819     Source Type: Conference Proceeding    
DOI: 10.1145/2096149.2096153     Document Type: Article
Times cited : (54)

References (16)
  • 3
    • 84872720553 scopus 로고    scopus 로고
    • The Erlang model with non-Poisson call arrivals
    • T. Bonald, The Erlang model with non-Poisson call arrivals. In SIGMETRICS/Performance 2006.
    • (2006) SIGMETRICS/Performance
    • Bonald, T.1
  • 5
    • 33646679882 scopus 로고    scopus 로고
    • A queueing analysis of max-min fairness, proportional fairness and balanced fairness
    • T. Bonald, L. Massoulie, A. Prouti-ere and J. Virtamo, A queueing analysis of max-min fairness, proportional fairness and balanced fairness. Queueing Systems, 2006.
    • (2006) Queueing Systems
    • Bonald, T.1    Massoulie, L.2    Proutiere, A.3    Virtamo, J.4
  • 6
    • 1642541234 scopus 로고    scopus 로고
    • Insensitive bandwidth sharing in data networks
    • T. Bonald, A. Proutiere, Insensitive bandwidth sharing in data networks. Queueing Systems, 2003.
    • (2003) Queueing Systems
    • Bonald, T.1    Proutiere, A.2
  • 9
    • 0042976066 scopus 로고    scopus 로고
    • Provisioning IP backbone networks to support latency sensitive trac
    • C. Faleigh, F. Tobagi, C. Diot, Provisioning IP Backbone Networks to Support Latency Sensitive Trac. In Infocom 2003.
    • (2003) Infocom
    • Faleigh, C.1    Tobagi, F.2    Diot, C.3
  • 10
    • 0026223925 scopus 로고
    • Round-robin scheduling for max-min fairness in data networks
    • E. Hahne, Round-Robin Scheduling for Max-Min Fairness in Data Networks. IEEE JSAC, Vol 9, No 7, 1024{1039, 1991.
    • (1991) IEEE JSAC , vol.9 , Issue.7 , pp. 1024-1039
    • Hahne, E.1
  • 11
    • 0019623096 scopus 로고
    • Blocking in a shared resource environment
    • J. Kaufman, Blocking in a shared resource environment. IEEE Trans. Commun., 29:500 1474{1481, 1981.
    • (1981) IEEE Trans. Commun. , vol.29 , Issue.500 , pp. 1474-1481
    • Kaufman, J.1
  • 13
    • 0001498675 scopus 로고    scopus 로고
    • Mathematical modelling of the internet
    • Editors B. Engquist and W. Schmid). Springer-Verlag, Berlin
    • F. Kelly, Mathematical modelling of the Internet. In "Mathematics Unlimited - 2001 and Beyond" (Editors B. Engquist and W. Schmid). Springer-Verlag, Berlin, 2001.
    • (2001) Mathematics Unlimited - 2001 and beyond
    • Kelly, F.1
  • 14
    • 44049095102 scopus 로고    scopus 로고
    • Evaluating the number of active ows in a scheduler realizing fair statistical bandwidth sharing
    • A. Kortebi, L. Muscariello, S. Oueslati, J. Roberts, Evaluating the number of active ows in a scheduler realizing fair statistical bandwidth sharing. In SIGMETRICS 2005.
    • (2005) SIGMETRICS
    • Kortebi, A.1    Muscariello, L.2    Oueslati, S.3    Roberts, J.4


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.