Skip to main content

Online Packet Switching

  • Conference paper
Approximation and Online Algorithms (WAOA 2004)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3351))

Included in the following conference series:

Abstract

We discuss packet switching for single-queue, multi-queue buffers and CIOQ buffers. We evaluate the algorithms by competitive analysis. We also mention the zero-one principle that applies to general switching networks.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aiello, W., Ostrovsky, R., Kushilevitz, E., Rosén, A.: Dynamic routing on networks with fixed-size buffers. In: Proc. 14th ACM-SIAM Symp. on Discrete Algorithms, pp. 771–780 (2003)

    Google Scholar 

  2. Aiello, W.A., Mansour, Y., Rajagopolan, S., Rosén, A.: Competitive queue policies for differentiated services. In: Proceedings of the IEEE INFOCOM 2000, pp. 431–440 (2000)

    Google Scholar 

  3. Albers, S., Schmidt, M.: On the performance of greedy algorithms in packet buffering. In: Proc. 36th ACM Symp. on Theory of Computing, pp. 35–44 (2004)

    Google Scholar 

  4. Andelman, N., Mansour, Y., Zhu, A.: Competitive queueing policies for QoS switches. In: Proc. 14th ACM-SIAM Symp. on Discrete Algorithms, pp. 761–770 (2003)

    Google Scholar 

  5. Andrews, M., Awerbuch, B., Fernández, A., Kleinberg, J., Leighton, T., Liu, Z.: Universal stability results for greedy contention-resolution protocols. In: Proc. 37th IEEE Symp. on Found. of Comp. Science, pp. 380–389 (1996)

    Google Scholar 

  6. Azar, Y., Litichevskey, M.: Maximizing throughput in multi-queue switches. In: Proc. 12th Annual European Symposium on Algorithms, pp. 53–64 (2004)

    Google Scholar 

  7. Azar, Y., Richter, Y.: Management of multi-queue switches in QoS networks. In: Proc. 35th ACM Symp. on Theory of Computing, pp. 82–89 (2003)

    Google Scholar 

  8. Azar, Y., Richter, Y.: An improved algorithm for CIOQ switches. In: Proc. 12th Annual European Symposium on Algorithms, pp. 65–76 (2004)

    Google Scholar 

  9. Azar, Y., Richter, Y.: The zero-one principle for switching networks. In: Proc. 36th ACM Symp. on Theory of Computing, pp. 64–71 (2004)

    Google Scholar 

  10. Bansal, N., Fleischer, L., Kimbrel, T., Mahdian, M., Schieber, B., Sviridenko, M.: Further improvements in competitive guarantees for QoS buffering. In: Proc. 31st International Colloquium on Automata, Languages, and Programming, pp. 196–207 (2004)

    Google Scholar 

  11. Birman, A., Gail, H.R., Hantler, S.L., Rosberg, Z., Sidi, M.: An optimal service policy for buffer systems. Journal of the Association Computing Machinery (JACM) 42(3), 641–657 (1995)

    MATH  MathSciNet  Google Scholar 

  12. Borodin, A., Kleinberg, J., Raghavan, P., Sudan, M., Williamson, D.: Adversarial queuing theory. In: Proc. 28th ACM Symp. on Theory of Computing, pp. 376–385 (1996)

    Google Scholar 

  13. Kesselman, A., Lotker, Z., Mansour, Y., Patt-Shamir, B., Schieber, B., Sviridenko, M.: Buffer overflow management in QoS switches. In: Proc. 33rd ACM Symp. on Theory of Computing, pp. 520–529 (2001)

    Google Scholar 

  14. Kesselman, A., Mansour, Y.: Loss-bounded analysis for differentiated services. In: Proc. 12th ACM-SIAM Symp. on Discrete Algorithms, pp. 591–600 (2001)

    Google Scholar 

  15. Kesselman, A., Mansour, Y., van Stee, R.: Improved competitive guarantees for QoS buffering. In: Proc. 11th Annual European Symposium on Algorithms, pp. 361–372 (2003)

    Google Scholar 

  16. Kesselman, A., Rosén, A.: Scheduling policies for CIOQ switches. In: Proceedings of the 15th Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 353–362 (2003)

    Google Scholar 

  17. Lotker, Z., Patt-Shamir, B.: Nearly optimal fifo buffer management for diffserv. In: Proc. 21st ACM Symp. on Principles of Distrib. Computing, pp. 134–143 (2002)

    Google Scholar 

  18. May, M., Bolot, J.C., Jean-Marie, A., Diot, C.: Simple performance models of differentiated services for the internet. In: Proceedings of the IEEE INFOCOM 1999, pp. 1385–1394 (1999)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Azar, Y. (2005). Online Packet Switching. In: Persiano, G., Solis-Oba, R. (eds) Approximation and Online Algorithms. WAOA 2004. Lecture Notes in Computer Science, vol 3351. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31833-0_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-31833-0_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-24574-2

  • Online ISBN: 978-3-540-31833-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics