Fluid model for a network operating under a fair bandwidth-sharing policy

We consider a model of Internet congestion control that represents the randomly varying number of flows present in a network where bandwidth is shared fairly between document transfers. We study critical fluid models obtained as formal limits under law of large numbers scalings when the average load on at least one resource is equal to its capacity. We establish convergence to equilibria for fluid models and identify the invariant manifold. The form of the invariant manifold gives insight into the phenomenon of entrainment whereby congestion at some resources may prevent other resources from working at their full capacity.

[1]  D. Luenberger.  Optimization by Vector Space Methods , 1968 .

[2]  E. Perkins,et al.  9. Markov Processes, Characterization and Convergence , 1988 .

[3]  Maury Bramson,et al.  Convergence to equilibria for fluid models of head-of-the-line proportional processor sharing queueing networks , 1996, Queueing Syst. Theory Appl..

[4]  Maury Bramson,et al.  Convergence to equilibria for fluid models of FIFO queueing networks , 1996, Queueing Syst. Theory Appl..

[5]  Matthew Mathis,et al.  The macroscopic behavior of the TCP congestion avoidance algorithm , 1997, CCRV.

[6]  Ruth J. Williams,et al.  Diffusion approximations for open multiclass queueing networks: sufficient conditions involving state space collapse , 1998, Queueing Syst. Theory Appl..

[7]  Maury Bramson,et al.  State space collapse with application to heavy traffic limits for multiclass queueing networks , 1998, Queueing Syst. Theory Appl..

[8]  Sally Floyd,et al.  Promoting the use of end-to-end congestion control in the Internet , 1999, TNET.

[9]  Richard J. Gibbens,et al.  Fixed-Point Models for the End-to-End Performance Analysis of IP Networks , 2000 .

[10]  Jean C. Walrand,et al.  Fair end-to-end window-based congestion control , 2000, TNET.

[11]  Donald F. Towsley,et al.  Modeling TCP Reno performance: a simple model and its empirical validation , 2000, TNET.

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

[13]  J. Harrison.  Brownian models of open processing networks: canonical representation of workload , 2000 .

[14]  Fixed point approximations for TCP behavior in an AQM network , 2001, SIGMETRICS/Performance.

[15]  M. Roughan,et al.  Network performance for TCP networks Part I: Persistent sources , 2001 .

[16]  Laurent Massoulié,et al.  Impact of fairness on Internet performance , 2001, SIGMETRICS '01.

[17]  Gustavo de Veciana,et al.  Stability and performance analysis of networks supporting elastic services , 2001, TNET.

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

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

[20]  Donald F. Towsley,et al.  Fixed point approximations for TCP behavior in an AQM network , 2001, SIGMETRICS '01.

[21]  J. Dai,et al.  Heavy Traffic Limits for Some Queueing Networks , 2001 .

[22]  Maury Bramson,et al.  Heavy TraÆ Limits for Some Queueing Networks , 2001 .

[23]  J. Harrison.  A broader view of Brownian networks , 2003 .

[24]  S. Ethier,et al.  Markov Processes: Characterization and Convergence , 2005 .