[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
article

Impact of fairness on Internet performance

Published: 01 June 2001 Publication History

Abstract

We discuss the relevance of fairness as a design objective for congestion control mechanisms in the Internet. Specifically, we consider a backbone network shared by a dynamic number of short-lived flows, and study the impact of bandwidth sharing on network performance. In particular, we prove that for a broad class of fair bandwidth allocations, the total number of flows in progress remains finite if the load of every link is less than one. We also show that provided the bandwidth allocation is "sufficiently" fair, performance is optimal in the sense that the throughput of the flows is mainly determined by their access rate. Neither property is guaranteed with unfair bandwidth allocations, when priority is given to one class of flow with respect to another. This suggests current proposals for a differentiated services Internet may lead to suboptimal utilization of network resources.

References

[1]
S. Ben Fredj, T. Bonald, G. Regniffe, J.W. Roberts, "Statistical bandwidth sharing: a study of congestion at ow level", submitted, 2001.
[2]
D. Bertsekas and R. Gallager, Data Networks, Prentice Hall, 1987.
[3]
S. Blake et. al., An Architecture for Differentiated Services, RFC 2475, December 1998.
[4]
J. W. Cohen, "The multiple phase service network with generalized processor sharing", Acta Informatica 12 (1979) 245-284.
[5]
M. Crovella and A. Bestravos, "Self-similarity in World Wide Web traffic Evidence and possible causes", in: Proc. of ACM SIGMETRICS'96, 1996.
[6]
J.G. Dai "On positive Harris recurrence of multiclass queuing networks: a unified approach via uid limit models", Ann. of Applied Probability 5 (1995) 49-77.
[7]
G. De Veciana, T.J. Lee and T. Konstantopoulos, "Stability and performance analysis of networks supporting services with rate control - Could the Internet be unstable?", in: Proc. of IEEE INFOCOM'99, 1999.
[8]
G. Fayolle, I. Mitrani and R. Iasnogorodski, "Sharing a processor among many classes", Journal of the ACM 27 (1980) 519-532.
[9]
S. Floyd and V. Jacobson, "Link-sharing and resource management models for packet networks", IEEE/ACM Trans. on Networking 3-4 (1995) 365-386.
[10]
F. P. Kelly, Reversibility and Stochastic Networks, Wiley, 1979.
[11]
F. P. Kelly, A. Maulloo and D. Tan, "Rate control for communication networks: shadow prices, proportional fairness and stability", Journal of the Operational Research Society 49 (1998).
[12]
L. Kleinrock, Queueing Systems, Volume 2, J. Wiley & Sons, 1975.
[13]
S. Kunniyur and R. Srikant, End-to-end congestion control schemes: Utility functions, random losses and ECN marks, in:Proc. of IEEE INFOCOM'00, 2000.
[14]
L. Massouliffe and J.W. Roberts, "Bandwidth sharing: objectives and algorithms", in: Proc. of IEEE INFOCOM'99, 1999.
[15]
L. Massouliffe and J.W. Roberts, "Bandwidth sharing and admission control for elastic traffic", Telecommunication Systems 15 (2000) 185-201.
[16]
J. Mo and J. Walrand, "Fair end-to-end window-based congestion control", IEEE/ACM Trans. on Networking 8-5 (2000) 556-567.
[17]
M. Vojnovic, J.-Y. Le Boudec and C. Boutremans "Global fairness of additive-increase and multiplicative-decrease with heterogeneous round-trip times", in: Proc. of IEEE INFOCOM'00, 2000.

Cited By

View all
  • (2023)Fairness in maximal covering location problemsComputers and Operations Research10.1016/j.cor.2023.106287157:COnline publication date: 1-Sep-2023
  • (2023)Comparison of stability regions for a line distribution network with stochastic load demandsQueueing Systems: Theory and Applications10.1007/s11134-023-09873-z103:3-4(187-239)Online publication date: 15-Mar-2023
  • (2022)Integrated Online Learning and Adaptive Control in Queueing Systems with Uncertain PayoffsOperations Research10.1287/opre.2021.210070:2(1166-1181)Online publication date: 1-Mar-2022
  • Show More Cited By

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM SIGMETRICS Performance Evaluation Review
ACM SIGMETRICS Performance Evaluation Review  Volume 29, Issue 1
June 2001
343 pages
ISSN:0163-5999
DOI:10.1145/384268
Issue’s Table of Contents
  • cover image ACM Conferences
    SIGMETRICS '01: Proceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
    June 2001
    347 pages
    ISBN:1581133340
    DOI:10.1145/378420
    • Chairman:
    • Mary Vernon
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 June 2001
Published in SIGMETRICS Volume 29, Issue 1

Check for updates

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)31
  • Downloads (Last 6 weeks)4
Reflects downloads up to 06 Jan 2025

Other Metrics

Citations

Cited By

View all
  • (2023)Fairness in maximal covering location problemsComputers and Operations Research10.1016/j.cor.2023.106287157:COnline publication date: 1-Sep-2023
  • (2023)Comparison of stability regions for a line distribution network with stochastic load demandsQueueing Systems: Theory and Applications10.1007/s11134-023-09873-z103:3-4(187-239)Online publication date: 15-Mar-2023
  • (2022)Integrated Online Learning and Adaptive Control in Queueing Systems with Uncertain PayoffsOperations Research10.1287/opre.2021.210070:2(1166-1181)Online publication date: 1-Mar-2022
  • (2022)Asymptotic behavior of a critical fluid model for bandwidth sharing with general file size distributionsThe Annals of Applied Probability10.1214/21-AAP172332:3Online publication date: 1-Jun-2022
  • (2021)Minimal and Locally Edge Minimal Fluid Models for Resource-Sharing NetworksMathematics of Operations Research10.1287/moor.2020.111046:4(1513-1551)Online publication date: 1-Nov-2021
  • (2021)Minimal Delay Violation-Based Cross-Layer Scheduler and Resource Allocation for DSL NetworksIEEE Access10.1109/ACCESS.2021.30817939(75905-75922)Online publication date: 2021
  • (2020)Networking in the absence of congestion controlStochastic Models10.1080/15326349.2020.1742160(1-27)Online publication date: 25-Mar-2020
  • (2020)Stability and moment bounds under utility-maximising service allocations: Finite and infinite networksAdvances in Applied Probability10.1017/apr.2020.852:2(463-490)Online publication date: 15-Jul-2020
  • (2020)Stability conditions for a decentralised medium access algorithm: single- and multi-hop networksQueueing Systems: Theory and Applications10.1007/s11134-019-09635-w94:1-2(109-128)Online publication date: 1-Feb-2020
  • (2020)Optimal Nash Equilibria for Bandwidth AllocationWeb and Internet Economics10.1007/978-3-030-64946-3_6(77-88)Online publication date: 7-Dec-2020
  • Show More Cited By

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media