zbMATH — the first resource for mathematics

Fluid model for a network operating under a fair bandwidth-sharing policy. (English) Zbl 1066.60093
The paper starts from an exponential model for active transmission flows in the internet with Poisson arrivals of flows and with a fair resource sharing policy. Resource sharing is a generalization of traditional processor sharing: Flows interfere by requesting simultaneously the same transmission capacity, and the portions of capacity dedicated to the different classes of flows are computed from a constrained (by the overall capacities) optimization procedure which yields so-called wighted alpha-fair allocation. Several favourable properties of this policy are proved. It is assumed that some of the resources operate in heavy traffic, which means that their capacity is fully used, expressed via the constraints in the optimization procedure being saturated. From the stochastic network model a fluid limit is derived and used to study the behaviour of the active flows under a law of large numbers scaling. The set of invariant states of the fluid model (invariant manifold) is studied and several characterisations of invariant states are given. The authors discuss in some detail possible consequences for obtaining diffusion approximations for which their fluid limit results open the way.

60K30 Applications of queueing theory (congestion, allocation, storage, traffic, etc.)
90B15 Stochastic network models in operations research
60K25 Queueing theory (aspects of probability theory)
PDF BibTeX Cite
Full Text: DOI arXiv
[1] 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 .
[2] Bonald, T. and Massoulié, L. (2001). Impact of fairness on Internet performance. In Proc. ACM Sigmetrics 2001 .
[3] Bramson, M. (1996). Convergence to equilibria for fluid models of FIFO queueing networks. Queueing Syst. Theory Appl. 22 5–45. · Zbl 0851.90044
[4] 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. · Zbl 0879.60087
[5] Bramson, M. (1998). State space collapse with application to heavy traffic limits for multiclass queueing networks. Queueing Syst. Theory Appl. 30 89–148. · Zbl 0911.90162
[6] Bramson, M. and Dai, J. G. (2001). Heavy traffic limits for some queueing networks. Ann. Appl. Probab. 11 49–90. · Zbl 1016.60084
[7] Bu, T. and Towsley, D. (2001). Fixed point approximation for TCP behavior in an AQM network. In Proc. ACM Sigmetrics 2001 .
[8] Clarke, F. H. (1990). Optimization and Non Smooth Analysis . SIAM, Philadelphia. · Zbl 0696.49002
[9] 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.
[10] Ethier, S. N. and Kurtz, T. G. (1986). Markov Processes : Characterization and Convergence . Wiley, New York. · Zbl 0592.60049
[11] 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.
[12] 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 . · Zbl 1076.90501
[13] 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.] · Zbl 1131.60306
[14] Harrison, J. M. (2003). A broader view of Brownian networks. Ann. Appl. Probab. 13 1119–1150. · Zbl 1060.90020
[15] Luenberger, D. G. (1969). Optimization by Vector Space Methods . Wiley, New York. · Zbl 0176.12701
[16] 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.
[17] Mo, J. and Walrand, J. (2000). Fair end-to-end window-based congestion control. IEEE/ACM Transactions on Networking 8 556–567.
[18] 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.
[19] Roberts, J. and Massouli√©, L. (2000). Bandwidth sharing and admission control for elastic traffic. Telecomunication Systems 15 185–201. · Zbl 1030.68774
[20] Roughan, M., Erramilli, A. and Veitch, D. (2001). Network performance for TCP networks, Part I: Persistent Sources. In Proc. International Teletraffic Congress 24–28.
[21] Williams, R. J. (1998). Diffusion approximations for open multiclass queueing networks: Sufficient conditions involving state space collapse. Queueing Syst. Theory Appl. 30 27–88. · Zbl 0911.90171
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.