Implementing scheduling algorithms in high-speed networks
Authors:
- D.C. StephensDSD.C. Stephens
- J.C.R. BennettJBJ.C.R. Bennett
- Hui ZhangHZHui Zhang
- 1 June 1999
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal on Selected Areas in Communications
- Vol. 17 (6) , 1145-1158
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- A hierarchical fair service curve algorithm for link-sharing, real-time, and priority servicesIEEE/ACM Transactions on Networking, 2000
- Leap forward virtual clock1997
- Start-time fair queueing: a scheduling algorithm for integrated services packet switching networksIEEE/ACM Transactions on Networking, 1997
- Hierarchical packet fair queueing algorithmsACM SIGCOMM Computer Communication Review, 1996
- Efficient fair queuing using deficit round-robinIEEE/ACM Transactions on Networking, 1996
- Making greed work in networks: a game-theoretic analysis of switch service disciplinesIEEE/ACM Transactions on Networking, 1995
- Rate-Controlled Service DisciplinesJournal of High Speed Networks, 1994
- A generalized processor sharing approach to flow control in integrated services networks: the single-node caseIEEE/ACM Transactions on Networking, 1993
- Architecture design for regulating and scheduling user's traffic in ATM networks1992
- A control-theoretic approach to flow control1991