Better online buffer management

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 07-09-January-2007, Issue , 2007, Pages 199-208

  Li, Fei ^a   Sethuraman, Jay ^b   Stein, Clifford ^a  

^a Columbia University ^*  (United States)

^b Och Spine at New York Presbyterian Hospitals   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DECISION MAKING; HETEROGENEOUS NETWORKS; INTERNET; QUALITY OF SERVICE;

ALGORITHMIC FRAMEWORK; BUFFER MANAGEMENT; COMPETITIVE RATIO; DETERMINISTIC ALGORITHMS; FIRST IN FIRST OUTS; INTERNET PERFORMANCE; IP-BASED NETWORKS; POTENTIAL FUNCTION;

ROUTERS;

EID: 84969269075     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. S. Albers and M. Schmidt, On the Performance of Greedy Algorithms in Packet Buffering, In Proceedings of the 36th ACM Symposium on Theory of Computing (STOC), pages 35-44, 2004.
2. N. Andelman, Y. Mansour, and A. Zhu, Competitive Queuing Polices for QoS Switches, In Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 761-770, 2003.
3. Y. Azar and Y. Richter, Management of Multi-queue Switches in QoS Networks, In Proceedings of the 35th ACM Symposium on Theory of Computing (STOC), pages 82-89, 2003.
4. Y. Azar and Y. Richter, The Zero-one Principle for Switching Networks, In Proceedings of the 36th ACM Symposium on Theory of Computing (STOC), pages 64-71, 2004.
5. 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.
6. Y. Bartal, F. Y. L. Chin, M. Chrobak, S. P. Y. Fung, W. Jawor, R. Lavi, J. Sgall, and T. Tichy, Online Competitive Algorithms for Maximizing Weighted Through-put of Unit Jobs, In Proceedings of the 21st Symposium on Theoretical Aspects of Computer Science (STACS), pages 190-210, 2004.
7. A. Borodin and R. El-Yaniv, Online Computation and Competitive Analysis, Cambridge University Press, 1998.
8. M. Chrobak, W. Jawor, J. Sgall, and T. Tichy, Improved Online Algorithms for Buffer Management in QoS Switches, In Proceedings of the 12th European Symposium on Algorithms (ESA), pages 204-215, 2004.
9. F. Y. L. Chin and S. P. Y. Fung, Online Scheduling with Partial Job Values: Does Timesharing or Randomization Help?, Algorithmica, Volume 37(3), pages 149-164, 2003.
10. M. Englert and M. Westermann, Lower and Upper Bounds on FIFO Buffer Management in QoS Switches, In Proceedings of the 14th Annual European Symposium on Algorithms (ESA), pages 352-363, 2006.
11. M. Englert and M. Westermann, Considering Suppressed Packets Improves Buffer Management in QoS Switches, to appear in Proceedings of the 18th ACM-SIAM Symposium on Discrete Algorithms (SODA), 2007.
12. 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.
13. A. Kesselman, Z. Lotker, Y. Mansour, B. Patt-Shamir, B. Schieber, and M. Sviridenko, Buffer Overflow Management in QoS Switches, SIAM Journal of Computing, Volume 33(3), pages 563-583, 2004.
14. A. Kesselman, Y. Mansour, and R. van Stee, Improved Competitive Guarantees for QoS Buffering, Algorithmica, Volume 43, pages 63-80, 2005.
15. F. Li, J. Sethuraman, and C. Stein, An Optimal Online Algorithm for Packet Scheduling with Agreeable Deadlines, In Proceedings of the 16th ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 801-802, 2005.
16. Z. Lotker and B. Patt-Shamir, Nearly Optimal FIFO Buffer Management for Diff Serv, In Proceedings of the 21st ACM Symposium on Principles of Distributed Computing (PODC), pages 134-142, 2002.
17. M. Schmidt, Packet Buffering: Randomization Beats Deterministic Algorithms, In Proceedings of the 22nd Symposium on Theoretical Aspects of Computer Science (STACS), pages 293-304, 2005.