Insensitive traffic models for communication networks

T. Bonald

doi:10.1007/s10626-007-0012-5

Insensitive traffic models for communication networks

T. Bonald

Orange Labs

Research output: Contribution to journal › Article › peer-review

Abstract

We present a survey of traffic models for communication networks whose key performance indicators like blocking probability and mean delay are independent of all traffic characteristics beyond the traffic intensity. This insensitivity property, which follows from that of the underlying queuing networks, is key to the derivation of simple and robust engineering rules like the Erlang formula in telephone networks.

Original language	English
Pages (from-to)	405-421
Number of pages	17
Journal	Discrete Event Dynamic Systems: Theory and Applications
Volume	17
Issue number	3
DOIs	https://doi.org/10.1007/s10626-007-0012-5
Publication status	Published - 1 Sept 2007
Externally published	Yes

Keywords

Bandwidth sharing
Communication networks
Insensitivity
Kelly-Whittle queuing networks
Traffic modeling

Access to Document

10.1007/s10626-007-0012-5

Cite this

@article{2b01bf748c274d82ab1712ba245b3edf,

title = "Insensitive traffic models for communication networks",

abstract = "We present a survey of traffic models for communication networks whose key performance indicators like blocking probability and mean delay are independent of all traffic characteristics beyond the traffic intensity. This insensitivity property, which follows from that of the underlying queuing networks, is key to the derivation of simple and robust engineering rules like the Erlang formula in telephone networks.",

keywords = "Bandwidth sharing, Communication networks, Insensitivity, Kelly-Whittle queuing networks, Traffic modeling",

author = "T. Bonald",

year = "2007",

month = sep,

day = "1",

doi = "10.1007/s10626-007-0012-5",

language = "English",

volume = "17",

pages = "405--421",

journal = "Discrete Event Dynamic Systems: Theory and Applications",

issn = "0924-6703",

number = "3",

}

TY - JOUR

T1 - Insensitive traffic models for communication networks

AU - Bonald, T.

PY - 2007/9/1

Y1 - 2007/9/1

N2 - We present a survey of traffic models for communication networks whose key performance indicators like blocking probability and mean delay are independent of all traffic characteristics beyond the traffic intensity. This insensitivity property, which follows from that of the underlying queuing networks, is key to the derivation of simple and robust engineering rules like the Erlang formula in telephone networks.

AB - We present a survey of traffic models for communication networks whose key performance indicators like blocking probability and mean delay are independent of all traffic characteristics beyond the traffic intensity. This insensitivity property, which follows from that of the underlying queuing networks, is key to the derivation of simple and robust engineering rules like the Erlang formula in telephone networks.

KW - Bandwidth sharing

KW - Communication networks

KW - Insensitivity

KW - Kelly-Whittle queuing networks

KW - Traffic modeling

UR - https://www.scopus.com/pages/publications/34548303249

U2 - 10.1007/s10626-007-0012-5

DO - 10.1007/s10626-007-0012-5

M3 - Article

AN - SCOPUS:34548303249

SN - 0924-6703

VL - 17

SP - 405

EP - 421

JO - Discrete Event Dynamic Systems: Theory and Applications

JF - Discrete Event Dynamic Systems: Theory and Applications

IS - 3

ER -

Insensitive traffic models for communication networks

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this