Efficient fair queueing algorithms for packet-switched networks

IEEE/ACM Transactions on Networking

Volumn 6, Issue 2, 1998, Pages 175-185

  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; COMPUTATIONAL COMPLEXITY; CONGESTION CONTROL (COMMUNICATION); PACKET SWITCHING; QUEUEING THEORY; TELECOMMUNICATION TRAFFIC; VALUE ENGINEERING;

FRAME BASED FAIR QUEUEING (FFQ); QUALITY OF SERVICE (QOS); RATE PROPORTIONAL SERVERS (RPS); WEIGHTED FAIR QUEUEING (WFQ);

PACKET NETWORKS;

EID: 0032045686     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/90.664266     Document Type: Article

References (25)

1. A. K. Parekh and R. G. Gallager, "A generalized processor sharing approach to flow control - The single node case," in Proc. IEEE INFOCOM'92, vol. 2, May 1992, pp. 915-924.
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 Proc. 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. H. Zhang, "Service disciplines for guaranteed performance service in packet-switching networks," Proc. IEEE, vol. 83, pp. 1374-1396, Oct. 1995.
10. 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, Mar. 1996, pp. 111-119.
11. _, "Rate-proportional servers: A design methodology for fair queueing algorithms," IEEE/ACM Trans. Networking, this issue, pp. 164-174.
12. J. Davin and A. Heybey, "A simulation study of fair queueing and policy enforcement," Comput. Commun. Rev., vol. 20, pp. 23-29, Oct. 1990.
13. S. Golestani, "A self-clocked fair queueing scheme for broadband applications," in Proc. IEEE INFOCOM'94, Toronto, Ont., Canada, Apr. 1994, pp. 636-646.
14. _, "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, 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.
16. D. Stiliadis, "Traffic scheduling in packet switched networks: Analysis, design, and implementation," Ph.D. thesis, Comput. Eng. Dep., Univ. California, Santa Cruz, June 1996.
17. D. Stiliadis and A. Varma, "A reconfigurable hardware approach to network simulation," ACM Trans. Modeling Comput. Simulation, vol. 7, no. 1, pp. 131-156, Jan. 1997.
18. A. Varma and D. Stiliadis, "FAST: An FPGA-based simulation testbed for ATM switching systems," in Proc. ICC'96, vol. 1, Dallas, TX, June 1996, pp. 374-378.
19. P. V. E. Boas, "Preserving order in a forest in less than logarithmic time and linear space," Inform. Processing Lett., vol. 6, pp. 80-82, Apr. 1977.
20. P. V. E. Boas, R. Kaas, and E. Zijlstra, "Design and implementation of an efficient priority queue," Mathemat. Syst. Theory, vol. 10, pp. 99-127, 1977.
21. K. Mehlhorn, Data Structures and Algorithms. New York: Springer-Verlag, 1984.
22. D. Johnson, "A priority queue in which initialization and queue operations take O(log log d) time," Math. Syst. Theory, vol. 15, pp. 295-309, 1982.
23. B. Dixon, "Concurrency in an O(log log n) priority queue," in Proc. Parallel and Distributed Computing, Theory and Practice, First Canada-France Conference, Montreal, P.Q., Canada, 1994, pp. 59-71.
24. J. C. R. Bennett and H. Zhang, "Hierarchical packet fair queueing algorithms," in Proc. ACM SIGCOMM'96, Stanford, CA, Sept. 1996, pp. 143-156.
25. D. Stiliadis and A. Varma, "A general methodology for designing efficient traffic scheduling and shaping algorithms," in Proc. IEEE INFOCOM'97, San Francisco, CA, Apr. 1997, pp. 326-335.