Insensitive Traffic Models for Communication Networks

Authors:
T. Bonald
Affiliations:
Orange Labs, Paris, France
Venue:
Discrete Event Dynamic Systems
Year:
2007

Citing 9
Cited 7

Data networks

Data networks
Congestion probabilities in a circuit-switched integrated services network

Performance Evaluation
TCP/IP illustrated (vol. 1): the protocols

TCP/IP illustrated (vol. 1): the protocols
A new method for analysing feedback-based protocols with applications to engineering Web traffic over the Internet

SIGMETRICS '97 Proceedings of the 1997 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Dimensioning bandwidth for elastic traffic in high-speed data networks

IEEE/ACM Transactions on Networking (TON)
Statistical bandwidth sharing: a study of congestion at flow level

Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Insensitivity in processor-sharing networks

Performance Evaluation
A queueing analysis of max-min fairness, proportional fairness and balanced fairness

Queueing Systems: Theory and Applications
The Erlang model with non-poisson call arrivals

SIGMETRICS '06/Performance '06 Proceedings of the joint international conference on Measurement and modeling of computer systems

Towards an Erlang formula for multiclass networks

Queueing Systems: Theory and Applications
On the stability of flow-aware CSMA

Performance Evaluation
Bounds on QoS-constrained energy savings in cellular access networks with sleep modes

Proceedings of the 23rd International Teletraffic Congress
Adaptive optical burst switching

Proceedings of the 23rd International Teletraffic Congress
Flexible resource allocation for reliable virtual cluster computing systems

Proceedings of 2011 International Conference for High Performance Computing, Networking, Storage and Analysis
Performance of CSMA in multi-channel wireless networks

Queueing Systems: Theory and Applications
Congestion in large balanced multirate networks

Queueing Systems: Theory and Applications

Quantified Score

Hi-index	0.00

Visualization

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.