@inproceedings{9583f634e9f44ff3a6ba65860089429f,

title = "The Internet Erlang Formula",

abstract = "This paper presents a robust and efficient algorithm for evaluating multi-service multi-rate queueing systems, including finite buffer systems and loss systems. Vint Cerf listed in 2007 seven research problems concerning the Internet. This paper responds to the second problem: an Internet Erlang Formula. The algorithm derived is based on reversible models and thus insensitive to service time distributions. For buffer-less systems we get the classical multi-rate teletraffic models. As the simplest special case we get the classical recursion formula for Erlang-B. The performance of the algorithm is O{N · k} where N number of services, and k is the total number of servers and buffers in basic bandwidth units. The memory requirement is O{N · d} where d is the maximum requested bandwidth in basic bandwidth units.",

keywords = "Algorithms, Bandwidth, Queueing networks, Queueing theory, Internet",

author = "Iversen, {Villy B{\ae}k}",

year = "2012",

doi = "10.1007/978-3-642-32686-8_30",

language = "English",

isbn = "978-3-642-32685-1",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "328--337",

booktitle = "Internet of Things, Smart Spaces, and Next Generation Networking",

note = "The 12th International Conference on Next Generation Wired/Wireless Networking (NEW2AN 2012) and the 5th conference on Internet of Things and Smart Spaces (ruSMART 2012) ; Conference date: 27-08-2012 Through 29-08-2012",

}