Universal Packet Scheduling
Authors:
Open Access
- 16 November 2015
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 1-7
Abstract
No abstract availableAll Related Versions
This publication has 31 references indexed in Scilit:
- Controlling Queue DelayQueue, 2012
- Why flow-completion time is the right metric for congestion controlACM SIGCOMM Computer Communication Review, 2006
- Matching output queueing with a combined input/output-queued switchIEEE Journal on Selected Areas in Communications, 1999
- Efficient fair queueing using deficit round robinACM SIGCOMM Computer Communication Review, 1995
- A generalized processor sharing approach to flow control in integrated services networks: the single-node caseIEEE/ACM Transactions on Networking, 1993
- Random early detection gateways for congestion avoidanceIEEE/ACM Transactions on Networking, 1993
- Supporting real-time applications in an Integrated Services Packet NetworkACM SIGCOMM Computer Communication Review, 1992
- Virtual clock: a new traffic control algorithm for packet switching networksACM SIGCOMM Computer Communication Review, 1990
- Analysis and simulation of a fair queueing algorithmACM SIGCOMM Computer Communication Review, 1989
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time EnvironmentJournal of the ACM, 1973