{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,11]],"date-time":"2026-02-11T18:30:49Z","timestamp":1770834649985,"version":"3.50.1"},"reference-count":16,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2012,1,16]],"date-time":"2012-01-16T00:00:00Z","timestamp":1326672000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGCOMM Comput. Commun. Rev."],"published-print":{"date-parts":[[2012,1,16]]},"abstract":"<jats:p>We demonstrate that the Internet has a formula linking demand, capacity and performance that in many ways is the analogue of the Erlang loss formula of telephony. Surprisingly, this formula is none other than the Erlang delay formula. It provides an upper bound on the probability a flow of given peak rate suffers degradation when bandwidth sharing is max-min fair. Apart from the flow rate, the only relevant parameters are link capacity and overall demand. We explain why this result is valid under a very general and realistic traffic model and discuss its significance for network engineering.<\/jats:p>","DOI":"10.1145\/2096149.2096153","type":"journal-article","created":{"date-parts":[[2012,1,17]],"date-time":"2012-01-17T17:21:44Z","timestamp":1326820904000},"page":"23-30","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":57,"title":["Internet and the Erlang formula"],"prefix":"10.1145","volume":"42","author":[{"given":"Thomas","family":"Bonald","sequence":"first","affiliation":[{"name":"Telecom ParisTech, Paris, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"James W.","family":"Roberts","sequence":"additional","affiliation":[{"name":"INRIA, Rocquencourt, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2012,1,16]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/383059.383068"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2005.05.028"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1140277.1140309"},{"key":"e_1_2_1_4_1","volume-title":"proceedings of ITC 23","author":"Bonald T.","year":"2011","unstructured":"T. Bonald , J-P. Haddad , R. Mazumdar, Congestion in large balanced multirate links . In proceedings of ITC 23 2011 . T. Bonald, J-P. Haddad, R. Mazumdar, Congestion in large balanced multirate links. In proceedings of ITC 23 2011."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11134-006-7587-7"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1024094807532"},{"key":"e_1_2_1_7_1","author":"Brockmeyer E.","year":"1948","unstructured":"E. Brockmeyer , H. Halstrom and A. Jensen , Life and works of A.K. Erlang. Transactions of the Danish Academy of Technical Sciences , 1948 . E. Brockmeyer, H. Halstrom and A. Jensen, Life and works of A.K. Erlang. Transactions of the Danish Academy of Technical Sciences, 1948.","journal-title":"Life and works of A.K. Erlang. Transactions of the Danish Academy of Technical Sciences"},{"key":"e_1_2_1_8_1","volume-title":"FIND Observer Panel Report","author":"Cerf V.","year":"2009","unstructured":"V. Cerf , B. Davie , A. Greenberg , S. Landau , D. Sincoskie , FIND Observer Panel Report . US National Science Foundation , 2009 . V. Cerf, B. Davie, A. Greenberg, S. Landau, D. Sincoskie, FIND Observer Panel Report. US National Science Foundation, 2009."},{"key":"e_1_2_1_9_1","volume-title":"Infocom","author":"Faleigh C.","year":"2003","unstructured":"C. Faleigh , F. Tobagi , C. Diot , Provisioning IP Backbone Networks to Support Latency Sensitive Traffic . In Infocom 2003 . C. Faleigh, F. Tobagi, C. Diot, Provisioning IP Backbone Networks to Support Latency Sensitive Traffic. In Infocom 2003."},{"issue":"7","key":"e_1_2_1_10_1","first-page":"1024","volume":"9","author":"Hahne E.","year":"1991","unstructured":"E. Hahne , Round-Robin Scheduling for Max-Min Fairness in Data Networks. IEEE JSAC , Vol 9 , No 7 , 1024 -- 1039 , 1991 E. Hahne, Round-Robin Scheduling for Max-Min Fairness in Data Networks. IEEE JSAC, Vol 9, No 7, 1024--1039, 1991","journal-title":"Round-Robin Scheduling for Max-Min Fairness in Data Networks. IEEE JSAC"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1981.1094894"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoap\/1177005872"},{"key":"e_1_2_1_13_1","volume-title":"Mathematical modelling of the Internet. In \"Mathematics Unlimited - 2001 and Beyond\" (Editors","author":"Kelly F.","year":"2001","unstructured":"F. Kelly , Mathematical modelling of the Internet. In \"Mathematics Unlimited - 2001 and Beyond\" (Editors B. Engquist and W. Schmid). Springer-Verlag , Berlin, 2001 . F. Kelly, Mathematical modelling of the Internet. In \"Mathematics Unlimited - 2001 and Beyond\" (Editors B. Engquist and W. Schmid). Springer-Verlag, Berlin, 2001."},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1064212.1064237"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/190314.190338"},{"key":"e_1_2_1_16_1","first-page":"423","volume-title":"G. Pujolle, \u00e9d. : Performance of Data Communications Systems and Their Applications","author":"Roberts J.","year":"1981","unstructured":"J. Roberts , A service system with heterogeneous user requirement . In G. Pujolle, \u00e9d. : Performance of Data Communications Systems and Their Applications , p. 423 -- 431 , 1981 . J. Roberts, A service system with heterogeneous user requirement. In G. Pujolle, \u00e9d. : Performance of Data Communications Systems and Their Applications, p. 423--431, 1981."}],"container-title":["ACM SIGCOMM Computer Communication Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2096149.2096153","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2096149.2096153","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:54:34Z","timestamp":1750240474000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2096149.2096153"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,1,16]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,1,16]]}},"alternative-id":["10.1145\/2096149.2096153"],"URL":"https:\/\/doi.org\/10.1145\/2096149.2096153","relation":{},"ISSN":["0146-4833"],"issn-type":[{"value":"0146-4833","type":"print"}],"subject":[],"published":{"date-parts":[[2012,1,16]]},"assertion":[{"value":"2012-01-16","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}