publication . External research report . Preprint . Article . 2013

Buffer Management of Multi-Queue QoS Switches with Class Segregation

Itoh, Toshiya; Yoshimoto, Seiji;
Open Access English
  • Published: 10 Apr 2013
Abstract
Comment: 12 pages, 2 tables, 2 figures. arXiv admin note: substantial text overlap with arXiv:1109.6060
Persistent Identifiers
Subjects
free text keywords: Computer Science - Data Structures and Algorithms, Theoretical Computer Science, General Computer Science, Competitive analysis, Network packet, Distributed computing, Discrete mathematics, Online algorithm, Quality of service, Computer science, Queue
18 references, page 1 of 2

[1] W.A. Aiello, Y. Mansour, S. Rajagopolan, and A. Rosen. Competitive Queue Policies for Differential Services. In Proc. of IEEE INFOCOM , pp.431-440 (2000).

[2] K. Al-Bawani and A. Souza. Buffer Overflow Management with Class Segregation. Information Processing Letters 113(4), pp.145-150, 2013.

[4] Y. Azar. Online packet Switching. In Proc. of the 2nd Workshop on Approximation and Online Algorithms, Lecture Notes in Computer Science 3351, pp.1-5 (2004).

[5] Y. Azar and A. Litichevskey. Maximizing Throughput in Multi-Queue Switches. In Proc. of the 12th European Symposium on Algorithms, Lecture Notes in Computer Science 3221, pp.53-64 (2004).

[6] Y. Azar and Y. Richter. Management of Multi-Queue Switches in QoS Networks. In Proc. of the 35th Annual ACM Symposium on Theory of Computing , pp.82-89 (2003).

[7] Y. Azar and Y. Richter. The Zero-One Principle for Switching Networks. In Proc. of the 36th Annual ACM Symposium on Theory of Computing , pp.64-71 (2004).

[8] M. Bienkowski. An Optimal Lower Bound for Buffer Management in Multi-Queue Switches. In Proc. of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms, pp.1295-1305 (2011).

[9] M. Bienkowski and A. Mardy. Geometric Aspects of Online Packet Buffering: An Optimal Randomized Algorithm for Two Buffers. In Proc. of the 8th Latin American Symposium on Theoretical Informatics, Lecture Notes in Computer Science ,4857 pp.252-263 (2008).

[10] A. Borodin and R. El-Yaniv. Online Computation and Competitive Analysis. Cambridge University Press (1998).

[11] M. Chrobak. Online Algorithms Column 13. ACM SIGACT News, 39(3), pp.96-121 (2008).

[12] Cisco Systems, Inc. Quality of Service (QoS). Internetworking Technology Handbook, Chapter 49, 2006.

[13] L. Epstein and R. van Stee. Buffer Management Problems. ACM SIGACT News, 35(3), pp.58-66 (2004).

[14] M.H. Goldwasser. A Survey of Buffer Management Policies for Packet Switches. ACM SIGACT News, 41(1), pp.100-128 (2010).

[15] T. Itoh and N. Takahashi. Competitive Analysis of Multi-Queue Preemptive QoS Algorithms for General Priorities. IEICE Trans. on Fundamentals of Electronics, Communications, and Computer Science, E89-A(5), pp.1186-1197 (2006).

[16] W. Jawor. Three Dozen Papers on Online Algorithms. ACM SIGACT News, Volume 36, Issue 1, pp.71-85 (2004).

18 references, page 1 of 2
Any information missing or wrong?Report an Issue