article

Evaluating the number of active flows in a scheduler realizing fair statistical bandwidth sharing

Authors:

L. Muscariello,

J. RobertsAuthors Info & Claims

ACM SIGMETRICS Performance Evaluation Review, Volume 33, Issue 1

Pages 217 - 228

https://doi.org/10.1145/1071690.1064237

Published: 06 June 2005 Publication History

Abstract

Despite its well-known advantages, per-flow fair queueing has not been deployed in the Internet mainly because of the common belief that such scheduling is not scalable. The objective of the present paper is to demonstrate using trace simulations and analytical evaluations that this belief is misguided. We show that although the number of flows in progress increases with link speed, the number that needs scheduling at any moment is largely independent of this rate. The number of such active flows is a random process typically measured in hundreds even though there may be tens of thousands of flows in progress. The simulations are performed using traces from commercial and research networks with quite different traffic characteristics. Analysis is based on models for balanced fair statistical bandwidth sharing and applies properties of queue busy periods to explain the observed behaviour.

References

[1]

D. Bertsekas and R. Gallager, Data Networks, Prentice Hall, Englwood Cliffs, N.J., 1992.]]

Digital Library

[2]

E. L. Hahne, Round-Robin Scheduling for Max-Min Fairness in Data Networks, IEEE Journal on Selected Areas in Communications, Vol. 9, No. 7, Sep. 1991, Pages: 1024--1039.]]

Digital Library

[3]

B. Suter, T.V. Lakshman, D. Stiliadis, A.K. Choudhury; Buffer Management Schemes for Supporting TCP in Gigabit Routers with Per-Flow Queueing, IEEE Journal on Selected Areas in Communications, Aug. 1999.]]

Digital Library

[4]

F. P. Kelly, A.K. Maulloo and D.K.H. Tan, Rate Control in Communication Networks: Shadow Prices, Proportional Fairness and Stability, Journal of the Operational Research Society 49 (1998), Pages: 237--252.]]

[5]

T. Bonald, L. Massoulié, Impact of Fairness on Internet Performance, In Proc. of ACM SIGMETRICS IFIP Performance, 2001.]]

Digital Library

[6]

J. Nagle, On Packet Switches with Infinite Storage, RFC 970, IETF, 1985.]]

Digital Library

[7]

P. Goyal, H. Vin, H. Cheng. Start-time Fair Queueing: A Scheduling Algorithm for Integrated Services Packet Switching Networks, IEEE/ACM Transactions on Networking, Vol. 5, No. 5, Oct 1997, Pages: 690--704.]]

Digital Library

[8]

M. Shreedhar, G. Varghese, Efficient Fair Queueing Using Deficit Round Robin, IEEE/ACM Transactions on Networking, Vol. 4, No. 3, June 1996.]]

Digital Library

[9]

D. Lin, R. Morris, Dynamics of Random Early Detection, In Proc. of ACM SIGCOMM 1997.]]

Digital Library

[10]

R. Mahajan, S. Floyd, D. Weatherall, Controling High-Bandwidth Flows at the Congested Router, In Proc. of IEEE ICNP 2001.]]

Digital Library

[11]

R. Pan, L. Breslau, B. Prabhakar and S. Shenker, A Flow Table-Based Design to Approximate Fairness, In Proc. of Hot Interconnects, Palo Alto, California, Aug. 2002.]]

Digital Library

[12]

N. Brownlee, KC Claffy, Understanding Internet Traffic Streams: Dragonflies and Tortoises, IEEE Communications Magazine, Vol. 40, No. 10, Oct. 2002, Pages: 110--117.]]

Digital Library

[13]

S. Sarvotham, R. Riedi, R. Baraniuk, Connection-Level Analysis and Modeling of Network Traffic, In Proc. of ACM Internet Measurement Workshop 2001.]]

Digital Library

[14]

Y. Zhang, L. Breslau, V. Paxson, S. Shenker, On the Characteristics and Origins of Internet Flow Rates, In Proc. of ACM SIGCOMM 2002.]]

Digital Library

[15]

A. Kortebi, S. Oueslati, J. Roberts, Cross-protect: Implicit Service Differentiation and Admission Control, In Proc. of IEEE HPSR 2004.]]

[16]

A. Kortebi, L. Muscariello, S. Oueslati, J. Roberts, On the Scalability of Fair Queueing, In Proc. of ACM HotNets III 2004.]]

[17]

S. Floyd, V. Paxson. Difficulties in Simulating the Internet, IEEE/ACM Transactions on Networking, Vol. 9, No. 4, Aug. 2001, Pages: 392--403.]]

Digital Library

[18]

C. Fraleigh, S. Moon, B. Lyles, C. Cotton, M. Khan, D. Moll, R. Rockell, T. Seely, C. Diot, Packet-Level Traffic Measurements from the Sprint IP Backbone, IEEE Network, Vol. 17, No. 6, Nov.-Dec. 2003, Pages: 6--16.]]

Digital Library

[19]

L. Takôcs, Introduction to the Theory of Queues, Oxford University Press, 1962, New York.]]

[20]

S. Niu, R. Cooper, Duality and Other Results for M/G/1 and GI/M/1 Queues, via a New Ballot Theorem. Mathematics of Operations Research, Vol. 14, No. 2, 1989, Pages: 281--293.]]

Digital Library

[21]

T. Bonald, A. Proutière, Insensitivity in Processor Sharing Networks, In Proc. of IFIP Performance 2002.]]

[22]

T. Bonald, J. Virtamo, A recursive formula for multirate systems with elastic traffic, To appear in IEEE Communications Letters.]]

[23]

I. Stoica, S. Shenker, H. Zhang, Core-Stateless Fair Queueing: A scalable Architecture to Approximate Fair Bandwidth Allocations in High-Speed Networks.IEEE/ACM Transactions on Networking, Vol. 11, No. 1, Feb. 2003, Pages: 33--46.]]

Digital Library

[24]

G. Appenzeller, I. Keslassy, N. McKeown, Sizing router buffers, In Proc. of ACM Sigcomm, 2004.]]

Digital Library

[25]

A. Dhamdhere, H. Jiang, C. Dovrolis, Buffer sizing for congested Internet links, In Proc. of IEEE Infocom 2005.]]

[26]

S. Floyd, HighSpeed TCP for Large Congestion Windows, IETF RFC 3649, December 2003.]]

Digital Library

[27]

T. Kelly, Scalable TCP: Improving Performance in Highspeed Wide Area Networks. Computer Communication Review 32(2), April 2003.]]

Digital Library

[28]

C. Jin, D. X. Wei, S. H. Low, FAST TCP: Motivation, Architecture, Algorithms, Performance, In Proc. of IEEE Infocom 2004.]]

Cited By

Wu WLi ZZhang TFeng XZhang LQi XRen F(2024)Dynamic Per-Flow Queues for TSN Switches2024 Design, Automation & Test in Europe Conference & Exhibition (DATE)10.23919/DATE58400.2024.10546696(1-2)Online publication date: 25-Mar-2024
https://doi.org/10.23919/DATE58400.2024.10546696
Shan DJiang LZhang PJiang WLi HTang YRen F(2024)Enforcing Fairness in the Traffic Policer Among Heterogeneous Congestion Control AlgorithmsIEEE/ACM Transactions on Networking10.1109/TNET.2023.327641032:1(34-49)Online publication date: Feb-2024
https://doi.org/10.1109/TNET.2023.3276410
Guan ZLi WHe XZhang SLi K(2023)dBFC: Destination-based Backpressure Flow Control for Incast2023 IEEE 29th International Conference on Parallel and Distributed Systems (ICPADS)10.1109/ICPADS60453.2023.00255(1853-1860)Online publication date: 17-Dec-2023
https://doi.org/10.1109/ICPADS60453.2023.00255
Show More Cited By

Index Terms

Evaluating the number of active flows in a scheduler realizing fair statistical bandwidth sharing
1. Networks
  1. Network types
    1. Packet-switching networks

Recommendations

Evaluating the number of active flows in a scheduler realizing fair statistical bandwidth sharing
SIGMETRICS '05: Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems

Despite its well-known advantages, per-flow fair queueing has not been deployed in the Internet mainly because of the common belief that such scheduling is not scalable. The objective of the present paper is to demonstrate using trace simulations and ...
Minimizing the overhead in implementing flow-aware networking
ANCS '05: Proceedings of the 2005 ACM symposium on Architecture for networking and communications systems

An enhanced flow-aware Internet is arguably a more effective means of ensuring adequate performance than implementing the complex standardized QoS architectures. This flow-aware network would provide flow-level performance guarantees for real time and ...
A Bandwidth-Efficient Scheduler for MPLS DiffServ Networks
MASCOTS '04: Proceedings of the The IEEE Computer Society's 12th Annual International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems

DiffServ networks support three forwarding classes: EF, AF and BE. Scheduling algorithms based on priority queueing such as Cisco LLQ and MDRR seem to be a natural choice to provide EF service. The main problem with priority queueing is that, due to ...

Comments

Information & Contributors

Information

Published In

cover image ACM SIGMETRICS Performance Evaluation Review

ACM SIGMETRICS Performance Evaluation Review Volume 33, Issue 1

Performance evaluation review

June 2005

417 pages

ISSN:0163-5999

DOI:10.1145/1071690

Issue’s Table of Contents

SIGMETRICS '05: Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
June 2005
428 pages
ISBN:1595930221
DOI:10.1145/1064212
General Chairs:
Derek Eager
University of Saskatchewan, Canada
,
Carey Williamson
University of Calgary, Canada
,
Program Chairs:
Sem Borst
Bell Labs, USA & CWI, The Netherlands
,
John C. S. Lui
Chinese University of Hong Kong, China

Copyright © 2005 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: 06 June 2005

Published in SIGMETRICS Volume 33, Issue 1

Check for updates

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

76
Total Citations
View Citations
573
Total Downloads

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

Reflects downloads up to 25 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Wu WLi ZZhang TFeng XZhang LQi XRen F(2024)Dynamic Per-Flow Queues for TSN Switches2024 Design, Automation & Test in Europe Conference & Exhibition (DATE)10.23919/DATE58400.2024.10546696(1-2)Online publication date: 25-Mar-2024
https://doi.org/10.23919/DATE58400.2024.10546696
Shan DJiang LZhang PJiang WLi HTang YRen F(2024)Enforcing Fairness in the Traffic Policer Among Heterogeneous Congestion Control AlgorithmsIEEE/ACM Transactions on Networking10.1109/TNET.2023.327641032:1(34-49)Online publication date: Feb-2024
https://doi.org/10.1109/TNET.2023.3276410
Guan ZLi WHe XZhang SLi K(2023)dBFC: Destination-based Backpressure Flow Control for Incast2023 IEEE 29th International Conference on Parallel and Distributed Systems (ICPADS)10.1109/ICPADS60453.2023.00255(1853-1860)Online publication date: 17-Dec-2023
https://doi.org/10.1109/ICPADS60453.2023.00255
Bai HLi HQue JZhang MChong P(2022)DSCCP: A Differentiated Service-based Congestion Control Protocol for Information-Centric Networking2022 IEEE Wireless Communications and Networking Conference (WCNC)10.1109/WCNC51071.2022.9771825(1641-1646)Online publication date: 10-Apr-2022
https://dl.acm.org/doi/10.1109/WCNC51071.2022.9771825
Hoiland-Jorgensen T(2018)Analyzing the Latency of Sparse Flows in the FQ-CoDel Queue Management AlgorithmIEEE Communications Letters10.1109/LCOMM.2018.287145722:11(2266-2269)Online publication date: Nov-2018
https://doi.org/10.1109/LCOMM.2018.2871457
Gong YRoberts JRossi D(2018)Per-Flow Fairness in the Datacenter Network2018 IEEE 19th International Conference on High Performance Switching and Routing (HPSR)10.1109/HPSR.2018.8850759(1-6)Online publication date: Jun-2018
https://doi.org/10.1109/HPSR.2018.8850759
Huang ZZhu T(2017)Distributed Real-Time Multimodal Data Forwarding in Unmanned Aerial Systems2017 14th Annual IEEE International Conference on Sensing, Communication, and Networking (SECON)10.1109/SAHCN.2017.7964920(1-9)Online publication date: Jun-2017
https://doi.org/10.1109/SAHCN.2017.7964920
Chen QXie RYu FLiu JHuang TLiu Y(2016)Transport Control Strategies in Named Data Networking: A SurveyIEEE Communications Surveys & Tutorials10.1109/COMST.2016.252816418:3(2052-2083)Online publication date: 1-Jul-2016
https://dl.acm.org/doi/10.1109/COMST.2016.2528164
Checconi FRizzo LValente P(2013)QFQIEEE/ACM Transactions on Networking10.1109/TNET.2012.221588121:3(802-816)Online publication date: 1-Jun-2013
https://dl.acm.org/doi/10.1109/TNET.2012.2215881
Carofiglio GGallo MMuscariello L(2013)On the performance of bandwidth and storage sharing in information-centric networksComputer Networks: The International Journal of Computer and Telecommunications Networking10.1016/j.comnet.2013.08.01857:17(3743-3758)Online publication date: 1-Dec-2013
https://dl.acm.org/doi/10.1016/j.comnet.2013.08.018
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.

Figures

Tables

Media

View Issue’s Table of Contents