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 metadatas

Cited literature [14 references]  Display  Hide  Download

https://hal-imt.archives-ouvertes.fr/hal-00941783
Contributor : Thomas Bonald <>
Submitted on : Tuesday, February 4, 2014 - 11:34:04 AM
Last modification on : Thursday, October 17, 2019 - 12:36:06 PM
Long-term archiving on : Sunday, April 9, 2017 - 7:22:59 AM

File

BR11.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00941783, version 1

Citation

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

Share

Metrics

Record views

814

Files downloads

946