Interacting multi-class transmissions in large stochastic networks

The mean-field limit of a Markovian model describing the interaction of several classes of permanent connections in a network is analyzed. Each of the connections has a self-adaptive behavior in that its transmission rate along its route depends on the level of congestion of the nodes of the route. Since several classes of connections going through the nodes of the network are considered, an original mean-field result in a multi-class context is established. It is shown that, as the number of connections goes to infinity, the behavior of the different classes of connections can be represented by the solution of an unusual nonlinear stochastic differential equation depending not only on the sample paths of the process, but also on its distribution. Existence and uniqueness results for the solutions of these equations are derived. Properties of their invariant distributions are investigated and it is shown that, under some natural assumptions, they are determined by the solutions of a fixed-point equation in a finite-dimensional space.

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

[2]  Rayadurgam Srikant,et al.  The Mathematics of Internet Congestion Control , 2003 .

[3]  D. Talay,et al.  Nonlinear self-stabilizing processes – I Existence, invariant probability, propagation of chaos , 1998 .

[4]  S. Méléard.  Asymptotic behaviour of some interacting particle systems; McKean-Vlasov and Boltzmann models , 1996 .

[5]  Mark H. Davis.  Markov Models and Optimization , 1995 .

[6]  A. Proutière,et al.  Statistical bandwidth sharing: a study of congestion at flow level , 2001, SIGCOMM '01.

[7]  B. Jourdain,et al.  Nonlinear SDEs driven by L\'evy processes and related PDEs , 2007, 0707.2723.

[8]  Carl Graham,et al.  Kinetic Limits for Large Communication Networks , 2000 .

[9]  B. Jourdain,et al.  Propagation of chaos and Poincaré inequalities for a system of particles interacting through their cdf , 2007, math/0701879.

[10]  Carl Graham,et al.  McKean-Vlasov Ito-Skorohod equations, and nonlinear diffusions with discrete jump sets , 1992 .

[11]  J. Craggs.  Applied Mathematical Sciences , 1973 .

[12]  Panganamala Ramana Kumar,et al.  A counterexample in congestion control of wireless networks , 2005, MSWiM '05.

[13]  P. Rousseeuw,et al.  Wiley Series in Probability and Mathematical Statistics , 2005 .

[14]  Philippe Robert.  Stochastic Networks and Queues , 2003 .

[15]  F. Guillemin,et al.  A Markovian analysis of additive-increase multiplicative-decrease algorithms , 2002, Advances in Applied Probability.

[16]  P. Billingsley,et al.  Convergence of Probability Measures , 1969 .

[17]  École d'été de probabilités de Saint-Flour,et al.  École d'été de probabilités de Saint-Flour XIII - 1983 , 1985 .

[18]  Y. Suhov,et al.  Dobrushin's approach to queueing network theory , 1996 .

[19]  Laurent Massoulié,et al.  Bandwidth sharing: objectives and algorithms , 2002, TNET.

[20]  J. Doob.  Stochastic processes , 1953 .

[21]  François Baccelli,et al.  A mean-field model for multiple TCP connections through a buffer implementing RED , 2002, Perform. Evaluation.

[22]  L. Rogers,et al.  Diffusions, Markov processes, and martingales , 1979 .

[23]  C. Graham,et al.  Chaos hypothesis for a system interacting through shared resources , 1994 .

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

[25]  D. McDonald,et al.  MEAN FIELD CONVERGENCE OF A MODEL OF MULTIPLE TCP CONNECTIONS THROUGH A BUFFER IMPLEMENTING RED , 2006, math/0603325.

[26]  Djalil Chafaï,et al.  On the long time behavior of the TCP window size process , 2008, ArXiv.

[27]  Carl Graham,et al.  Chaoticity for Multiclass Systems and Exchangeability Within Classes , 2007, Journal of Applied Probability.

[28]  Philippe Jacquet,et al.  Performance Evaluation of a Single Queue under Multi-User TCP/IP Connections , 2001 .

[29]  Matthew Mathis,et al.  The stationary behavior of ideal TCP congestion avoidance , 1996 .

[30]  C. P. Grünfeld.  Nonlinear Kinetic Models with Chemical Reactions , 2000 .

[31]  R. J. Williams,et al.  Fluid model for a network operating under a fair bandwidth-sharing policy , 2004, math/0407057.

[32]  Philippe Robert,et al.  AIMD algorithms and exponential functionals , 2004 .

[33]  Nicola Bellomo,et al.  Development of Boltzmann Models in Mathematical Biology , 2000 .

[34]  M. Pulvirenti,et al.  Modelling in Applied Sciences: A Kinetic Theory Approach , 2004 .

[35]  Derong Liu.  The Mathematics of Internet Congestion Control , 2005, IEEE Transactions on Automatic Control.

[36]  A. Sznitman.  Topics in propagation of chaos , 1991 .

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

[38]  J. Struckmeier.  Numerical Simulation of the Boltzmann Equation by Particle Methods , 2000 .

[39]  R. Illner,et al.  The mathematical theory of dilute gases , 1994 .

[40]  D. Aldous.  Exchangeability and related topics , 1985 .