SRR: An O(1) time complexity packet scheduler for flows in multi-service packet networks
- 27 August 2001
- conference paper
- conference paper
- Published by Association for Computing Machinery (ACM) in Proceedings of the 2001 conference on Virtual reality, archeology, and cultural heritage - VAST '01
- Vol. 31 (4), 211-222
- https://doi.org/10.1145/383059.383076
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Promoting the use of end-to-end congestion control in the InternetIEEE/ACM Transactions on Networking, 1999
- Efficient fair queueing algorithms for packet-switched networksIEEE/ACM Transactions on Networking, 1998
- Carry-over round robin: a simple cell scheduling mechanism for ATM networksIEEE/ACM Transactions on Networking, 1998
- Explicit allocation of best-effort packet delivery serviceIEEE/ACM Transactions on Networking, 1998
- Flow theoryIEEE/ACM Transactions on Networking, 1997
- Generalized guaranteed rate scheduling algorithms: a frameworkIEEE/ACM Transactions on Networking, 1997
- Hardware implementation of fair queuing algorithms for asynchronous transfer mode networksIEEE Communications Magazine, 1997
- Start-time fair queueing: a scheduling algorithm for integrated services packet switching networksIEEE/ACM Transactions on Networking, 1997
- Link-sharing and resource management models for packet networksIEEE/ACM Transactions on Networking, 1995
- Random early detection gateways for congestion avoidanceIEEE/ACM Transactions on Networking, 1993