Start-time fair queueing: a scheduling algorithm for integrated services packet switching networks
- 1 January 1997
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Networking
- Vol. 5 (5), 690-704
- https://doi.org/10.1109/90.649569
Abstract
No abstract availableThis publication has 17 references indexed in Scilit:
- Network algorithms and protocol for multimedia serversPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Generalized guaranteed rate scheduling algorithms: a frameworkIEEE/ACM Transactions on Networking, 1997
- Start-time fair queueing: a scheduling algorithm for integrated services packet switching networksIEEE/ACM Transactions on Networking, 1997
- Efficient fair queuing using deficit round-robinIEEE/ACM Transactions on Networking, 1996
- Link-sharing and resource management models for packet networksIEEE/ACM Transactions on Networking, 1995
- How fair is fair queuingJournal of the ACM, 1992
- A control-theoretic approach to flow controlPublished by Association for Computing Machinery (ACM) ,1991
- A simulation study of fair queueing and policy enforcementACM SIGCOMM Computer Communication Review, 1990
- A scheme for real-time channel establishment in wide-area networksIEEE Journal on Selected Areas in Communications, 1990
- Analysis and simulation of a fair queueing algorithmPublished by Association for Computing Machinery (ACM) ,1989