On adaptive bandwidth sharing with rate guarantees
- 27 November 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 3, 1122-1130
- https://doi.org/10.1109/infcom.1998.662924
Abstract
No abstract availableThis publication has 18 references indexed in Scilit:
- A generalized processor sharing approach to flow control in integrated services networks-the multiple node casePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Latency-rate servers: a general model for analysis of traffic scheduling algorithmsPublished 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
- On adaptive bandwidth sharing with rate guaranteesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Start-time fair queueing: a scheduling algorithm for integrated services packet switching networksIEEE/ACM Transactions on Networking, 1997
- A new approach for allocating buffers and bandwidth to heterogeneous, regulated traffic in an ATM nodeIEEE Journal on Selected Areas in Communications, 1995
- Buffer size requirements under longest queue firstPerformance Evaluation, 1993
- Optimal scheduling policies for a class of queues with customer deadlines to the beginning of serviceJournal of the ACM, 1988
- Noah, Joseph, and Operational HydrologyWater Resources Research, 1968
- Fractional Brownian Motions, Fractional Noises and ApplicationsSIAM Review, 1968