Improved online algorithms for buffer management in QoS switches

ACM Transactions on Algorithms

Volumn 3, Issue 4, 2007, Pages

  Chrobak, Marek ^a,c   Jawor, Wojciech ^a,c   Sgall, Jií ^b,d   Tich, Tomá ^b,d  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b INSTITUTE OF MATHEMATICS   (Czech Republic)

^c University of California Riverside   (United States)

^d MATHEMATICAL INSTITUTE   (Czech Republic)

Author keywords

Online algorithms; Scheduling

Indexed keywords

BUFFER MANAGEMENT; NETWORK SWITCH; ONLINE ALGORITHMS;

ALGORITHMS; ONLINE SYSTEMS; PACKET NETWORKS; SCHEDULING; SWITCHING SYSTEMS;

QUALITY OF SERVICE;

EID: 36448966129     PISSN: 15496325     EISSN: 15496333     Source Type: Journal    
DOI: 10.1145/1290672.1290687     Document Type: Conference Paper

References (15)

1. ANDELMAN, N., MANSOUR, Y., AND ZHU, A. 2003. Competitive queueing policies in QoS switches. In Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA), 761-770.
2. BANSAL, N., FLEISCHER, L., KIMBREL, T., MAHDIAN, M., SCHIEBER, B., AND SVIRIDENKO, M. 2004. Further improvements in competitive guarantees for QoS buffering. In Proceedings of the 31st International Colloquium on Automata, Languages, and Programming (ICALP). Lecture Notes in Computer Science, vol. 3142. Springer, 196-207.
3. BARTAL, Y., CHIN, F. Y. L., CHROBAK, M., FUNG, S. P. Y., JAWOR, W., LAVI, R., SGALL, J., AND TICHÝ, T. 2004. Online competitive algorithms for maximizing weighted throughput of unit jobs. In Proceedings of the 21st Symposium on Theoretical Aspects of Computer Science (STACS). Lecture Notes in Computer Science, vol. 2996. Springer, 187-198.
4. BORODIN, A., AND EL-YANIV, R. 1998. Online Computation and Competitive Analysis. Cambridge University Press, New York.
5. CHIN, F. Y. L., CHROBAK, M., FUNG, S. P. Y., JAWOR, W., SGALL, J., AND TICHÝ, T. 2006. Online competitive algorithms for maximizing weighted throughput of unit jobs. J. Discr. Alg. 4, 255-276.
6. CHIN, F. Y. L., AND FUNG, S. P. Y 2003. Online scheduling for partial job values: Does timesharing or randomization help? Algorithmica 37, 149-164.
7. CHROBAK, M., JAWOR, W., SGALL, J., AND TICHÝ, T. 2004. Improved online algorithms for buffer management in QoS switches. In Proceedings of the 12th European Symposium on Algorithms (ESA). Lecture Notes in Computer Science, vol. 3221. Springer, 204-215.
8. ENGLERT,M., AND WESTERMAN,M. 2007. Considering suppressed packets improves buffer management in QoS switches. In Proceedings of the 18th ACM-SIAM Symposium on Discrete Algorithms (SODA), 209-218.
9. HAJEK, B. 2001. On the competitiveness of online scheduling of unit-length packets with hard deadlines in slotted time. In Conference in Information Sciences and Systems, 434-438.
10. KESSELMAN, A., LOTKER, Z., MANSOUR, Y., PATT-SHAMIR, B., SCHIEBER, B., AND SVIRIDENKO, M. 2001. Buffer overflow management in QoS switches. In Proceedings of the 33rd ACM Symposium Theory of Computing (STOC), 520-529.
11. KESSELMAN, A., LOTKER, Z., MANSOUR, Y., PATT-SHAMIR, B., SCHIEBER, B., AND SVIRIDENKO, M. 2004. Buffer overflow management in QoS switches. SIAM J. Comput. 33, 563-583.
12. KESSELMAN, A., MANSOUR, Y., AND VAN STEE, R. 2003. Improved competitive guarantees for QoS buffering. In Proceedings of the 11th European Symposium on Algorithms (ESA). Lecture Notes in Computer Science, vol. 2832. Springer, 361-372.
13. KESSELMAN, A., MANSOUR, Y., AND VAN STEE, R. 2005. Improved competitive guarantees for QoS buffering. Algorithmica 43, 63-80.
14. LI, F., SETHURAMAN, J., AND STEIN, C 2005. An optimal online algorithm, for packet scheduling with agreeable deadlines. In Proceedings of the 16th ACM-SIAM Symposium on Discrete Algoritlvns (SODA), 801-802.
15. LI, F., SETHURAMAN, J., AND STEIN, C 2007. Better online buffer management. In Proceedings of the 18th ACM-SIAM Symposium on Discrete Algorithms (SODA), 199-208.