Skip to main content
Springer Nature Link
Log in

One to Rule Them All: A General Randomized Algorithm for Buffer Management with Bounded Delay

  • Conference paper
Algorithms – ESA 2011 (ESA 2011)

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

Included in the following conference series:

  • 2680 Accesses

Abstract

We give a memoryless scale-invariant randomized algorithm Mix-R for buffer management with bounded delay that is e/(e − 1)-competitive against an adaptive adversary, together with better performance guarantees for many restricted variants, including the s-bounded instances. In particular, Mix-R attains the optimum competitive ratio of 4/3 on 2-bounded instances.

Both Mix-R and its analysis are applicable to a more general problem, called Item Collection, in which only the relative order between packets’ deadlines is known. Mix-R is the optimal memoryless randomized algorithm against adaptive adversary for that problem in a strong sense.

While some of the provided upper bounds were already known, in general, they were attained by several different algorithms.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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.

Similar content being viewed by others

References

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

    Google Scholar 

  2. Azar, Y.: Online packet switching. In: Persiano, G., Solis-Oba, R. (eds.) WAOA 2004. LNCS, vol. 3351, pp. 1–5. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  3. Ben-David, S., Borodin, A., Karp, R.M., Tardos, G., Wigderson, A.: On the power of randomization in online algorithms. Algorithmica 11(1), 2–14 (1994); also appeared in Proc. of the 22nd STOC, pp. 379–386 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  4. Bienkowski, M., Chrobak, M., Dürr, C., Hurand, M., Jeż, A., Jeż, Ł., Stachowiak, G.: Collecting weighted items from a dynamic queue. In: Proc. of the 20th ACM-SIAM Symp. on Discrete Algorithms (SODA), pp. 1126–1135 (2009)

    Google Scholar 

  5. Bienkowski, M., Chrobak, M., Jeż, Ł.: Randomized algorithms for buffer management with 2-bounded delay. In: Bampis, E., Skutella, M. (eds.) WAOA 2008. LNCS, vol. 5426, pp. 92–104. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  6. Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, Cambridge (1998)

    MATH  Google Scholar 

  7. Chin, F.Y.L., Chrobak, M., Fung, S.P.Y., Jawor, W., Sgall, J., Tichý, T.: Online competitive algorithms for maximizing weighted throughput of unit jobs. Journal of Discrete Algorithms 4, 255–276 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  8. Chin, F.Y.L., Fung, S.P.Y.: Online scheduling for partial job values: Does timesharing or randomization help? Algorithmica 37, 149–164 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  9. Chrobak, M., Jawor, W., Sgall, J., Tichý, T.: Improved online algorithms for buffer management in QoS switches. ACM Transactions on Algorithms 3(4) (2007); also appeared in Proc. of the 12th ESA, pp. 204–215 (2004)

    Google Scholar 

  10. Englert, M., Westermann, M.: Considering suppressed packets improves buffer management in QoS switches. In: Proc. of the 18th ACM-SIAM Symp. on Discrete Algorithms (SODA), pp. 209–218 (2007)

    Google Scholar 

  11. Epstein, L., van Stee, R.: Buffer management problems. Sigact News 35, 58–66 (2004)

    Google Scholar 

  12. Goldwasser, M.: A survey of buffer management policies for packet switches. SIGACT News 41(1), 100–128 (2010)

    Article  Google Scholar 

  13. Hajek, B.: On the competitiveness of online scheduling of unit-length packets with hard deadlines in slotted time. In: Conference in Information Sciences and Systems, pp. 434–438 (2001)

    Google Scholar 

  14. Jeż, Ł.: Randomised buffer management with bounded delay against adaptive adversary. CoRR abs/0907.2050 (2009)

    Google Scholar 

  15. Jeż, Ł.: Randomized algorithm for agreeable deadlines packet scheduling. In: Proc. of the 27th Symp. on Theoretical Aspects of Computer Science (STACS), pp. 489–500 (2010)

    Google Scholar 

  16. Kesselman, A., Lotker, Z., Mansour, Y., Patt-Shamir, B., Schieber, B., Sviridenko, M.: Buffer overflow management in QoS switches. SIAM Journal on Computing 33(3), 563–583 (2004); also appeared in Proc.of the 33rd STOC, pp 520–529, (2001)

    Article  MathSciNet  MATH  Google Scholar 

  17. Li, F., Sethuraman, J., Stein, C.: An optimal online algorithm for packet scheduling with agreeable deadlines. In: Proc. of the 16th ACM-SIAM Symp. on Discrete Algorithms (SODA), pp. 801–802 (2005)

    Google Scholar 

  18. Zhu, A.: Analysis of queueing policies in QoS switches. Journal of Algorithms 53(2), 137–168 (2004)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Computer Science, University of Wrocław, ul. Joliot-Curie 15, 50-383, Wrocław, Poland

    Łukasz Jeż

Authors
  1. Łukasz Jeż
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dipartimento di Informatica e Sistemistica, University of Rome " La Sapienza", via Ariosto 25, 00185, Roma, Italy

    Camil Demetrescu

  2. School of Computer Science, Reykjavik University, Menntavegur 1, 101, Reykjavik, Iceland

    Magnús M. Halldórsson

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jeż, Ł. (2011). One to Rule Them All: A General Randomized Algorithm for Buffer Management with Bounded Delay. In: Demetrescu, C., Halldórsson, M.M. (eds) Algorithms – ESA 2011. ESA 2011. Lecture Notes in Computer Science, vol 6942. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23719-5_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-23719-5_21

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-23718-8

  • Online ISBN: 978-3-642-23719-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics