Implementing scheduling algorithms in high-speed networks
- 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
- https://doi.org/10.1109/49.772449
Abstract
No abstract availableThis publication has 14 references indexed in Scilit:
- A self-clocked fair queueing scheme for broadband applicationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A general methodology for designing efficient traffic scheduling and shaping algorithmsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- High speed, scalable, and accurate implementation of packet fair queueing algorithms in ATM networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A hierarchical fair service curve algorithm for link-sharing, real-time, and priority servicesIEEE/ACM Transactions on Networking, 2000
- Leap forward virtual clockPublished by Association for Computing Machinery (ACM) ,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
- Making greed work in networks: a game-theoretic analysis of switch service disciplinesIEEE/ACM Transactions on Networking, 1995
- A generalized processor sharing approach to flow control in integrated services networks: the single-node caseIEEE/ACM Transactions on Networking, 1993
- A control-theoretic approach to flow controlPublished by Association for Computing Machinery (ACM) ,1991