article

A survey on statistical bandwidth sharing

Author:

J. W. RobertsAuthors Info & Claims

Computer Networks: The International Journal of Computer and Telecommunications Networking, Volume 45, Issue 3

Pages 319 - 332

https://doi.org/10.1016/j.comnet.2004.03.010

Published: 21 June 2004 Publication History

Abstract

The paper provides a survey of recent results on the performance of a network handling elastic data traffic under the assumption that flows are generated as a random process. We notably highlight the insensitivity results allowing a relatively simple expression of performance when bandwidth sharing realizes so-called "balanced fairness". In normal load conditions flow throughput mainly depends on the users' access line rate. There is little scope for optimizing performance, by means of size-dependent scheduling on network links, for instance. In overload, performance deteriorates rapidly. Pro-active admission control is then an arguably necessary traffic control to preserve performance. This paper is written as a tribute to the author's friend Olga Casals.

References

[1]

{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]

{2} F. Baccelli, P. Bremaud, Elements of Queueing Theory, in: Applications of Mathematics, vol. 26, Springer, Berlin, 1994.

[3]

{3} F. Baccelli, D. Hong, Interaction of TCP flows as billiards, in: Proceedings of IEEE Infocom 2003.

[4]

{4} N. Bansal, M. Harchol-Balter, Analysis of SRPT scheduling: investigating unfairness, in: Proceedings of ACM Sigmetrics 2001.

[5]

{5} F. Baskett, K.M. Chandy, R.R. Muntz, F.G. Palacios, Open, closed and mixed networks of queues with different classes of customers, J. ACM 22 (1975) 248-260.

Digital Library

[6]

{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]

{7} S. Ben Fredj, S. Oueslati-Boulahia, J.W. Roberts, Measurement-based admission control for elastic traffic, in: Teletraffic Engineering in the Internet Era, ITC 17, Elsevier, Amsterdam, 2001.

[8]

{8} A. Berger, Y. Kogan, Dimensioning bandwidth for elastic traffic in high-speed data networks, IEEE/ACM Trans. Network, 8 (5) (2000) 643-654.

Digital Library

[9]

{9} T. Bertsekas, R. Gallager, Data Networks, Prentice Hall, Englewood Cliffs, NJ, 1987.

[10]

{10} T. Bonald, L. Massoulié, Impact of fairness on Internet performance, in: Proceedings of ACM Sigmetrics 2001.

Digital Library

[11]

{11} T. Bonald, P. Olivier, J. Roberts, Dimensioning high speed IP access networks, in: Proceedings of ITC 18, Elsevier, Amsterdam, 2003.

[12]

{12} T. Bonald, A. Proutière, Insensitivity in processor-sharing networks. Perform. Evaluat. 49 (2002) 193-209.

Digital Library

[13]

{13} T. Bonald, A. Proutière, Insensitive bandwidth sharing in data networks, Queue. Syst. 44(1) (2003) 69-100.

[14]

{14} T. Bonald, A. Proutière, On performance bounds for balanced fairness, Perform. Evaluat. 55 (2004) 25-50.

Digital Library

[15]

{15} T. Bonald, A. Proutière, G. Régnié, J.W. Roberts, Insensitivity results in statistical bandwidth sharing, in: ITC 17th 2001.

[16]

{16} T. Bonald, A. Proutiére, J. Roberts, J. Virtamo, Computational aspects of balanced fairness, in: Proceedings of ITC 18, Elsevier, Amsterdam, 2003.

[17]

{17} T. Bonald, J. Roberts, Congestion at flow level and the impact of user behaviour, Comput. Networks 42 (2003) 521-536.

Digital Library

[18]

{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]

{19} P. Brown, D. Collange, Sharing resources in overload with TCP. France Telecom R&D Technical Report, 2004.

[20]

{20} T. Bu, D. Towsley, Fixed point approximation for TCP behavior in an AQM network, in: Proceedings of ACM Sigmetrics 2001.

[21]

{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]

{22} J.W. Cohen, The multiple phase service network with generalized processor sharing. Acta Informat. 12 (1979) 245-284.

Digital Library

[23]

{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]

{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]

{25} G. Fayolle, I. Mitrani, R. Iasnogorodski, Sharing a processor among many job classes, J. ACM 27 (3) (1980) 519-532.

Digital Library

[26]

{26} S. Floyd, V. Paxson, Difficulties in simulating the Internet, IEEE/ACM Trans. Network. 9 (4) (2001) 393-403.

Digital Library

[27]

{27} R. Gibbons, S. Sargood, C. Van Eiji, 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]

{28} M. Garetto, R. Lo Cigno, M. Meo, M. Ajmone Marsan, Modeling short-lived TCP connections with open multiclass queuing networks, Comput. Networks 44 (2004) 153-176.

Digital Library

[29]

{29} M. Harchol-Balter, B. Schroeder, N. Bansal, M. Agrawal, Size-based scheduling to improve Web performance. ACM Trans. Comput. Syst. 21 (2) (2003) 207-233.

Digital Library

[30]

{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.

Digital Library

[31]

{31} A. Jean-Marie, P. Robert, On the transient behaviour of the processor sharing queue, Queue. Syst. Theory Appl. 17 (1994) 129-136.

[32]

{32} F.P. Kelly, Reversibility and Stochastic Networks, Wiley, New York, 1979.

[33]

{33} F.P. Kelly, A. Maulloo, D. Tan, Rate control for communication networks: shadow prices, proportional fairness and stability, J. Operat. Res. Soc. 49 (1998) 237-252.

[34]

{34} F. Kelly, R. Williams, Fluid model for a network operating under a fair bandwidth sharing policy, Ann. Appl. Probab., in press.

[35]

{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]

{36} A. Kumar, M. Hegde, S.V.R. Anand, 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.

Digital Library

[37]

{37} P. Lassila, H. van den Berg, M. Mandjes, R. Kooij, An integrated packet/flow model for TCP performance analysis, in: Proceedings of ITC 18, Elsevier, Amsterdam, 2003.

[38]

{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]

{39} L. Massoulié, J.W. Roberts, Arguments in favor of admission control for TCP flows, in: Teletraffic Engineering in at Competitive World, ITC 16, Elsevier, Amsterdam, 1999, pp. 33-44.

[40]

{40} L. Massoulié, J.W. Roberts, Bandwidth sharing and admission control for elastic traffic, Telecommun. Syst. 15 (2000) 185-201.

Digital Library

[41]

{41} J. Mo, J. Walrand, Fair end-to-end window-based congestion control, IEEE/ACM Trans. Network. 8 (5) (2000) 556-567.

Digital Library

[42]

{42} R. Mortier, I. Pratt, C. Clark, S. Crosby, Implicit admission control, IEEE J. Selected Areas Commun. 18 (12) (2000) 2629-2639.

Digital Library

[43]

{43} M. Nabe, M. Murata, H. Miyahara, Analysis and modeling of World Wide Web traffic for capacity dimensioning of Internet access lines, Perform. Evaluat. 34 (1998) 249-271.

Digital Library

[44]

{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.

Digital Library

[45]

{45} R. Serfozo, Introduction to Stochastic Networks, Springer, Berlin, 1999.

[46]

{46} L. Schrage, L. Miller, The queue M/G/1 with shortest processing time first discipline, Operat. Res. 14 (1966) 670-684.

Digital Library

[47]

{47} G. de Veciana, T.-J. Lee, T. Konstantopoulos, Stability and performance analysis of networks supporting ABR and best effort-like services, IEEE/ACM Trans. Network. 9 (1) (2001) 2-14.

Digital Library

[48]

{48} S. Yang, G. de Veciana, Bandwidth sharing: the role of user impatience, in: Proceedings of Globecom, 2001.

[49]

{49} S. Yang, G. de Veciana, Size-based adaptive bandwidth allocation: optimizing the average QoS for elastic traffic, in: Proceedings of IEEE Infocom 2002.

Cited By

Fiems DPrabhu B(2024)Strategic Routing in Heterogeneous Discriminatory Processor Sharing QueuesNetwork Games, Artificial Intelligence, Control and Optimization10.1007/978-3-031-78600-6_2(14-23)Online publication date: 8-Oct-2024
https://dl.acm.org/doi/10.1007/978-3-031-78600-6_2
Fiems D(2023)Strategic Revenue Management for Discriminatory Processor Sharing QueuesComputer Performance Engineering and Stochastic Modelling10.1007/978-3-031-43185-2_1(3-17)Online publication date: 20-Jun-2023
https://dl.acm.org/doi/10.1007/978-3-031-43185-2_1
Chis THarrison P(2016)Higher response time moments for M/M/1 discriminatory processor sharing queuesProceedings of the 9th EAI International Conference on Performance Evaluation Methodologies and Tools10.4108/eai.14-12-2015.2262730(145-148)Online publication date: 4-Jan-2016
https://dl.acm.org/doi/10.4108/eai.14-12-2015.2262730
Show More Cited By

Index Terms

A survey on statistical bandwidth sharing
1. Networks

Recommendations

An end-to-end QoS framework with on-demand bandwidth reconfiguration

This paper proposes a new QoS framework, called the On-Demand QoS Path framework (ODP). It provides end-to-end QoS guarantees to individual flows with minimal overhead, while keeping the scalability characteristic of DiffServ. ODP exercises per-flow ...
A network scheme for TCP elastic traffic with admission control using edge-to-edge per-aggregate measurements in class-based networks

We propose a network scheme with Admission Control AC for TCP flows, which can provide different minimum throughputs and isolation between flows. It is built with simple mechanisms without per-flow state, per flow signaling or per-flow processing in the ...
A guaranteed minimum throughput service for TCP flows using measurement-based admission control: Research Articles

We propose a new scheme for a network service that guarantees a minimum throughput to flows accepted by admission control (AC). The whole scheme only uses a small set of packet classes in a core-stateless network. At the ingress of the network each flow ...

Comments

Information & Contributors

Information

Published In

cover image Computer Networks: The International Journal of Computer and Telecommunications Networking

Computer Networks: The International Journal of Computer and Telecommunications Networking Volume 45, Issue 3

Special issue: In memroy of Olga Casals

21 June 2004

134 pages

ISSN:1389-1286

Issue’s Table of Contents

Publisher

Elsevier North-Holland, Inc.

United States

Publication History

Published: 21 June 2004

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

23
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 28 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Fiems DPrabhu B(2024)Strategic Routing in Heterogeneous Discriminatory Processor Sharing QueuesNetwork Games, Artificial Intelligence, Control and Optimization10.1007/978-3-031-78600-6_2(14-23)Online publication date: 8-Oct-2024
https://dl.acm.org/doi/10.1007/978-3-031-78600-6_2
Fiems D(2023)Strategic Revenue Management for Discriminatory Processor Sharing QueuesComputer Performance Engineering and Stochastic Modelling10.1007/978-3-031-43185-2_1(3-17)Online publication date: 20-Jun-2023
https://dl.acm.org/doi/10.1007/978-3-031-43185-2_1
Chis THarrison P(2016)Higher response time moments for M/M/1 discriminatory processor sharing queuesProceedings of the 9th EAI International Conference on Performance Evaluation Methodologies and Tools10.4108/eai.14-12-2015.2262730(145-148)Online publication date: 4-Jan-2016
https://dl.acm.org/doi/10.4108/eai.14-12-2015.2262730
Chis THarrison PZomaya AMin GLoureiro A(2016)Performance-Energy Trade-offs in SmartphonesProceedings of the 19th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems10.1145/2988287.2989140(127-135)Online publication date: 13-Nov-2016
https://dl.acm.org/doi/10.1145/2988287.2989140
Izagirre AAyesta UVerloop I(2016)Sojourn Time Approximations for a Discriminatory Processor Sharing QueueACM Transactions on Modeling and Performance Evaluation of Computing Systems10.1145/28128071:1(1-31)Online publication date: 22-Feb-2016
https://dl.acm.org/doi/10.1145/2812807
Remerova MReed JZwart B(2014)Fluid Limits for Bandwidth-Sharing Networks with Rate ConstraintsMathematics of Operations Research10.1287/moor.2013.064139:3(746-774)Online publication date: 1-Aug-2014
https://dl.acm.org/doi/10.1287/moor.2013.0641
Fiems DDe Turck KHorvath ABuchholz PCortellessa VMuscariello LSquillante M(2013)A series expansion approach for finite-capacity processor sharing queuesProceedings of the 7th International Conference on Performance Evaluation Methodologies and Tools10.4108/icst.valuetools.2013.254394(118-125)Online publication date: 10-Dec-2013
https://dl.acm.org/doi/10.4108/icst.valuetools.2013.254394
Alizadeh MKabbani AEdsall TPrabhakar BVahdat AYasuda MGribble SKatabi D(2012)Less is moreProceedings of the 9th USENIX conference on Networked Systems Design and Implementation10.5555/2228298.2228324(19-19)Online publication date: 25-Apr-2012
https://dl.acm.org/doi/10.5555/2228298.2228324
Rojas-Mora JJiménez TAltman ELasaulce SFiems DHarrison PVandendorpe L(2011)Simulating flow level bandwidth sharing with pareto distributed file sizesProceedings of the 5th International ICST Conference on Performance Evaluation Methodologies and Tools10.5555/2151688.2151718(265-273)Online publication date: 16-May-2011
https://dl.acm.org/doi/10.5555/2151688.2151718
Frolkova MReed JZwart B(2011)Fixed-point approximations of bandwidth sharing networks with rate constraintsACM SIGMETRICS Performance Evaluation Review10.1145/2034832.203484439:2(47-49)Online publication date: 15-Sep-2011
https://dl.acm.org/doi/10.1145/2034832.2034844
Show More Cited By

View Options

View options

Figures

Tables

Media

View Issue’s Table of Contents