On fundamental tradeoffs between delay bounds and computational complexity in packet scheduling algorithms

Computer Communication Review

Volumn 32, Issue 4, 2002, Pages 279-292

  Xu, Jun ^a   Lipton, Richard J ^a  

^a Georgia Institute of Technology   (United States)

Author keywords

Computational complexity; Decision tree; Delay bound; Packet scheduling; Quality of Service

Indexed keywords

DECISION TREE; DELAY BOUNDS; GENERAL PROCESSOR SHARING (GPS); PACKET SCHEDULING; PACKET SCHEDULING ALGORITHMS;

ALGORITHMS; CLIENT SERVER COMPUTER SYSTEMS; COMPUTATIONAL COMPLEXITY; DECISION THEORY; PROBLEM SOLVING; QUALITY OF SERVICE; THEOREM PROVING; TREES (MATHEMATICS);

PACKET NETWORKS;

EID: 33744914826     PISSN: 01464833     EISSN: 01464833     Source Type: Conference Proceeding    
DOI: 10.1145/964725.633052     Document Type: Conference Paper

References (22)

1. A. Aho, J. Hopcroft, and J. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, 1973.
2. 2Q: worst-case fair weighted fair queuing. In IEEE INFOCOM'96, Mar. 1996.
3. J. Bennett and H. Zhang. Hierarchical packet fair queuing algorithms. IEEE/ACM Transactions on Networking, 5(5):675-689, 1997.
4. A. Demers, S. Keshav, and S. Shenker. Analysis and simulation of a fair queuing algorithm. Internetworking: Research and Experience, pages 3-26, 1990.
5. Also in Proceedings of ACM SIGCOMM'89.
6. 2 on linear search programs for the knapsack problem. J. Comput. Syst. Sci., 16:413-417, 1978.
7. i]. Communications of the ACM, 21(7), July 1978.
8. A. Greenberg and N. Madras. How fair is fair queuing? Journal of the ACM, 39(3):568-598, 1992.
9. Also in Proc. of Performance 1990.
10. C. Guo. SSR: an o(1) time complexity packet scheduler for flows in multi-service packet networks. In Proc. of Sigcomm'01, Sept. 2001.
11. F. Heide. A polynomial linear search algorithm for the n-dimensional knapsack problem. J. of the ACM, 31:668-676, 1984.
12. M. Katevenis, S. Sidiropoulos, and C. Courcoubetis. Weighed round-robin cell multiplexing in general-purpose ATM switch chip. IEEE Journal on Selected Areas in Communications, 9:1265-1279, Oct. 1991.
13. D. Knuth. The Art of Computer Programming, Sorting and Searching (Volume 3). Addison-Wesley, 1998.
14. A. Parekh and R. Gallager. A generalized processor sharing approach to flow control in integrated services networks: the single node case. IEEE/ACM Transaction on Networking, 1(3):344-357, June 1993.
15. M. Shreedhar and G. Varghese. Efficient fair queuing using deficit round robin. In Proc. of ACM SIGCOMM'95, pages 231-242, Aug. 1995.
16. D. Stiliadis and A. Varma. Design and analysis of frame-based fair queuing: A new traffic scheduling algorithm for packet switched networks. In Proc. of ACM Sigmetrics'96, pages 104-115, May 1996.
17. D. Stiliadis and A. Varma. Latency-rate servers: a general model for analysis of traffic scheduling algorithms. In Proc. of Infocom'96, Mar. 1996.
18. I. Stoica and H. Zhang. Providing guaranteed services without per flow management. In Proc. of ACM SIGCOMM, Sept. 1999.
19. J. Turner. New directions in communications (or which way to the information age?). IEEE Communications Magazine, 24:8-15, Oct. 1986.
20. G. Yuval. Finding nearest neighbors. Information Processing Letters, 5(3):63-65, Aug. 1976.
21. H. Zhang. Service disciplines for guaranteed performance service in packet switching networks. Proceedings of the IEEE, 83(10), Oct. 1995.
22. L. Zhang. Virtualclock: a new traffic control algorithm for packet switching networks. ACM Transactions on Computer Systems, 9:101-124, May 1991.