Bandwidth scheduling for wide-area ATM networks using virtual finishing times
- 1 January 1996
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Networking
- Vol. 4 (1), 49-54
- https://doi.org/10.1109/90.503761
Abstract
This paper is concerned with the design of aclass of bandwidth scheduling policies that are suitable forpublic, wide-area ATM networks. We specify design goalsfor such strategies including ease of implementation andthe ability to guarantee minimum bandwidths to individualbuffers. Packetized generalized processor sharing is brieflydiscussed and a minimum-bandwidth result for self-clockedfair queueing is given. We revisit an approach originally proposedby L. Zhang and prove that it is...Keywords
This publication has 8 references indexed in Scilit:
- A self-clocked fair queueing scheme for broadband applicationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Quality of service guarantees in virtual circuit switched networksIEEE Journal on Selected Areas in Communications, 1995
- An upper bound delay for the virtual-clock service disciplineIEEE/ACM Transactions on Networking, 1995
- A generalized processor sharing approach to flow control in integrated services networks: the multiple node caseIEEE/ACM Transactions on Networking, 1994
- Virtual spacing for flexible traffic controlInternational Journal of Communication Systems, 1994
- A generalized processor sharing approach to flow control in integrated services networks: the single-node caseIEEE/ACM Transactions on Networking, 1993
- Service Burstiness and Dynamic Burstiness Measures: A FrameworkJournal of High Speed Networks, 1992
- VirtualClockACM Transactions on Computer Systems, 1991