article

Free access

Design and analysis of frame-based fair queueing: a new traffic scheduling algorithm for packet-switched networks

Authors:

Dimitrios Stiliadis,

Anujan VarmaAuthors Info & Claims

ACM SIGMETRICS Performance Evaluation Review, Volume 24, Issue 1

Pages 104 - 115

https://doi.org/10.1145/233008.233030

Published: 15 May 1996 Publication History

Abstract

In this paper we introduce and analyze frame-based fair queueing, a novel traffic scheduling algorithm for packet-switched networks. The algorithm provides end-to-end delay bounds identical to those of PGPS (packet-level generalized processor sharing), without the complexity of simulating the fluid-model system in the background as required in PGPS. The algorithm is therefore ideally suited for implementation in packet switches supporting a large number of sessions. We present a simple implementation of the algorithm for a general packet switch. In addition, we prove that the algorithm is fair in the sense that sessions are not penalized for excess bandwidth they received while other sessions were idle. Frame-based fair queueing belongs to a general class of scheduling algorithms, which we call Rate-Proportional Servers. This class of algorithms provides the same end-to-end delay and burstiness bounds as PGPS, but allows more flexibility in the design and implementation of the algorithm. We provide a systematic analysis of this class of schedulers and obtain bounds on their fairness.

References

[1]

A.K. Parekh and R. G. Gallager, "A generalized processor sharing approach to flow control - the single node case," in Proc. of INFOCOM '92, vol. 2, pp. 915-924, May 1992.

Digital Library

[2]

A. Demers, S. Keshav, and S. Shenker, "Analysis and simulation of a fair queueing algorithm," lnternetworking: Research and Experience, vol. 1, no. 1, pp. 3-26, 1990.

[3]

L. Zhang, "VirtualCIock: a new traffic control algorithm for packet switching networks," A CM Transactions on Computer Systems, voI. 9, pp. 101-124, May 1991.

Digital Library

[4]

S. Golestani, "A self-clocked fair queueing scheme for broadband applications," in Proc. of INFOCOM '9~, pp. 636-646, IEEE, April 1994.

[5]

D. Ferrari and D. Verma, "A scheme for real-time channel establishment in wide-area networks," IEEE Journal on Selected Areas in Communications, vol. 8, pp. 368-37'9, April 1990.

Digital Library

[6]

M. Katevenis, S. Sidiropoulos, and C. Courcoubetis, "Weighted round-robin cell multiplexing in a general-purpose ATM switch chip," IEEE Journal on Selected Areas in Communications, vol. 9, pp. 1265-79, October 1991.

Digital Library

[7]

M. Shreedhar and G. Varghese, "Efficient Fair Queueing using Deficit Round Robin," in Proc. SIGCOMM'95, pp.231-242, September 1995.

Digital Library

[8]

H. Zhang and S. Keshav, "Comparison of rate based service disciplines," in Proc. of ACM SIGCOMM '91, pp. 113-122, 1991.

Digital Library

[9]

C. Kalmanek, H. Kanakia, and S. Keshav, "Rate controlled servers for very high-speed networks," in IEEE Global Telecommunications Conference, pp. 300.3.1-300.3.9, December 1990.

[10]

S. Golestani, "A framing strategy for congestion management," IEEE Journal on Selected Areas zn Communications, vol. 9, pp. 1064-1077, September 1991.

Digital Library

[11]

D. Stiliadis and A. Varma, "Latency-rate servers: A general model for analysis of traffic scheduling algorithms," in Proc. of IEEE INFOCOM '96, March 1996, also (http://www.cse.ucsc.edu/research/hsnlab/publications/).

Digital Library

[12]

S. Golestani, "Network delay analysis of a class of fair queueing algorithms," IEEE Journal on Selected Areas in Communications, vol. 13, pp. 1057-70, August 1995.

Digital Library

[13]

J. Turner, "New directions in communications (or which way to the information age?)," IEEE Communscations Magazine, vol. 24, pp. 8-15, October 1986.

Digital Library

[14]

D. Stiliadis and A. Varma, "Frame-based fair queueing:a new traffic scheduling algorithm for packet-switched networks," Tech. Rep. UCSC-CRL-95-39, U.C. Santa Cruz, http: //www. cse.u csc. ed u/research/hs nlab/pu blications/.

Digital Library

[15]

J. Rexford, A. Greenberg, and F. Bonomi, "A falr leaky-bucket shaper for ATM networks." AT&T unpublished report.

[16]

J.L. Rexford, A. Greenberg, and F. Bonomi, "Hardware efficient fair queueing architectures for high-speed networks," in Proc. of IEEE INFOCOM 96, March 1996.

Digital Library

[17]

O. Yaron and M. Sidi, "Performance and stability of communication networks via robust exponential bounds," IEEE/ACM Transactlons on Networkzng, vol. 1, pp. 372-385~ June 1993.

Digital Library

[18]

D. Stiliadis and A. Varma, "FAST: an FPGA-based 81mulatlon testbed for ATM Networks," in Proc. ICC '96, June 1996.

Digital Library

Cited By

Domingues AFilho SDe M. Amory AMoraes F(2022)Design-Time Analysis of Real-Time Traffic for Networks-on-Chip using Constraint Models2022 35th SBC/SBMicro/IEEE/ACM Symposium on Integrated Circuits and Systems Design (SBCCI)10.1109/SBCCI55532.2022.9893222(1-6)Online publication date: 22-Aug-2022
https://doi.org/10.1109/SBCCI55532.2022.9893222
Argibay-Losada PNozhnina KSuárez-González AFernández-Veiga MLópez-García C(2014)Quantitative end-to-end throughput differentiation for bulk TCP applications in the InternetComputer Communications10.1016/j.comcom.2014.01.00642(47-59)Online publication date: 1-Apr-2014
https://dl.acm.org/doi/10.1016/j.comcom.2014.01.006
Nisar KAmphawan AHassan SSarkar N(2013)ReviewJournal of Network and Computer Applications10.1016/j.jnca.2012.07.01936:2(933-948)Online publication date: 1-Mar-2013
https://dl.acm.org/doi/10.1016/j.jnca.2012.07.019
Show More Cited By

Index Terms

Recommendations

Design and analysis of frame-based fair queueing: a new traffic scheduling algorithm for packet-switched networks
SIGMETRICS '96: Proceedings of the 1996 ACM SIGMETRICS international conference on Measurement and modeling of computer systems

In this paper we introduce and analyze frame-based fair queueing, a novel traffic scheduling algorithm for packet-switched networks. The algorithm provides end-to-end delay bounds identical to those of PGPS (packet-level generalized processor sharing), ...
FRAME-BASED FAIR QUEUEING: A NEW TRAFFIC SCHEDULING ALGORITHM FOR PACKET-SWITCHED NETWORKS
Credit-based fair queueing (CBFQ): a simple service-scheduling algorithm for packet-switched networks

This paper proposes a simple rate-based scheduling algorithm for packet-switched networks. Using a set of counters to keep track of the credits accumulated by each traffic flow, the bandwidth share allocated to each flow, and the size of the head-of-...

Comments

Information & Contributors

Information

Published In

cover image ACM SIGMETRICS Performance Evaluation Review

ACM SIGMETRICS Performance Evaluation Review Volume 24, Issue 1

May 1996

273 pages

ISSN:0163-5999

DOI:10.1145/233008

Editors:
Blaine E. Gaither
Hewlett-Packard, Fort Collins, CO
,
Daniel A. Reed
Univ. of Illinois, Urbana

Issue’s Table of Contents

SIGMETRICS '96: Proceedings of the 1996 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
May 1996
279 pages
ISBN:0897917936
DOI:10.1145/233013
Chairman:
Daniel A. Reed
Univ. of Illinois, Urbana
,
Editor:
Blaine D. Gaither
Hewlett-Packard, Fort Collins, CO

Copyright © 1996 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: 15 May 1996

Published in SIGMETRICS Volume 24, Issue 1

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

74
Total Citations
View Citations
827
Total Downloads

Downloads (Last 12 months)74
Downloads (Last 6 weeks)20

Reflects downloads up to 10 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Domingues AFilho SDe M. Amory AMoraes F(2022)Design-Time Analysis of Real-Time Traffic for Networks-on-Chip using Constraint Models2022 35th SBC/SBMicro/IEEE/ACM Symposium on Integrated Circuits and Systems Design (SBCCI)10.1109/SBCCI55532.2022.9893222(1-6)Online publication date: 22-Aug-2022
https://doi.org/10.1109/SBCCI55532.2022.9893222
Argibay-Losada PNozhnina KSuárez-González AFernández-Veiga MLópez-García C(2014)Quantitative end-to-end throughput differentiation for bulk TCP applications in the InternetComputer Communications10.1016/j.comcom.2014.01.00642(47-59)Online publication date: 1-Apr-2014
https://dl.acm.org/doi/10.1016/j.comcom.2014.01.006
Nisar KAmphawan AHassan SSarkar N(2013)ReviewJournal of Network and Computer Applications10.1016/j.jnca.2012.07.01936:2(933-948)Online publication date: 1-Mar-2013
https://dl.acm.org/doi/10.1016/j.jnca.2012.07.019
Chang STing WChuang CWang S(2012)Block-based fair queuing: An efficient network QoS provisioning algorithm for high-speed data transmission2012 IEEE International Workshop Technical Committee on Communications Quality and Reliability (CQR)10.1109/CQR.2012.6267098(1-6)Online publication date: May-2012
https://doi.org/10.1109/CQR.2012.6267098
MartíNez RClaver JAlfaro FSáNchez J(2012)Hardware implementation study of several new egress link scheduling algorithmsJournal of Parallel and Distributed Computing10.1016/j.jpdc.2012.04.01072:8(975-989)Online publication date: 1-Aug-2012
https://dl.acm.org/doi/10.1016/j.jpdc.2012.04.010
Dong Jin Nicol DGuanhua Yan (2011)An event buffer flooding attack in DNP3 controlled SCADA systemsProceedings of the 2011 Winter Simulation Conference (WSC)10.1109/WSC.2011.6147969(2614-2626)Online publication date: Dec-2011
https://doi.org/10.1109/WSC.2011.6147969
Jin DNicol DYücesan E(2010)Fast simulation of background traffic through fair queueing networksProceedings of the Winter Simulation Conference10.5555/2433508.2433873(2935-2946)Online publication date: 5-Dec-2010
https://dl.acm.org/doi/10.5555/2433508.2433873
Jin DNicol D(2010)Fast simulation of background traffic through Fair Queueing networksProceedings of the 2010 Winter Simulation Conference10.1109/WSC.2010.5678988(2935-2946)Online publication date: Dec-2010
https://doi.org/10.1109/WSC.2010.5678988
Dong Jin Nicol DCaesar M(2010)Efficient Gigabit Ethernet Switch Models for Large-Scale SimulationProceedings of the 2010 IEEE Workshop on Principles of Advanced and Distributed Simulation10.1109/PADS.2010.5471659(122-131)Online publication date: 17-May-2010
https://dl.acm.org/doi/10.1109/PADS.2010.5471659
Lee MKim JAbts DMarty MLee J(2010)Probabilistic Distance-Based ArbitrationProceedings of the 2010 43rd Annual IEEE/ACM International Symposium on Microarchitecture10.1109/MICRO.2010.18(509-519)Online publication date: 4-Dec-2010
https://dl.acm.org/doi/10.1109/MICRO.2010.18
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

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

Media

Figures

Other

Tables

View Issue’s Table of Contents