Competitive scheduling of packets with hard deadlines in a finite capacity queue

Proceedings - IEEE INFOCOM

Volumn , Issue , 2009, Pages 1062-1070

  Li, Fei ^a  

^a George Mason University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMIC FRAMEWORK; ANALYSIS METHOD; BUFFER MANAGEMENT; CHAOTIC CHARACTERISTICS; CHARGING SCHEME; COMPETITIVE ANALYSIS; COMPETITIVE RATIO; FINITE CAPACITY QUEUES; INPUT SEQUENCE; INTERNET TRAFFIC; NEGATIVE VALUES; OFF-LINE ALGORITHM; ON-LINE ALGORITHMS; ONLINE SCHEDULING; POTENTIAL FUNCTION; QUEUE MODELS; TIME STEP; TOTAL VALUES;

QUEUEING THEORY;

SCHEDULING ALGORITHMS;

EID: 70349690079     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2009.5062018     Document Type: Conference Paper

References (23)

1. W. Aiello, Y. Mansour, S. Rajagopolan, and A. Rosen. Competitive queue policies for differentiated services. In Proceedings of the 19th Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM), pages 431-440, 2000.
2. W. Aiello, Y. Mansour, S. Rajagopolan, and A. Rosen. Competitive queue policies for differentiated services. Journal of Algorithms, 55(2):113-141, 2005.
3. S. Albers and M. Schmidt. On the performance of greedy algorithms in packet buffering. SIAM Journal on Computing, 35(2):278-304, 2005.
4. N. Andelman, Y. Mansour, and A. Zhu. Competitive queuing polices for QoS switches. In Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 761-770, 2003.
5. Y. Azar and N. Levy. Multiplexing packets with arbitrary deadlines in bounded buffers. Lecture Notes in Computer Science (SWAT), pages 5-16, 2006.
6. Y. Azar and Y. Richter. Management of multi-queue switches in QoS networks. In Proceedings of the 35th Annual ACM Symposium on Theory of Computing (STOC), pages 82-89, 2003.
7. Y. Azar and Y. Richter. The zero-one principle for switching networks. In Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC), pages 64-71, 2004.
8. N. Bansal, L. K. Fleischer, T. Kimbrel, M. Mahdian, B. Schieber, and M. Sviridenko. Further improvements in competitive guarantees for QoS buffering. In Proceedings of the 31st International Colloquium on Automata, Languages and Programming (ICALP), pages 196-207, 2004.
9. A. Borodin and R. El-Yaniv. Online Computation and Competitive Analysis. Cambridge University Press, 1998.
10. F. Y. L. Chin, M. Chrobak, S. P. Y. Fung, W. Jawor, J. Sgall, and T. Tichy. Online competitive algorithms for maximizing weighted throughput of unit jobs. Journal of Discrete Algorithms, 4(2):255-276, 2006.
11. F. Y. L. Chin and S. P. Y. Fung. Online scheduling with partial job values: Does timesharing or randomization help? Algorithmica, 37(3):149-164, 2003.
12. M. Chrobak, W. Jawor, J. Sgall, and T. Tichy. Improved online algorithms for buffer management in QoS switches. ACM Transactions on Algorithms, 3(4), Article number 50, 2007.
13. M. Englert and M. Westermann. Considering suppressed packets improves buffer management in QoS switches. In Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 209-218, 2007.
14. S. Floyd and V. Paxson. Difficulties in simulating the Internet. IEEE/ACM Transactions on Networking, (4):392-403, 2001.
15. B. Hajek. On the competitiveness of online scheduling of unit-length packets with hard deadlines in slotted time. In Proceedings of 2001 Conference on Information Sciences and Systems (CISS), pages 434-438, 2001.
16. T. Itoh and N. Takahashi. Competitive analysis of multi-queue preemptive QoS algorithms for general priorities. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E89-A(5):1186-1197, 2006.
17. A. Kesselman, Z. Lotker, Y. Mansour, B. Patt-Shamir, B. Schieber, and M. Sviridenko. Buffer overflow management in QoS switches. SIAM Journal of Computing (SICOMP), 33(3):563-583, 2004.
18. A. Kesselman, Y. Mansour, and R. van Stee. Improved competitive guarantees for QoS buffering. In Proceedings of 13th Annual European Symposium on Algorithms (ESA), pages 361-372, 2003.
19. F. Li. Online algorithms for scheduling weighted packets with deadlines in bounded buffers. CoRR abs/0807.2694, 2008.
20. F. Li, J. Sethuraman, and C. Stein. An optimal online algorithm for packet scheduling with agreeable deadlines. In Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 801-802, 2005.
21. F. Li, J. Sethuraman, and C. Stein. Better online buffer management. In Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 199-208, 2007.
22. Z. Lotker and B. Patt-Shamir. Nearly optimal FIFO buffer management for DiffServ. In Proceedings of the 21st Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 134-142, 2002.
23. W. Willinger and V. Paxson. Where mathematics meets the Internet. Notices of the American Mathematical Society, pages 961-970, 1998.