The Internet Erlang Formula

Publication: Research - peer-reviewArticle in proceedings – Annual report year: 2012

View graph of relations

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.
Original languageEnglish
Title of host publicationInternet of Things, Smart Spaces, and Next Generation Networking : 12th International Conference, NEW2AN 2012, and 5th Conference, ruSMART 2012, St. Petersburg, Russia, August 27-29, 2012 Proceedings
Publication date2012
ISBN (print)978-3-642-32685-1
ISBN (electronic)978-3-642-32686-8
StatePublished - 2012


ConferenceThe 12th International Conference on Next Generation Wired/Wireless Networking (NEW2AN 2012) and the 5th conference on Internet of Things and Smart Spaces (ruSMART 2012)
CountryRussian Federation
CitySt. Petersburg
NameLecture Notes in Computer Science
ISSN (Print)0302-9743
CitationsWeb of Science® Times Cited: No match on DOI


  • Algorithms, Bandwidth, Queueing networks, Queueing theory, Internet
Download as:
Download as PDF
Select render style:
Download as HTML
Select render style:
Download as Word
Select render style:

ID: 12515756