A survey on statistical bandwidth sharing

Computer Networks

Volumn 45, Issue 3, 2004, Pages 319-332

  Roberts, J W ^a  

^a ORANGE LABS   (France)

Author keywords

Admission control; Balanced fairness; Elastic traffic; Internet traffic theory; Processor sharing

Indexed keywords

COMPUTER NETWORKS; MATHEMATICAL MODELS; NETWORK PROTOCOLS; RANDOM PROCESSES; SCHEDULING; TELECOMMUNICATION LINKS; TELECOMMUNICATION TRAFFIC; THROUGHPUT; TRAFFIC CONTROL; WIRELESS TELECOMMUNICATION SYSTEMS;

ADMISSION CONTROL; BALANCED FAIRNESS; ELASTIC TRAFFIC; INTERNET TRAFFIC THEORY; PROCESSOR SHARING;

BANDWIDTH;

EID: 2342666689     PISSN: 13891286     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comnet.2004.03.010     Document Type: Conference Paper

References (49)

1. E. Altman, T. Jimenez, D. Kofman, DPS queues with stationary ergodic service times and the performance of TCP in overload, in: Proceedings of IEEE Infocom 2004.
2. Baccelli F., Bremaud P. Elements of Queueing Theory. Applications of Mathematics. vol. 26:1994;Springer, Berlin.
3. F. Baccelli, D. Hong, Interaction of TCP flows as billiards, in: Proceedings of IEEE Infocom 2003.
4. N. Bansal, M. Harchol-Balter, Analysis of SRPT scheduling: investigating unfairness, in: Proceedings of ACM Sigmetrics 2001.
5. Baskett F., Chandy K.M., Muntz R.R., Palacios F.G. Open, closed and mixed networks of queues with different classes of customers. J. ACM. 22:1975;248-260.
6. S. Ben Fredj, T. Bonald, A. Proutière, G. Régnié, J. Roberts, Statiscal bandwidth sharing: a study of congestion at flow level, in: Proceedings of ACM SIGCOMM 2001.
7. Ben Fredj S., Oueslati-Boulahia S., Roberts J.W. Measurement-based admission control for elastic traffic. Teletraffic Engineering in the Internet Era, ITC 17. 2001;Elsevier, Amsterdam.
8. Berger A., Kogan Y. Dimensioning bandwidth for elastic traffic in high-speed data networks. IEEE/ACM Trans. Network. 8(5):2000;643-654.
9. Bertsekas D., Gallager R. Data Networks. 1987;Prentice Hall, Englewood Cliffs, NJ.
10. T. Bonald, L. Massoulié, Impact of fairness on Internet performance, in: Proceedings of ACM Sigmetrics 2001.
11. Bonald T., Olivier P., Roberts J. Dimensioning high speed IP access networks. Proceedings of ITC 18. 2003;Elsevier, Amsterdam.
12. Bonald T., Proutière A. Insensitivity in processor-sharing networks. Perform. Evaluat. 49:2002;193-209.
13. Bonald T., Proutière A. Insensitive bandwidth sharing in data networks. Queue. Syst. 44(1):2003;69-100.
14. Bonald T., Proutière A. On performance bounds for balanced fairness. Perform. Evaluat. 55:2004;25-50.
15. T. Bonald, A. Proutière, G. Régnié, J.W. Roberts, Insensitivity results in statistical bandwidth sharing, in: ITC 17th 2001.
16. Bonald T., Proutiére A., Roberts J., Virtamo J. Computational aspects of balanced fairness. Proceedings of ITC 18. 2003;Elsevier, Amsterdam.
17. Bonald T., Roberts J. Congestion at flow level and the impact of user behaviour. Comput. Networks. 42:2003;521-536.
18. J. Boyer, F. Guillemin, P. Robert, B. Zwart, Heavy tailed M/G/1-PS queues with impatience and admission control in packet networks, in: Proceedings of IEEE Infocom 2003.
19. P. Brown, D. Collange, Sharing resources in overload with TCP, France Telecom R&D Technical Report, 2004.
20. T. Bu, D. Towsley, Fixed point approximation for TCP behavior in an AQM network, in: Proceedings of ACM Sigmetrics 2001.
21. A. Chaintreau, F. Baccelli, D. de Vleeschauwer, D. McDonald, A mean field analysis of interacting HTTP flows, in: Proceedings of ACM Sigmetrics 2004.
22. Cohen J.W. The multiple phase service network with generalized processor sharing. Acta Informat. 12:1979;245-284.
23. M. Crovella, R. Frangioso, M. Harchol-Balter, Connection scheduling in Web servers, in: Usenix Symposium on Internet Technologies and Systems (USITS'99), Boulder, CO, October 1999, pp. 243-254.
24. G. Fayolle, A. de la Fortelle, J.-M. Lasgouttes, L. Massoulié, J.W. Roberts, Best-effort networks: modeling and performance analysis via large networks asymptotics, in: Proceedings of IEEE Infocom 2001.
25. Fayolle G., Mitrani I., Iasnogorodski R. Sharing a processor among many job classes. J. ACM. 27(3):1980;519-532.
26. Floyd S., Paxson V. Difficulties in simulating the Internet. IEEE/ACM Trans. Network. 9(4):2001;393-403.
27. R. Gibbens, S. Sargood, C. Van Eijl, F. Kelly, H. Azmoodeh, R. Macfadyen, N. Macfadyen, Fixed-point models for the end-to-end performance analysis of IP networks, in: 13th ITC Special Seminar: IP Traffic Management, Modeling and Management, 2000.
28. Garetto M., Lo Cigno R., Meo M., Ajmone Marsan M. Modeling short-lived TCP connections with open multiclass queuing networks. Comput. Networks. 44:2004;153-176.
29. Harchol-Balter M., Schroeder B., Bansal N., Agrawal M. Size-based scheduling to improve Web performance. ACM Trans. Comput. Syst. 21(2):2003;207-233.
30. D.P. Heyman, T.V. Lakshman, A.L. Neidhardt, A new method for analyzing feedback based protocols with applications to engineering Web traffic over the Internet, in: Proceedings of IEEE Sigmetrics'97, February 1997, p. 2438.
31. Jean-Marie A., Robert P. On the transient behaviour of the processor sharing queue. Queue. Syst. Theory Appl. 17:1994;129-136.
32. Kelly F.P. Reversibility and Stochastic Networks. 1979;Wiley, New York.
33. Kelly F.P., Maulloo A., Tan D. Rate control for communication networks: shadow prices, proportional fairness and stability. J. Operat. Res. Soc. 49:1998;237-252.
34. F. Kelly, R. Williams, Fluid model for a network operating under a fair bandwidth sharing policy, Ann. Appl. Probab., in press.
35. A. Kherani, A. Kumar, Stochastic models for throughput analysis of randomly arriving elastic flows in the Internet, in: Proceedings of IEEE Infocom 2002.
36. Kumar A., Hegde M., Anand S.V.R. NETMASTER: experiences in using nonintrusive TCP connection admission control for bandwidth management of an Internet access link. IEEE Communications Magazine. 38(5):2000;160-167.
37. Lassila P., van den Berg H., Mandjes M., Kooij R. An integrated packet/flow model for TCP performance analysis. Proceedings of ITC 18. 2003;Elsevier, Amsterdam.
38. R. Litjens, H. van den Berg, R. Boucherie, Throughput measures for processor sharing models, COST 279 document (03)022, 2003, pp. 320-328.
39. Massoulié L., Roberts J.W. Arguments in favor of admission control for TCP flows. Teletraffic Engineering in a Competitive World, ITC 16. 1999;33-44 Elsevier, Amsterdam.
40. Massoulié L., Roberts J.W. Bandwidth sharing and admission control for elastic traffic. Telecommun. Syst. 15:2000;185-201.
41. Mo J., Walrand J. Fair end-to-end window-based congestion control. IEEE/ACM Trans. Network. 8(5):2000;556-567.
42. Mortier R., Pratt I., Clark C., Crosby S. Implicit admission control. IEEE J. Selected Areas Commun. 18(12):2000;2629-2639.
43. Nabe M., Murata M., Miyahara H. Analysis and modeling of World Wide Web traffic for capacity dimensioning of Internet access lines. Perform. Evaluat. 34:1998;249-271.
44. I.A. Rai, G. Urvoy-Keller, E.W. Biersack, Analysis of LAS scheduling for job size distributions with high variance, in: ACM Sigmetrics 2003, June 2003, pp. 218-228.
45. Serfozo R. Introduction to Stochastic Networks. 1999;Springer, Berlin.
46. Schrage L., Miller L. The queue M/G/1 with shortest processing time first discipline. Operat. Res. 14:1966;670-684.
47. de Veciana G., Lee T.-J., Konstantopoulos T. Stability and performance analysis of networks supporting ABR and best effort-like services. IEEE/ACM Trans. Network. 9(1):2001;2-14.
48. S. Yang, G. de Veciana, Bandwidth sharing: the role of user impatience, in: Proceedings of Globecom, 2001.
49. Yang, G. de Veciana, Size-based adaptive bandwidth allocation: optimizing the average QoS for elastic traffic, in: Proceedings of IEEE Infocom 2002.