- Authors:
- DOI:
- 10.1007/978-3-642-32686-8_30
- 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.
- ISBN:
- 9783642326868, 9783642326851
- Type:
- Conference paper
- Language:
- English
- Published in:
- Lecture Notes in Computer Science: 12th International Conference, New2an 2012, and 5th Conference, Rusmart 2012, St. Petersburg, Russia, August 27-29, 2012 Proceedings, 2012, p. 328-337
- Keywords:
- Algorithms; Bandwidth; Queueing networks; Queueing theory; Internet
- Main Research Area:
- Science/technology
- Publication Status:
- Published
- Series:
- Lecture Notes in Computer Science
- Review type:
- Peer Review
- Conference:
- 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)Next Generation Teletraffic and Wired/Wireless Advanced Networking
- Publisher:
- Springer
- Submission year:
- 2012
- Scientific Level:
- Scientific
- ID:
- 233346812
Checking for on-site access...
