Competitive analysis of multi-queue preemptive QoS algorithms for general priorities

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Volumn E89-A, Issue 5, 2006, Pages 1186-1197

  Itoh, Toshiya ^a,b,c,d   Takahashi, Noriyuki ^a  

^a TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

^b IPSJ   (Japan)

^c ASSOCIATION FOR COMPUTING MACHINERY   (United States)

^d LA   (Japan)

Author keywords

Competitive ratio; Multi priority; Multi queue switches; Preemption; Quality of service (QoS)

Indexed keywords

ALGORITHMS; BANDWIDTH; COMMUNICATION; INTERNET; PACKET NETWORKS; RESPONSE TIME (COMPUTER SYSTEMS);

MULTI-PRIORITY; MULTI-QUEUE SWITCHES; PREEMPTION;

QUALITY OF SERVICE;

EID: 33646803803     PISSN: 09168508     EISSN: 17451337     Source Type: Journal    
DOI: 10.1093/ietfec/e89-a.5.1186     Document Type: Article

References (13)

1. W.A. Aiello, Y. Mansour, S. Rajagopolan, and A. Rosen, "Competitive queue policies for differentiated services," Proc. IEEE INFOCOM, pp.431-440, 2000.
2. S. Albers and M. Schmidt, "On the performance of greedy algorithms in packet buffering," Proc. 36th Annual ACM Symposium on Theory of Computing, pp.35-44, 2004.
3. N. Andelman, Y. Mansour, and A. Zhu, "Competitive queuing policies for QoS switches," Proc. 14th Annual ACM-SIAM Symposium on Discrete Algorithms, pp.761-770, 2003.
4. Y. Azar and A. Litichevskey, "Maximizing throughput in multi-queue switches," Proc. 12th Annual European Symposium on Algorithms, LNCS 3221, pp.53-64, Springer, 2004.
5. Y. Azar and Y. Richter, "Management of multi-queue switches in QoS networks," Proc. 35th Annual ACM Symposium on Theory of Computing, pp.82-89, 2003.
6. Y. Azar and Y. Richter, "The zero-one principle for switching networks," Proc. 36th Annual ACM Symposium on Theory of Computing, pp.64-71, 2004.
7. N. Bansal, L.K. Fleischer, T. Kimbrel, M. Mahdian, B. Scheiber, and M. Sviridenko, "Further improvements in competitive guarantees for QoS buffering," Proc. 31st International Colloquium on Automata, Languages and Programming, LNCS 3221, pp. 196-207, Springer, 2004.
8. A. Borodin and R. El-Yaniv, Online Computation and Competitive Analysis, Cambridge University Press, 1998.
9. T. Itoh and T. Nagumo, "Improved lower bounds for competitive ratio of multi-queue switches in QoS networks," IEICE Trans. Fundamentals, vol.E88-A, no.5, pp. 1155-1165, May 2005.
10. A. Kesselman, Z. Lotker, Y. Mansour, B. Patt-Shamir, B. Schieber, and M. Sviridenko, "Buffer overflow management in QoS switches," SIAM J. Comput., vol.33, no.3, pp.563-583, 2004.
11. A. Kesselman and Y. Mansour, "Loss-bounded analysis for differentiated services," Proc. 12th Annual ACM-SIAM Symposium on Discrete Algorithms, pp.591-600, 2001.
12. A. Kesselman, Y. Mansour, and R. van Stee, "Improved competitive guarantee for QoS buffering," Proc. 11th Annual European Symposium on Algorithms, LNCS 2832, pp.361-372, Springer, 2003.
13. Z. Lotker and B. Patt-Shamir, "Nearly optimal FIFO buffer management for DiffServ," Proc. 21st ACM Symposium on Distributed Computing, pp. 134-143, 2002.