D. Ferrari and D. C. Verma, "A scheme for real-time channel establishment in wide-area networks" IEEE J. Select. Areas Commun, vol. 8, no. 3, pp. 368--379, Apr. 1990.

Google Scholar

[6]

S. Floyd and V. Jacobson, "Link-sharing and resource management models for packet networ'ks;" IEEFJACM Trans. Nem'orking, vol. 3, pp. 365-386, Aug. 1995.

Crossref

Google Scholar

[7]

L. Georgiadis, R. Guedn, V. Peals, and K. N. Sivamjan, "Efficient network QoS provisioning based on per node traffic shaping," in Proc. INFOCOM'96, Mar. 1996, pp. 102-110.

Crossref

Google Scholar

[8]

S. J. Golestani, "A self-clocked fair queueing scheme for high speed '-applications," in Proc. INFOCOM'94, Apr. 1994, pp. 636--646.

Google Scholar

[9]

P. Goyal, X. Guo, and H. M. Vin, "A hierarchical CPU scheduler for multimedia operating systems," in Proc. Operating SysL Design Implement. (OSDI'96), Seattle, Oct. 1996, pp. 107-122.

Crossref

Google Scholar

[10]

P. Goyal and H. M. Vin, "'Generalized guaranteed rate scheduling algorithms: A framework," in IEEE/ACM Trans. bleat, orking, to appear, Also available as Tech. Rep. TR95-30, Dept. Comput. Sci., Univ. Texas at Austin.

Crossref

Google Scholar

[11]

~, "Network algorithms and protocol for multimedia servers," in Proc. INFOCOM'96, Mar. 1996, pp. 1371-1379.

Crossref

Google Scholar

[12]

P. Goyal, H. M. Vin, and H. Cheng, "Start-time fair queuing: A scheduling algorithm for integrated services packet switching networks;' Tech. Rep. TR~96-02, Dept. Comput. Sci., Univ. Texas at Austin, Jan. 1996. Available via URL http'.liwww.cs.utexas.edulusersldmcl.

Crossref

Google Scholar

[13]

, "Start-time fair queuing: A scheduling algorithm for integrated services packet switching networks" in Proe. ACM SIGCOMM'96, Aug. 1996, pp. 157-168.

Crossref

Google Scholar

[14]

A. Greenberg and N. Madras, "'How fair is fair queuing," J. ACM, vol. 39, no. 3, pp. 568--598, July 1992.

Crossref

Google Scholar

[15]

S. Keshav, "A control-theoretic approach to flow control," in Proc. ACM SIGCOMM'91, 1991, pp. 3-15.

Crossref

Google Scholar

[16]

K. Lee, "Performance bounds in communication networks with variablerate finks," in Proc. ACM SIGCOMM'95, 1995, pp. 126-136.

Crossref

Google Scholar

[17]

A. IC Parekh, "A generalized processor sharing approach to flow control in integrated services networks," Ph.D. thesis, Dept. Flee. Eng. Comput. Sci., MIT, 1992.

Google Scholar

[18]

S. Shenker, L Zhang, and D. Clark, "A scheduling service model and a scheduling architectur~ for an integrated services packet networks," available via anonymous ftp from ftp:llftp.parc.xerox.comlpublarchfin.ps, 1995.

Google Scholar

[19]

M. Shreedhar and G. Varghese, "Efficient fair queuing using deficit round robin," in Pro~ ACM SIGCOMM'95, 1995, pp. 231-242.

Crossref

Google Scholar

[20]

D. Sfiliadis, '~l'raffic scheduling in packet-switched networks: Analysis, design and implementation;' Ph,D. thesis, Dept. Comput. Sci. Eng., Univ. Calif., Santa Cruz, 1996.

Crossref

Google Scholar

[21]

L Zhang, "VirtualClock: A new traffic control algorithm for packet switching networks;' in Proc. A CM SIGCOMM'90, Aug. 1990, pp. 19-29.

Crossref

Google Scholar

[22]

Q. Zheng and IC Shin, "On the ability of establishing real-time channels in point-to-point packet-switching networks,'" IEEE, Trans. Cmmmm., vol. 42, pp. 1096-1105, Mar. 1994.

Google Scholar

Cited By

View all

Liang QHanafy WBashir NIrwin DShenoy PSha KBanerjee SChen J(2023)Energy Time Fairness: Balancing Fair Allocation of Energy and Time for GPU WorkloadsProceedings of the Eighth ACM/IEEE Symposium on Edge Computing10.1145/3583740.3628435(53-66)Online publication date: 6-Dec-2023
https://dl.acm.org/doi/10.1145/3583740.3628435
Roberts JRossi D(2022)Size-based scheduling vs fairness for datacenter flowsACM SIGMETRICS Performance Evaluation Review10.1145/3561074.356107650:2(2-10)Online publication date: 30-Aug-2022
https://dl.acm.org/doi/10.1145/3561074.3561076
Sun DChai YLiu CSun WZhang QOshana R(2022)R2BProceedings of the 59th ACM/IEEE Design Automation Conference10.1145/3489517.3530521(883-888)Online publication date: 10-Jul-2022
https://dl.acm.org/doi/10.1145/3489517.3530521
Show More Cited By

Index Terms

Start-time fair queueing: a scheduling algorithm for integrated services packet switching networks

Recommendations

Start-time fair queueing: a scheduling algorithm for integrated services packet switching networks
SIGCOMM '96: Conference proceedings on Applications, technologies, architectures, and protocols for computer communications

We present Start-time Fair Queuing (SFQ) algorithm that is computationally efficient, achieves fairness regardless of variation in a server capacity, and has the smallest fairness measure among all known fair scheduling algorithms. We analyze its ...
Weighted start-time fair queuing: a new start-time fair queuing for elastic traffic
SpringSim '09: Proceedings of the 2009 Spring Simulation Multiconference

In this paper, we present a new Start-time Fair Queuing (SFQ) algorithm called Weighted Start-time Fair Queuing (WSFQ) which is more efficient and achieves better fairness than SFQ in the presence of small and huge elastic traffic flows. WSFQ scheduler, ...
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 IEEE/ACM Transactions on Networking

IEEE/ACM Transactions on Networking Volume 5, Issue 5

Oct. 1997

138 pages

ISSN:1063-6692

Editor:
Simon S. Lam
Univ. Texas, Austin

Issue’s Table of Contents

Publisher

IEEE Press

Publication History

Published: 01 October 1997

Published in TON Volume 5, Issue 5

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

108
Total Citations
View Citations
985
Total Downloads

Downloads (Last 12 months)50
Downloads (Last 6 weeks)8

Reflects downloads up to 03 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Liang QHanafy WBashir NIrwin DShenoy PSha KBanerjee SChen J(2023)Energy Time Fairness: Balancing Fair Allocation of Energy and Time for GPU WorkloadsProceedings of the Eighth ACM/IEEE Symposium on Edge Computing10.1145/3583740.3628435(53-66)Online publication date: 6-Dec-2023
https://dl.acm.org/doi/10.1145/3583740.3628435
Roberts JRossi D(2022)Size-based scheduling vs fairness for datacenter flowsACM SIGMETRICS Performance Evaluation Review10.1145/3561074.356107650:2(2-10)Online publication date: 30-Aug-2022
https://dl.acm.org/doi/10.1145/3561074.3561076
Sun DChai YLiu CSun WZhang QOshana R(2022)R2BProceedings of the 59th ACM/IEEE Design Automation Conference10.1145/3489517.3530521(883-888)Online publication date: 10-Jul-2022
https://dl.acm.org/doi/10.1145/3489517.3530521
Wen YZhou YWu FLi SWang ZXie C(2022)WA-OPShare: Workload-Adaptive Over-Provisioning Space Allocation for Multi-Tenant SSDsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems10.1109/TCAD.2022.319996641:11(4527-4538)Online publication date: 1-Nov-2022
https://dl.acm.org/doi/10.1109/TCAD.2022.3199966
Liu YFeng DChen JGuo C(2022)D-IOCost: Dynamic Cost-Aware Fair Queueing for Better I/O Proportionality and PerformanceAlgorithms and Architectures for Parallel Processing10.1007/978-3-031-22677-9_20(373-391)Online publication date: 10-Oct-2022
https://dl.acm.org/doi/10.1007/978-3-031-22677-9_20
Beams AKannan SAngel SKim YKim JVigna GShi E(2021)Packet Scheduling with Optional Client PrivacyProceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security10.1145/3460120.3485371(3415-3430)Online publication date: 12-Nov-2021
https://dl.acm.org/doi/10.1145/3460120.3485371
Yu ZHu CWu JSun XBraverman VChowdhury MLiu ZJin XKuipers FCaesar M(2021)Programmable packet scheduling with a single queueProceedings of the 2021 ACM SIGCOMM 2021 Conference10.1145/3452296.3472887(179-193)Online publication date: 9-Aug-2021
https://dl.acm.org/doi/10.1145/3452296.3472887
Hedayati MShen KScott MMarty MDan TDahlia M(2019)Multi-queue fair queueingProceedings of the 2019 USENIX Conference on Usenix Annual Technical Conference10.5555/3358807.3358834(301-314)Online publication date: 10-Jul-2019
https://dl.acm.org/doi/10.5555/3358807.3358834
Kanellopoulos D(2019)Recent Progress on QoS Scheduling for Mobile Ad Hoc NetworksJournal of Organizational and End User Computing10.4018/JOEUC.201907010331:3(37-66)Online publication date: 1-Jul-2019
https://dl.acm.org/doi/10.4018/JOEUC.2019070103
(2018)Congestion control and fairness with dynamic priority for ad hoc networksInternational Journal of Ad Hoc and Ubiquitous Computing10.5555/3292681.329268529:3(208-220)Online publication date: 1-Jan-2018
https://dl.acm.org/doi/10.5555/3292681.3292685
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

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

References

Cited By

Index Terms

Recommendations

Start-time fair queueing: a scheduling algorithm for integrated services packet switching networks

Weighted start-time fair queuing: a new start-time fair queuing for elastic traffic

Credit-based fair queueing (CBFQ): a simple service-scheduling algorithm for packet-switched networks

Comments

Information

Published In

Publisher

Publication History

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations