The Internet Erlang Formula

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

Standard

The Internet Erlang Formula. / Iversen, Villy Bæk.

Internet 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. Springer, 2012. p. 328-337 (Lecture Notes in Computer Science, Vol. 7469).

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

Harvard

Iversen, VB 2012, 'The Internet Erlang Formula'. in Internet 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. Springer, pp. 328-337. Lecture Notes in Computer Science, vol. 7469, , 10.1007/978-3-642-32686-8_30

APA

Iversen, V. B. (2012). The Internet Erlang Formula. In Internet 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. (pp. 328-337). Springer. (Lecture Notes in Computer Science, Vol. 7469). 10.1007/978-3-642-32686-8_30

CBE

Iversen VB. 2012. The Internet Erlang Formula. In Internet 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. Springer. pp. 328-337. (Lecture Notes in Computer Science, Vol. 7469). Available from: 10.1007/978-3-642-32686-8_30

MLA

Iversen, Villy Bæk "The Internet Erlang Formula". Internet 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. Springer. 2012. 328-337. (Lecture Notes in Computer Science, Volume 7469). Available: 10.1007/978-3-642-32686-8_30

Vancouver

Iversen VB. The Internet Erlang Formula. In Internet 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. Springer. 2012. p. 328-337. (Lecture Notes in Computer Science, Vol. 7469). Available from: 10.1007/978-3-642-32686-8_30

Author

Iversen, Villy Bæk / The Internet Erlang Formula.

Internet 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. Springer, 2012. p. 328-337 (Lecture Notes in Computer Science, Vol. 7469).

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

Bibtex

@inbook{9583f634e9f44ff3a6ba65860089429f,
title = "The Internet Erlang Formula",
keywords = "Algorithms, Bandwidth, Queueing networks, Queueing theory, Internet",
publisher = "Springer",
author = "Iversen, {Villy Bæk}",
year = "2012",
doi = "10.1007/978-3-642-32686-8_30",
isbn = "978-3-642-32685-1",
series = "Lecture Notes in Computer Science",
pages = "328-337",
booktitle = "Internet of Things, Smart Spaces, and Next Generation Networking",

}

RIS

TY - GEN

T1 - The Internet Erlang Formula

A1 - Iversen,Villy Bæk

AU - Iversen,Villy Bæk

PB - Springer

PY - 2012

Y1 - 2012

N2 - 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.

AB - 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.

KW - Algorithms

KW - Bandwidth

KW - Queueing networks

KW - Queueing theory

KW - Internet

U2 - 10.1007/978-3-642-32686-8_30

DO - 10.1007/978-3-642-32686-8_30

SN - 978-3-642-32685-1

BT - Internet of Things, Smart Spaces, and Next Generation Networking

T2 - Internet of Things, Smart Spaces, and Next Generation Networking

T3 - Lecture Notes in Computer Science

T3 - en_GB

SP - 328

EP - 337

ER -