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

IEEE/ACM Transactions on Networking

Volumn 13, Issue 1, 2005, Pages 15-28

  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

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DATA COMMUNICATION SYSTEMS; MATHEMATICAL MODELS; QUALITY OF SERVICE; THEOREM PROVING; TREES (MATHEMATICS);

CONTINUOUSLY BACKLOGGED FAIR SHARING; DECISION TREE; DELAY BOUNDS; PACKET SCHEDULING;

PACKET NETWORKS;

EID: 15544384722     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNET.2004.842223     Document Type: Article

References (24)

1. A. Demers, S. Keshav, and S. Shenker, "Analysis and simulation of a fair queueing algorithm," Internetworking: Research and Experience pp. 3-26, 1990. Also appeared in Proc. ACM SIGCOMM'89.
2. A. Greenberg and N. Madras, "How fair is fair queueing?," J. ACM vol. 39, no. 3, pp. 568-598, 1992. Also appeared in Proc. Performance 1990.
3. H. Zhang, "Service disciplines for guaranteed performance service in packet switching networks," Proc. IEEE, vol. 83, Oct. 1995.
4. A. Parekh and R. Gallager, "A generalized processor sharing approach to flow control in integrated services networks: The single node case," IEEE/ACM Trans. Networking, vol. 1, no. 3, pp, 344-357, Jun. 1993.
5. J. Turner, "New directions in communications (or which way to the information age?)," IEEE Commun. Mag., vol. 24, pp. 8-15, Oct. 1986.
6. 2q: Worst-case fair weighted fair queueing," in IEEE INFOCOM, Mar. 1996.
7. M. Shreedhar and G. Varghese, "Efficient fair queueing using deficit round robin," in Proc. ACM SIGCOMM, Aug. 1995, pp. 231-242.
8. M. Katevenis, S. Sidiropoulos, and C. Courcoubetis, "Weighed roundrobin cell multiplexing in general-purpose ATM switch chip," IEEE J. Select. Areas Commun., vol. 9, pp. 1265-1279, Oct. 1991.
9. C. Guo, "SSR: An O(1) time complexity packet scheduler for flows in multi-service packet networks," in Proc. ACM SIGCOMM, Sep. 2001.
10. S. Suri, G. Varghese, and G. Chandranmenon, "Leap forward virtual clock: An O(log(log(n))) fair queueing algorithm," in Proc. IEEE INFOCOM, Kobe, Japan, Apr. 1997.
11. D. Stiliadis and A. Varma, "Latency-rate servers: A general model for analysis of traffic scheduling algorithms," in Proc. IEEE INFOCOM Mar. 1996.
12. Q. Zhao and J. Xu, "On the computational complexity of maintaining GPS clock in packet scheduling," in Proc. IEEE INFOCOM, Hong Kong, Mar. 2004.
13. L. Zhang, "Virtualclock: A new traffic control algorithm for packet switching networks," ACM Trans. Comput. Syst., vol. 9, pp. 101-124, May 1991.
14. D. Stiliadis and A. Varma, "Design and analysis of frame-based fair queueing: A new traffic scheduling algorithm for packet switched networks," in Proc. ACM Sigmetrics, May 1996, pp. 104-115.
15. J. Bennett and H. Zhang, "Hierarchical packet fair queueing algorithms," IEEE/ACM Trans. Networking, vol. 5, pp. 675-689, 1997.
16. J. Xu and R. Lipton, "On fundamental tradeoffs between delay bounds and computational complexity in packet scheduling algorithms," in Proc. ACM SIGCOMM, Aug. 2002.
17. A. Aho, J. Hopcroft, and J. Ullman, The Design and Analysis of Computer Algorithms. Reading, MA: Addison-Wesley, 1973.
18. 2 on linear search programs for the Knapsack problem," J. Comput. Syst. Sci., vol. 16, pp. 413-417, 1978.
19. F. Heide, "A polynomial linear search algorithm for the n-dimensional Knapsack problem," J. ACM, vol. 31, pp. 668-676, 1984.
20. i]," Commun. ACM, vol. 21, no. 7, Jul. 1978.
21. G. Yuval, "Finding nearest neighbors," Inform. Process. Lett., vol. 5, no. 3, pp. 63-65, Aug. 1976.
22. I. Stoica and H. Zhang, "Providing guaranteed services without per flow management," in Proc. ACM SIGCOMM, Sep. 1999.
23. J. Kaur and H. Vin, "Core-stateless guaranteed rate scheduling algorithms," in Proc. IEEE INFOCOM, Anchorage, AK, Apr. 2001.
24. S. Keshav, "On the efficient implementation of fair queueing," Internet-working: Research and Experiences, vol. 2, pp. 157-173, 1991.