Insensitive Traffic Models for Communication Networks

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.

[1]  B. A. Sevast'yanov.  An Ergodic Theorem for Markov Processes and Its Application to Telephone Systems with Refusals , 1957 .

[2]  L. Gimpelson.  Analysis of Mixtures of Wide- and Narrow-Band Traffic , 1965 .

[3]  Frank Kelly,et al.  Reversibility and Stochastic Networks , 1979 .

[4]  J. Kaufman,et al.  Blocking in a Shared Resource Environment , 1981, IEEE Trans. Commun..

[5]  L. Delbrouck.  On the Steady-State Distribution in a Service Facility Carrying Mixtures of Traffic with Different Peakedness Factors and Capacity Requirements , 1983, IEEE Trans. Commun..

[6]  W. Whitt,et al.  Blocking when service is required from several facilities simultaneously , 1985, AT&T Technical Journal.

[7]  P. Whittle.  Partial balance and insensitivity , 1985, Journal of Applied Probability.

[8]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

[9]  Zbigniew Dziong,et al.  Congestion Probabilities in a Circuit-Switched Integrated Services Network , 1987, Perform. Evaluation.

[10]  Nico M. van Dijk,et al.  On Jackson's product form with 'jump-over' blocking , 1988 .

[11]  S. Zachary,et al.  Loss networks , 2009, 0903.0640.

[12]  W. Richard Stevens,et al.  TCP/IP Illustrated, Volume 1: The Protocols , 1994 .

[13]  T. V. Lakshman,et al.  A new method for analysing feedback-based protocols with applications to engineering Web traffic over the Internet , 1997, SIGMETRICS '97.

[14]  Frank Kelly,et al.  Rate control for communication networks: shadow prices, proportional fairness and stability , 1998, J. Oper. Res. Soc..

[15]  R. Serfozo.  Introduction to Stochastic Networks , 1999 .

[16]  Yaakov Kogan,et al.  Dimensioning bandwidth for elastic traffic in high-speed data networks , 2000, TNET.

[17]  Laurent Massoulié,et al.  Bandwidth sharing and admission control for elastic traffic , 2000, Telecommun. Syst..

[18]  Thomas Bonald,et al.  Statistical bandwidth sharing: a study of congestion at flow level , 2001, SIGCOMM.

[19]  Alexandre Proutière,et al.  Insensitivity in processor-sharing networks , 2002, Perform. Evaluation.

[20]  Jorma T. Virtamo,et al.  A recursive formula for multirate systems with elastic traffic , 2005, IEEE Communications Letters.

[21]  Laurent Massoulié,et al.  A queueing analysis of max-min fairness, proportional fairness and balanced fairness , 2006, Queueing Syst. Theory Appl..

[22]  T. Bonald.  Throughput Performance in Networks with Linear Capacity Contraints , 2006, 2006 40th Annual Conference on Information Sciences and Systems.

[23]  Thomas Bonald.  The Erlang model with non-poisson call arrivals , 2006, SIGMETRICS '06/Performance '06.

[24]  L. Massouli'e.  Structural properties of proportional fairness: Stability and insensitivity , 2007, 0707.4542.