Carry-over round robin: a simple cell scheduling mechanism for ATM networks
- 1 January 1998
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Networking
- Vol. 6 (6), 779-796
- https://doi.org/10.1109/90.748089
Abstract
No abstract availableThis publication has 14 references indexed in Scilit:
- Carry-over round robin: a simple cell scheduling mechanism for ATM networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Multi-rate traffic shaping and end-to-end performance guarantees in ATM networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A self-clocked fair queueing scheme for broadband applicationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Rate controlled servers for very high-speed networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Efficient fair queueing algorithms for packet-switched networksIEEE/ACM Transactions on Networking, 1998
- Multirate scheduling of VBR video traffic in ATM networksIEEE Journal on Selected Areas in Communications, 1997
- Efficient fair queuing using deficit round-robinIEEE/ACM Transactions on Networking, 1996
- Congestion-free communication in high-speed packet networksIEEE Transactions on Communications, 1991
- Virtual clock: a new traffic control algorithm for packet switching networksACM SIGCOMM Computer Communication Review, 1990
- Analysis and simulation of a fair queueing algorithmPublished by Association for Computing Machinery (ACM) ,1989