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. © 2012 Springer-Verlag.
CITATION STYLE
Iversen, V. B. (2012). The Internet Erlang Formula. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7469 LNCS, pp. 328–337). https://doi.org/10.1007/978-3-642-32686-8_30
Mendeley helps you to discover research relevant for your work.