A hierarchical fair service curve algorithm for link-sharing, real-time, and priority services
- 1 April 2000
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Networking
- Vol. 8 (2), 185-199
- https://doi.org/10.1109/90.842141
Abstract
No abstract availableThis publication has 16 references indexed in Scilit:
- WF/sup 2/Q: worst-case fair weighted fair queueingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Hierarchical packet fair queueing algorithmsIEEE/ACM Transactions on Networking, 1997
- Start-time fair queueing: a scheduling algorithm for integrated services packet switching networksIEEE/ACM Transactions on Networking, 1997
- Efficient network QoS provisioning based on per node traffic shapingIEEE/ACM Transactions on Networking, 1996
- Service disciplines for guaranteed performance service in packet-switching networksProceedings of the IEEE, 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
- Link-sharing and resource management models for packet networksIEEE/ACM Transactions on Networking, 1995
- A generalized processor sharing approach to flow control in integrated services networks: the single-node caseIEEE/ACM Transactions on Networking, 1993
- Calendar queues: a fast 0(1) priority queue implementation for the simulation event set problemCommunications of the ACM, 1988