Latency-rate servers: a general model for analysis of traffic scheduling algorithms
- 23 December 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 1, 111-119
- https://doi.org/10.1109/infcom.1996.497884
Abstract
No abstract availableThis publication has 13 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
- A self-clocked fair queueing scheme for broadband applicationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Burst scheduling: architecture and algorithm for switching packet videoPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Efficient fair queueing using deficit round robinPublished by Association for Computing Machinery (ACM) ,1995
- Quality of service guarantees in virtual circuit switched networksIEEE Journal on Selected Areas in Communications, 1995
- Network delay analysis of a class of fair queueing algorithmsIEEE Journal on Selected Areas in Communications, 1995
- Comparison of rate-based service disciplinesACM SIGCOMM Computer Communication Review, 1991
- A calculus for network delay. I. Network elements in isolationIEEE Transactions on Information Theory, 1991
- Weighted round-robin cell multiplexing in a general-purpose ATM switch chipIEEE Journal on Selected Areas in Communications, 1991
- A scheme for real-time channel establishment in wide-area networksIEEE Journal on Selected Areas in Communications, 1990