Hierarchical packet fair queueing algorithms

IEEE/ACM Transactions on Networking

Volumn 5, Issue 5, 1997, Pages 675-689

  Bennett, Jon C R ^a,b,c   Zhang, Hui ^a,d  

^a IEEE   (United States)

^b HARVARD UNIVERSITY   (United States)

^c BBN TECHNOLOGIES   (United States)

^d Carnegie Mellon University   (United States)

Author keywords

Hierarchical packet scheduling; Link sharing; Quality of service; Real time; Resource management

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; CONGESTION CONTROL (COMMUNICATION); HIERARCHICAL SYSTEMS; QUEUEING THEORY; REAL TIME SYSTEMS; TELECOMMUNICATION LINKS; VOICE/DATA COMMUNICATION SYSTEMS;

HIERARCHICAL PACKET FAIR QUEUEING (H PFQ); WORST CASE FAIR INDICES (WFI);

PACKET NETWORKS;

EID: 0031250731     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/90.649568     Document Type: Article

References (21)

1. 2Q: Worst-case fair weighted fair queueing," in Proc. IEEE INFOCOM'96, San Francisco, CA, Mar. 1996, pp. 120-128.
2. D. Clark, S. Shenker, and L. Zhang, "Supporting real-time applications in an integrated services packet network: Architecture and mechanism," in Proc. ACM SIGCOMM'92, Baltimore, MD, Aug. 1992, pp. 14-26.
3. R. Cruz, "Service burstiness and dynamic burstiness measures: A framework," J. High Speed Networks, vol. 1, no. 2, pp. 105-127, 1992.
4. J. Davin and A. Heybey, "A simulation study of fair queueing and policy enforcement," Computer Commun. Rev., vol. 20, no. 5, pp. 23-29, Oct. 1990.
5. A. Demers, S. Keshav, and S. Shenker, "Analysis and simulation of a fair queueing algorithm," J. Internetworking Res. Experience, pp. 3-26, Oct. 1990;
6. also in Proc. ACM SIGCOMM'89, pp. 3-12.
7. S. Floyd and V. Jacobson, "Link-sharing and resource management models for packet networks," IEEE/ACM Trans. Networking, vol. 3, Aug. 1995.
8. S. Golestani, "A self-clocked fair queueing scheme for broadband applications," in Proc. IEEE INFOCOM'94, Toronto, CA, June 1994, pp. 636-646.
9. S. Keshav, "A control-theoretic approach to flow control," in Proc. ACM SIGCOMM'91, Zurich, Switzerland, Sept. 1991, pp. 3-15.
10. P. McKenney, "Stochastic fair queueing," in Proc. IEEE INFOCOM'90, San Francisco, CA, June 1990.
11. O. Ndiaye, "An efficient implementation of a hierarchical weighted fair queue packet scheduler," Master's thesis, Mass. Inst. Technol., May 1994.
12. P. Goyal, H. M. Vin, and H. Chen, "Start-time fair queuing: A scheduling algorithm for integrated services," in Proc. ACM-SIGCOMM'96, Palo Alto, CA, Aug. 1996, pp. 157-168.
13. A. Parekh and R. Gallager, "A generalized processor sharing approach to flow control - The single node case," ACM/IEEE Trans. Networking, vol. 1, pp. 344-357, June 1993.
14. S. Suri, G. Varghese, and G. Chandranmenon, "Leap forward virtual clock," in Proc. INFOCOM'97, Kobe, Japan, Apr. 1997.
15. S. Shenker, "Making greed work in networks: A game theoretical analysis of switch service disciplines," in Proc. ACM SIGCOMM'94, London, U.K., Aug. 1994, pp. 47-57.
16. S. Shenker, D. Clark, and L. Zhang, "A scheduling service model and a scheduling architecture for an integrated services network," 1993, preprint.
17. M. Shreedhar and G. Varghese, "Efficient fair queueing using deficit round robin," in Proc. SIGCOMM'95, Boston, MA, Sept. 1995, pp. 231-243.
18. D. Stilliadis and A. Verma, "Design and analysis of frame-based fair queueing: A new traffic scheduling algorithm for packet-switched networks," in Proc. ACM SIGMETRICS'96, May 1996.
19. _, "Latency-rate servers: A general model for analysis of traffic scheduling algorithms," in Proc. IEEE INFOCOM'96, San Francisco, CA, Mar. 1996, pp. 111-119.
20. I. Stoica and H. Abdel-Wahab, "Earliest eligible virtual deadline first: A flexible and accurate mechanism for proportional share resource allocation," Tech. Rep. TR-95-22, Old Dominion Univ., Nov. 1995.
21. H. Zhang and S. Keshav, "Comparison of rate-based service disciplines," in Proc. ACM SIGCOMM'91, Zurich, Switzerland, Sept. 1991, pp. 113-122.