The Annals of Applied Probability

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

F. P. Kelly and R. J. Williams

Full-text: Open access

Abstract

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.

Article information

Source
Ann. Appl. Probab., Volume 14, Number 3 (2004), 1055-1083.

Dates
First available in Project Euclid: 13 July 2004

Permanent link to this document
https://projecteuclid.org/euclid.aoap/1089736278

Digital Object Identifier
doi:10.1214/105051604000000224

Mathematical Reviews number (MathSciNet)
MR2071416

Zentralblatt MATH identifier
1066.60093

Subjects
Primary: 60K30: Applications (congestion, allocation, storage, traffic, etc.) [See also 90Bxx] 90B15: Network models, stochastic

Keywords
Bandwidth sharing α-fair flow level Internet model fluid model workload Lyapunov function invariant manifold simultaneous resource possession Lagrange multipliers Brownian model reflected Brownian motion

Citation

Kelly, F. P.; Williams, R. J. Fluid model for a network operating under a fair bandwidth-sharing policy. Ann. Appl. Probab. 14 (2004), no. 3, 1055--1083. doi:10.1214/105051604000000224. https://projecteuclid.org/euclid.aoap/1089736278


Export citation

References

  • Ben Fredj, S., Bonald, T., Proutiere, A., Regnie, G. and Roberts, J. (2001). Statistical bandwidth sharing: A study of congestion at flow level. In Proc. ACM Sigcomm 2001.
  • Bonald, T. and Massoulié, L. (2001). Impact of fairness on Internet performance. In Proc. ACM Sigmetrics 2001.
  • Bramson, M. (1996). Convergence to equilibria for fluid models of FIFO queueing networks. Queueing Syst. Theory Appl. 22 5–45.
  • Bramson, M. (1997). Convergence to equilibria for fluid models of head-of-the-line proportional processor sharing queueing networks. Queueing Syst. Theory Appl. 23 1–26.
  • Bramson, M. (1998). State space collapse with application to heavy traffic limits for multiclass queueing networks. Queueing Syst. Theory Appl. 30 89–148.
  • Bramson, M. and Dai, J. G. (2001). Heavy traffic limits for some queueing networks. Ann. Appl. Probab. 11 49–90.
  • Bu, T. and Towsley, D. (2001). Fixed point approximation for TCP behavior in an AQM network. In Proc. ACM Sigmetrics 2001.
  • Clarke, F. H. (1990). Optimization and Non Smooth Analysis. SIAM, Philadelphia.
  • de Veciana, G., Lee, T.-J. and Konstantopoulos, T. (2001). Stability and performance analysis of networks supporting elastic services. IEEE/ACM Transactions on Networking 9 2–14.
  • Ethier, S. N. and Kurtz, T. G. (1986). Markov Processes: Characterization and Convergence. Wiley, New York.
  • Floyd, S. and Fall, K. (1999). Promoting the use of end-to-end congestion control in the Internet. IEEE/ACM Transactions on Networking 7 458–472.
  • Gibbens, R. J., Sargood, S. K., van Eijl, C., Kelly, F. P., Azmoodeh, H., Macfadyen, R. N. and Macfadyen, N. W. (2000). Fixed-point models for the end-to-end performance analysis of IP networks. In 13th ITC Specialist Seminar: IP Traffic Measurement, Modeling and Management.
  • Harrison, J. M. (2000). Brownian models of open processing networks: Canonical representation of workload. Ann. Appl. Probab. 10 75–103. [Correction (2003) 13 390–393.]
  • Harrison, J. M. (2003). A broader view of Brownian networks. Ann. Appl. Probab. 13 1119–1150.
  • Luenberger, D. G. (1969). Optimization by Vector Space Methods. Wiley, New York.
  • Mathis, M., Semke, J., Mahdavi, J. and Ott, T. (1997). The macroscopic behaviour of the TCP congestion avoidance algorithm. Computer Communication Review 27 67–82.
  • Mo, J. and Walrand, J. (2000). Fair end-to-end window-based congestion control. IEEE/ACM Transactions on Networking 8 556–567.
  • Padhye, J., Firoiu, V., Towsley, D. and Kurose, J. (2000). Modeling TCP Reno performance: A simple model and its empirical validation. IEEE/ACM Transactions on Networking 8 133–145.
  • Roberts, J. and Massoulié, L. (2000). Bandwidth sharing and admission control for elastic traffic. Telecomunication Systems 15 185–201.
  • Roughan, M., Erramilli, A. and Veitch, D. (2001). Network performance for TCP networks, Part I: Persistent Sources. In Proc. International Teletraffic Congress 24–28.
  • Williams, R. J. (1998). Diffusion approximations for open multiclass queueing networks: Sufficient conditions involving state space collapse. Queueing Syst. Theory Appl. 30 27–88.