More Web Proxy on the site http://driver.im/

article

Statistical bandwidth sharing: a study of congestion at flow level

Authors:

J. W. RobertsAuthors Info & Claims

ACM SIGCOMM Computer Communication Review, Volume 31, Issue 4

Pages 111 - 122

https://doi.org/10.1145/964723.383068

Published: 27 August 2001 Publication History

Abstract

In this paper we study the statistics of the realized throughput of elastic document transfers, accounting for the way network bandwidth is shared dynamically between the randomly varying number of concurrent flows. We first discuss the way TCP realizes statistical bandwidth sharing, illustrating essential properties by means of packet level simulations. Mathematical flow level models based on the theory of stochastic networks are then proposed to explain the observed behavior. A notable result is that first order performance (e.g., mean throughput) is insensitive with respect both to the flow size distribution and the flow arrival process, as long as "sessions" arrive according to a Poisson process. Perceived performance is shown to depend most significantly on whether demand at flow level is less than or greater than available capacity. The models provide a key to understanding the effectiveness of techniques for congestion management and service differentiation.

References

[1]

E.Altman,C.Barakat,and K.Avrachenkov.A stochastic model of tcp/ip with stationary random losses.In Proc.of ACM SIGCOMM '00 2000.

Digital Library

[2]

F.Baskett,K.M.Chandy R.R.Muntz,and F.G. Pallacios.Open,closed and mixed networks of queues with di .erent classes of customers.Journal of ACM 22 pages 248 260,1975.

Digital Library

[3]

S.Ben Fredj,S.Oueslati-Boulahia,and J.W.Roberts. Measurement-based admission control for elastic tra .c.In Proceedings of ITC17 September 2001.

[4]

A.Berger and Y.Kogan.Dimensioning bandwidth for elastic tra .c in high-speed data networks. IEEE/ACM Trans Networks 8(5):643 654,October 2000.

Digital Library

[5]

D.Bertsekas and R.Gallager.Data Networks . Prentice-Hall International,1992.

Digital Library

[6]

T.Bonald and L.Massouli~.Impact of fairness on internet performance.In Proceedings of ACM SIGMETRICS '01 2001.

Digital Library

[7]

T.Bonald,A.Prouti~re,G.R~gni~,and J.W.Roberts.Insensitivity results in statistical bandwidth sharing.In Proceedings of ITC17 September 2001.

[8]

T.Bu and D.Towsley.Fixed point approximations for TCP behavior in an aqm network.In Proceedings of ACM SIGMETRICS '01 2001.

Digital Library

[9]

J.W.Cohen.The multiple phase service network with generalized processor sharing.In Acta Informatica pages 245 284,1979.

[10]

M.Crovella and A.Bestravos.Self-similarity in world wide web tra .c:Evidence and possible cause.In Proceedings of ACM SIGMETRICS '96 1996.

Digital Library

[11]

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 Proceedings of IEEE INFOCOM '99 1999.

[12]

D.P.Heyman,T.V.Lakshman,and A.L.Neidhardt. New method for analyzing feedback protocols with applications to engineering web tra .c over the internet.In Proceedings of ACM SIGMETRICS '97 1997.

Digital Library

[13]

G.Fayolle,A.de la Fortelle,J-M.Lasgouttes, L.Massouli~,and J.W.Roberts.Best-e .ort networks: modeling and performance analysis via large networks asymptotics.In Proceedings of IEEE INFOCOM '01 2001.

[14]

G.Fayolle,I.Mitrani,and R.Iasnogorodski.Sharing a processor among many classes.Journal of the ACM 27:519 -532,1980.

Digital Library

[15]

A.Feldman.Characteristics of TCP connection arrivals.K.Park,W.Willinger,editors,Self-similar network tra .c and performance evaluation J.Wiley &Sons,2000.

[16]

A.Feldman,A.Gilbert,P.Huang,and W.Willinger. Data networks as cascades:Explaining the multifractal nature of internet WAN tra .c.In Proceedings of ACM SIGCOMM '98 1998.

Digital Library

[17]

A.Feldman,A.Gilbert,P.Huang,and W.Willinger. Dynamics of IP tra .c:A study of the role of variability and the impact of control.In Proceedings of ACM SIGCOMM '99 1999.

Digital Library

[18]

A.Jean-Marie and P.Robert.On the transient behavior of the processor sharing queue.Queueing Systems Theory and Applications 17:129 -136,1994.

[19]

F.P.Kelly.Reversibility and Stochastic Networks .J. Wiley &Sons,1979.

[20]

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.

[21]

A.A.Kherani and A.Kumar.Performance analysis of TCP with nonpersistent sessions.Preprint available at http://ece.iisc.ernet.in/anurag/Anurag Kumar.html, 2000.

[22]

L.Kleinrock.Queueing Systems,Volume 2 .J.Wiley &Sons,1975.

[23]

L.Massouli~ and J.W.Roberts.Arguments in favor of admission control for TCP .ows.In P.Key and D.Smith,editors,Teletra .c Engineering in a Competitive Worl,Proceedings of ITC 16,pages 33 -44.Elsevier,1999.

[24]

L.Massouli~ and J.W.Roberts.Bandwidth sharing: objectives and algorithms.In Proceedings of IEEE INFOCOM '99 1999.

[25]

L.Massouli~ and J.W.Roberts.Bandwidth sharing and admission control for elastic tra .c. Telecommunication Systems 15:185 -201,2000.

[26]

J.Mo and J.Walrand.Fair end-to-end window-based congestion control.In Proceedings of SPIE '98 International Symposium on Voice,Video and Data Communications 1998.

[27]

C.J.Nuzman,I.Saniee,W.Sweldens,and A.Weiss. A compound model of tcp arrivals.In Proceedings of ITC Seminar on IP Tra .c Modeling Monterey 2000.

[28]

V.Paxson and S.Floyd.Wide-area tra .c:The failure of poisson modeling.IEEE/ACM Trans. Networking 3(3):226 -255,1995.

Digital Library

[29]

J.W.Roberts and S.Oueslati-Boulahia.Quality of service by .ow-aware networking.Phil.Trans.R. Soc.London A 358:2197 -2207,2000.

[30]

M.Vojnovic,J.-Y.Le Boudec,and C.Boutremans. Global fairness of additive-increase and multiplicative-decrease with heterogeneous roundtrip times.In Proceedings of IEEE INFOCOM '00 2000.

Cited By

Boito FPallez GTeylo LVidal N(2023)IO-Sets: Simple and Efficient Approaches for I/O Bandwidth ManagementIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2023.330502834:10(2783-2796)Online publication date: 1-Oct-2023
https://dl.acm.org/doi/10.1109/TPDS.2023.3305028
Gopalam SHanly SWhiting P(2023)Distributed Resource Allocation and Flow Control Algorithms for mmWave IAB NetworksIEEE/ACM Transactions on Networking10.1109/TNET.2023.327334931:6(3175-3190)Online publication date: Dec-2023
https://doi.org/10.1109/TNET.2023.3273349
Tajiri KKawahara R(2023)Data Transfer for Balancing Model Convergence and Training Time in Federated LearningGLOBECOM 2023 - 2023 IEEE Global Communications Conference10.1109/GLOBECOM54140.2023.10437284(6777-6782)Online publication date: 4-Dec-2023
https://doi.org/10.1109/GLOBECOM54140.2023.10437284
Show More Cited By

Index Terms

Statistical bandwidth sharing: a study of congestion at flow level
1. Networks
  1. Network properties
    1. Network structure
  2. Network protocols

Recommendations

Statistical bandwidth sharing: a study of congestion at flow level
SIGCOMM '01: Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications

In this paper we study the statistics of the realized throughput of elastic document transfers, accounting for the way network bandwidth is shared dynamically between the randomly varying number of concurrent flows. We first discuss the way TCP realizes ...
Predicting bottleneck bandwidth sharing by generalized TCP flows

The paper presents a technique for computing the individual throughputs and the average queue occupancy when multiple TCP connections share a single bottleneck buffer. The bottleneck buffer is assumed to perform congestion feedback via randomized packet ...
Fair bandwidth sharing between unicast and multicast flows in best-effort networks

In this paper, we propose a simple scheduler called Service-Based Queuing (SBQ) to share the bandwidth fairly between unicast and multicast flows according to a new definition of fairness referred as the inter-service fairness. We also describe a new ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM SIGCOMM Computer Communication Review

ACM SIGCOMM Computer Communication Review Volume 31, Issue 4

Proceedings of the 2001 SIGCOMM conference

October 2001

275 pages

ISSN:0146-4833

DOI:10.1145/964723

Issue’s Table of Contents

SIGCOMM '01: Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
August 2001
298 pages
ISBN:1581134118
DOI:10.1145/383059
Chairmen:
Rene Cruz
Unvi. of California, San Diego
,
George Varghese
Unvi. of California, San Diego

Copyright © 2001 ACM.

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: 27 August 2001

Published in SIGCOMM-CCR Volume 31, Issue 4

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

285
Total Citations
View Citations
2,025
Total Downloads

Downloads (Last 12 months)119
Downloads (Last 6 weeks)14

Reflects downloads up to 17 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

Boito FPallez GTeylo LVidal N(2023)IO-Sets: Simple and Efficient Approaches for I/O Bandwidth ManagementIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2023.330502834:10(2783-2796)Online publication date: 1-Oct-2023
https://dl.acm.org/doi/10.1109/TPDS.2023.3305028
Gopalam SHanly SWhiting P(2023)Distributed Resource Allocation and Flow Control Algorithms for mmWave IAB NetworksIEEE/ACM Transactions on Networking10.1109/TNET.2023.327334931:6(3175-3190)Online publication date: Dec-2023
https://doi.org/10.1109/TNET.2023.3273349
Tajiri KKawahara R(2023)Data Transfer for Balancing Model Convergence and Training Time in Federated LearningGLOBECOM 2023 - 2023 IEEE Global Communications Conference10.1109/GLOBECOM54140.2023.10437284(6777-6782)Online publication date: 4-Dec-2023
https://doi.org/10.1109/GLOBECOM54140.2023.10437284
Olaifa JArifler D(2023)Dual Connectivity in Heterogeneous Cellular Networks: Analysis of Optimal Splitting of Elastic File Transfers Using Flow-Level Performance ModelsIEEE Access10.1109/ACCESS.2023.334207311(140582-140595)Online publication date: 2023
https://doi.org/10.1109/ACCESS.2023.3342073
Qin DChen KChen JLu N(2022)A Unified Distribution Form of the Density of States in Disordered Organic SemiconductorsIEEE Transactions on Electron Devices10.1109/TED.2022.318706269:8(4507-4513)Online publication date: Aug-2022
https://doi.org/10.1109/TED.2022.3187062
HARADA SISHIBASHI KKAWAHARA R(2020)Modeling Upper Layer Reaction to QoS Degradation as a Congestion Avoidance MechanismIEICE Transactions on Communications10.1587/transcom.2019NRI0001E103.B:4(302-311)Online publication date: 1-Apr-2020
https://doi.org/10.1587/transcom.2019NRI0001
Kamath SSingh SKumar M(2020)Multiclass Queueing Network Modeling and Traffic Flow Analysis for SDN-Enabled Mobile Core Networks With Network SlicingIEEE Access10.1109/ACCESS.2019.29593518(417-430)Online publication date: 2020
https://doi.org/10.1109/ACCESS.2019.2959351
Kharat PKulkarni M(2019)Congestion controlling schemes for high-speed data networksJournal of High Speed Networks10.3233/JHS-19060225:1(41-60)Online publication date: 1-Jan-2019
https://dl.acm.org/doi/10.3233/JHS-190602
ISHIBASHI KHARADA SKAWAHARA R(2019)Inferring Latent Traffic Demand Offered to an Overloaded Link with Modeling QoS-Degradation EffectIEICE Transactions on Communications10.1587/transcom.2018EBP3093E102.B:4(790-798)Online publication date: 1-Apr-2019
https://doi.org/10.1587/transcom.2018EBP3093
Liu HAn LRen JWang B(2019)An Interactive Traffic Replay Method in a Scaled-Down EnvironmentIEEE Access10.1109/ACCESS.2019.29470627(149373-149386)Online publication date: 2019
https://doi.org/10.1109/ACCESS.2019.2947062
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Issue’s Table of Contents