Fair scheduling with tunable latency: a round robin approach
- 22 January 2003
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 2, 1328-1333
- https://doi.org/10.1109/glocom.1999.829988
Abstract
No abstract availableThis publication has 7 references indexed in Scilit:
- A self-clocked fair queueing scheme for broadband applicationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- On adaptive bandwidth sharing with rate guaranteesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Latency-rate servers: a general model for analysis of traffic scheduling algorithmsIEEE/ACM Transactions on Networking, 1998
- Rate-proportional servers: a design methodology for fair queueing algorithmsIEEE/ACM Transactions on Networking, 1998
- Efficient fair queueing algorithms for packet-switched networksIEEE/ACM Transactions on Networking, 1998
- Efficient fair queuing using deficit round-robinIEEE/ACM Transactions on Networking, 1996
- A generalized processor sharing approach to flow control in integrated services networks: the single-node caseIEEE/ACM Transactions on Networking, 1993