Skip to Main content Skip to Navigation
Journal articles

Internet and the Erlang formula

Abstract : We demonstrate that the Internet has a formula linking de- mand, 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.
Document type :
Journal articles
Complete list of metadata

Cited literature [14 references]  Display  Hide  Download
Contributor : Thomas Bonald Connect in order to contact the contributor
Submitted on : Tuesday, February 4, 2014 - 11:34:04 AM
Last modification on : Friday, January 21, 2022 - 3:22:31 AM
Long-term archiving on: : Sunday, April 9, 2017 - 7:22:59 AM


Files produced by the author(s)


  • HAL Id : hal-00941783, version 1


Thomas Bonald, James Roberts. Internet and the Erlang formula. Computer Communication Review, Association for Computing Machinery, 2012, 42 (1), pp.23-30. ⟨hal-00941783⟩



Record views


Files downloads