Rate-proportional servers: A design methodology for fair queueing algorithms

IEEE/ACM Transactions on Networking

Volumn 6, Issue 2, 1998, Pages 164-174

  Stiliadis, Dimitrios ^a,b   Varma, Anujan ^a,c  

^a IEEE   (United States)

^b LUCENT TECHNOLOGIES   (United States)

^c University of California Santa Cruz   (United States)

Author keywords

Fair queueing algorithms; Performance bounds; Switch scheduling; Traffic scheduling

Indexed keywords

ALGORITHMS; ASYNCHRONOUS TRANSFER MODE; CONGESTION CONTROL (COMMUNICATION); DATA COMMUNICATION SYSTEMS; ONLINE SYSTEMS; PACKET NETWORKS; QUEUEING THEORY; TELECOMMUNICATION LINKS; TELECOMMUNICATION TRAFFIC; VALUE ENGINEERING;

GENERALIZED PROCESSOR SHARING (GPS); QUALITY OF SERVICE (QOS); RATE PROPORTIONAL SERVERS (RPS); WEIGHTED FAIR QUEUEING (WFQ);

COMPUTER NETWORKS;

EID: 0032047410     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/90.664265     Document Type: Article

References (23)

1. A. K. Parekh and R. G. Gallager, "A generalized processor sharing approach to flow control - The single node case," IEEE/ACM Trans. Networking, vol. 1, pp. 344-357, June 1993.
2. A. Demers, S. Keshav, and S. Shenker, "Analysis and simulation of a fair queueing algorithm," Internetworking: Research and Experience, vol. 1, no. 1, pp. 3-26, 1990.
3. L. Zhang, "VirtualClock: A new traffic control algorithm for packet switching networks," ACM Trans. Comput. Syst., vol. 9, pp. 101-124, May 1991.
4. D. Ferrari and D. Verma, "A scheme for real-time channel establishment in wide-area networks," IEEE J. Select. Areas Commun., vol. 8, pp. 368-379, Apr. 1990.
5. M. Katevenis, S. Sidiropoulos, and C. Courcoubetis, "Weighted round-robin cell multiplexing in a general-purpose ATM switch chip," IEEE J. Select. Areas Commun., vol. 9, pp. 1265-1279, Oct. 1991.
6. M. Shreedhar and G. Varghese, "Efficient fair queueing using deficit round robin," in Proc. ACM SIGCOMM'95, Cambridge, MA, Sept. 1995, pp. 231-242.
7. C. Kalmanek, H. Kanakia, and S. Keshav, "Rate controlled servers for very high-speed networks," in IEEE Global Telecommunications Conf., San Diego, CA, Dec. 1990, pp. 300.3.1-300.3.9.
8. S. Golestani, "A framing strategy for congestion management," IEEE J. Select. Areas Commun., vol. 9, pp. 1064-1077, Sept. 1991.
9. D. Verma, H. Zhang, and D. Ferrari, "Delay jitter control for real-time communication in a packet switching network," in Proc. TRICOMM'91, New York, NY, Apr. 1991, pp. 35-43.
10. H. Zhang, "Service disciplines for guaranteed performance service in packet-switching networks," Proc. IEEE, vol. 83, pp. 1374-1396, Oct. 1995.
11. J. Davin and A. Heybey, "A simulation study of fair queueing and policy enforcement," Comput. Commun. Rev., vol. 20, pp. 23-29, Oct. 1990.
12. S. Golestani, "A self-clocked fair queueing scheme for broadband applications," in Proc. IEEE INFOCOM'94, Toronto, Ont., Canada, Apr. 1994, pp. 636-646.
13. P. Goyal, H. M. Vin, and H. Chen, "Start-time fair queueing: A scheduling algorithm for integrated services packet switching networks," in Proc. ACM SIGCOMM'96, Stanford, CA, Sept. 1996, pp. 157-169.
14. S. Golestani, "Network delay analysis of a class of fair queueing algorithms," IEEE J. Select. Areas Commun., vol. 13, pp. 1057-1070, Aug. 1995.
15. P. Goyal, S. Lam, and H. Vin, "Determining end-to-end delay bounds in heterogeneous networks," in Proc. 5th Int. Workshop Network and Operating System Support for Digital Audio and Video, Durham, NH, Apr. 1995, pp. 287-298.
16. D. Stiliadis and A. Varma, "Latency-rate servers: A general model for analysis of traffic scheduling algorithms," in Proc. IEEE INFOCOM'96, San Francisco, CA, Apr. 1996, pp. 111-119.
17. N. Figueira and J. Pasquale, "A upper bound on delay for the Virtualclock service discipline," IEEE/ACM Trans. Networking, vol. 3, pp. 399-408, Apr. 1995.
18. J. C. R. Bennett and H. Zhang, "Hierarchical packet fair queueing algorithms," in Proc. ACM SIGCOMM'96, Stanford, CA, Sept. 1996, pp. 143-156.
19. S. Suri, G. Varghese, and G. Chandranmenon, "Leap forward fair queueing," in Proc. IEEE INFOCOM'97, Kobe, Japan, pp. 557-565.
20. D. Stiliadis and A. Varma, "Efficient fair-queueing algorithms for packet-switched networks," IEEE/ACM Trans. Networking, this issue, pp. 175-185.
21. _, "Frame-based fair queueing: A new traffic scheduling algorithm for packet-switched networks," in Proc. ACM SIGMETRICS'96, Philadelphia, PA, May 1996, pp. 104-115.
22. J. Rexford, A. Greenberg, and F. Bonomi, "A fair leaky-bucket shaper for ATM networks," AT&T Rep., 1995.
23. D. Stiliadis, "Traffic scheduling in packet switched networks: Analysis, design, and implementation," Ph.D. thesis, Univ. California, Santa Cruz, June 1996. Available www: http://www.cse.ucsc. edu/research/hsnlab/publications.