Abstract
We consider the problem of buffering unit value data packets in multi-queue network switches where each of the switch’s input ports is equipped with a buffer of limited capacity. At these ports, packets arrive online and can be stored within the space limitations or must be discarded. Our objective is the maximization of the number of forwarded packets where, per time step, at most one packet from the set of buffers can be transmitted to the output port.
In this paper, we give a technique for transforming any randomized algorithm for unit buffers into a randomized algorithm for buffers with arbitrary capacities while maintaining the competitiveness. We present the first randomized online algorithm that beats the deterministic lower bound of e/(e – 1) ≈ 1.58. It is 3/2-competitive and thus nearly matches the randomized lower bound of 1.46. For buffers with 2 queues having large capacities, we show a lower bound of 16/13 ≈ 1.23 for any online algorithm and prove that the competitive ratio of greedy algorithms is 9/7 ≈ 1.29, improving the best previously known upper bound of 3/2.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aiello, W., Mansour, Y., Rajagopolan, S., Rosén, A.: Competitive queue policies for differentiated services. In: Proc. INFOCOM, pp. 431–440 (2000)
Albers, S., Schmidt, M.: On the performance of greedy algorithms in packet buffering. In: Proc. 36th ACM Symposium on Theory of Computing, pp. 35–44 (2004)
Andelman, N., Mansour, Y., Zhu, A.: Competitive queueing policies in QoS switches. In: Proc. 14th ACM-SIAM Symposium on Discrete Algorithms, pp. 761–770 (2003)
Azar, Y., Richter, Y.: Management of multi-queue switches in QoS Networks. In: Proc. 35th ACM Symposium on Theory of Computing, pp. 82–89 (2003)
Azar, Y., Richter, Y.: The zero-one principle for switching networks. In: Proc. 36th ACM Symposium on Theory of Computing, pp. 64–71 (2004)
Aziz, A., Prakash, A., Ramachandran, V.: A new optimal scheduler for switch-memory-switch routers. In: Proc. 15th Annual ACM Symposium on Parallelism in Algorithms and Architectures, pp. 343–352 (2003)
Bansal, N., Fleischer, L.K., Kimbrel, T., Mahdian, M., Schieber, B., Sviridenko, M.: Further Improvements in Competitive Guarantees for QoS Buffering. In: Díaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 196–207. Springer, Heidelberg (2004)
Bar-Noy, A., Freund, A., Landa, S., Naor, J.: Competitive on-line switching policies. In: Proc. 13th ACM-SIAM Symposium on Discrete Algorithms, pp. 525–534 (2002)
Hahne, E.L., Kesselman, A., Mansour, Y.: Competitive buffer management for shared-memory switches. In: Proc. 13th ACM Symposium on Parallel Algorithms and Architectures, pp. 53–58 (2001)
Kesselman, A., Lotker, Z., Mansour, Y., Patt-Shamir, B., Schieber, B., Sviridenko, M.: Buffer overflow management in QoS switches. In: Proc. 31st ACM Symposium on Theory of Computing, pp. 520–529 (2001)
Kesselman, A., Mansour, Y.: Loss-bounded analysis for differentiated services. In: Proc. 12th ACM-SIAM Symposium on Discrete Algorithms, pp. 591–600 (2001)
Kesselman, A., Mansour, Y., van Stee, R.: Improved competitive guarantees for QoS buffering. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol. 2832, pp. 361–372. Springer, Heidelberg (2003)
Kesselman, A., Rosén, A.: Scheduling policies for CIOQ switches. In: Proc. 15th Annual ACM Symposium on Parallelism in Algorithms and Architectures, pp. 353–361 (2003)
Koga, H.: Balanced scheduling towards loss-free packet queueing and delay fairness. In: Eades, P., Takaoka, T. (eds.) ISAAC 2001. LNCS, vol. 2223, pp. 61–73. Springer, Heidelberg (2001)
Sleator, D.D., Tarjan, R.E.: Amortized efficiency of list update and paging rules. Communications of the ACM 28, 202–208 (1985)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Schmidt, M. (2005). Packet Buffering: Randomization Beats Deterministic Algorithms. In: Diekert, V., Durand, B. (eds) STACS 2005. STACS 2005. Lecture Notes in Computer Science, vol 3404. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31856-9_24
Download citation
DOI: https://doi.org/10.1007/978-3-540-31856-9_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24998-6
Online ISBN: 978-3-540-31856-9
eBook Packages: Computer ScienceComputer Science (R0)