Internet and the Erlang formula - Archive ouverte HAL Access content directly
Journal Articles Computer Communication Review Year : 2012

Internet and the Erlang formula

(1, 2) , (3)
1
2
3

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.
Fichier principal
Vignette du fichier
BR11.pdf (315.26 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00941783 , version 1 (04-02-2014)

Identifiers

  • HAL Id : hal-00941783 , version 1

Cite

Thomas Bonald, James Roberts. Internet and the Erlang formula. Computer Communication Review, 2012, 42 (1), pp.23-30. ⟨hal-00941783⟩
448 View
1167 Download

Share

Gmail Facebook Twitter LinkedIn More