Skip to main content
SpringerLink
Log in

Buffer Management for Colored Packets with Deadlines

  • Published:
Theory of Computing Systems Aims and scope Submit manuscript

Abstract

We consider buffer management of unit packets with deadlines for a multi-port device with reconfiguration overhead. The goal is to maximize the throughput of the device, i.e., the number of packets delivered by their deadline. For a single port or with free reconfiguration, the problem reduces to the well-known packets scheduling problem, where the celebrated earliest-deadline-first (EDF) strategy is optimal 1-competitive. However, EDF is not 1-competitive when there is a reconfiguration overhead. We design an online algorithm that achieves a competitive ratio of 1−o(1) when the ratio between the minimum laxity of the packets and the number of ports tends to infinity. This is one of the rare cases where one can design an almost 1-competitive algorithm. One ingredient of our analysis, which may be interesting on its own right, is a perturbation theorem on EDF for the classical packets scheduling problem. Specifically, we show that a small perturbation in the release and deadline times cannot significantly degrade the optimal throughput. This implies that EDF is robust in the sense that its throughput is close to the optimum even when the deadlines are not precisely known.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Aiello, W., Mansour, Y., Rajagopolan, S., Rosén, A.: Competitive queue policies for differentiated services. J. Algorithms 55(2), 113–141 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  2. Andelman, N., Mansour, Y.: Competitive management of non-preemptive queues with multiple values. In: Proceedings 17th International Conference on Distributed Computing, pp. 166–180 (2003)

    Google Scholar 

  3. Andelman, N., Mansour, Y., Zhu, A.: Competitive queueing policies for qos switches. In: Proceedings 14th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 761–770 (2003)

    Google Scholar 

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

    Chapter  Google Scholar 

  5. Bar-Yehuda, R., Laserson, J.: Exploiting locality: Approximating sorting buffers. J. Discrete Algorithms 5(4), 729–738 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  6. Bartal, Y., Chin, F.Y.L., Chrobak, M., Fung, S.P.Y., Jawor, W., Lavi, R., Sgall, J., Tichý, T.: Online competitive algorithms for maximizing weighted throughput of unit jobs. In: Proceedings 21st Annual Symposium on Theoretical Aspects of Computer Science, pp. 187–198 (2004)

    Google Scholar 

  7. Bienkowski, M., Chrobak, M., Dürr, C., Hurand, M., Jez, A., Jez, L., Stachowiak, G.: Collecting weighted items from a dynamic queue. In: Proceedings 20th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1126–1135 (2009)

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  9. 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. J. Discrete Algorithms 4(2), 255–276 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  10. Chrobak, M., Jawor, W., Sgall, J., Tichý, T.: Improved online algorithms for buffer management in qos switches. ACM Trans. Algorithms 3(4) (2007)

  11. Crescenzi, P., Deng, X., Papadimitriou, C.H.: On approximating a scheduling problem. J. Comb. Optim. 5(3), 287–297 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  12. Dolev, S., Keizelman, A.: Non-preemptive real-time scheduling of multimedia tasks. Real-Time Syst. 17(1), 23–39 (1999)

    Article  Google Scholar 

  13. Englert, M., Westermann, M.: Reordering buffer management for non-uniform cost models. In: Proceedings 32nd International Colloquium on Automata, Languages and Programming, pp. 627–638 (2005)

    Chapter  Google Scholar 

  14. Englert, M., Westermann, M.: Lower and upper bounds on fifo buffer management in qos switches. In: Proceedings 14th Annual European Symposium on Algorithms, pp. 352–363 (2006)

    Google Scholar 

  15. Englert, M., Westermann, M.: Considering suppressed packets improves buffer management in qos switches. In: Proceedings 18th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 209–218 (2007)

    Google Scholar 

  16. Englert, M., Räcke, H., Westermann, M.: Reordering buffers for general metric spaces. In: Proceedings 39th Annual ACM Symposium on Theory of Computing, pp. 556–564 (2007)

    Google Scholar 

  17. Englert, M., Röglin, H., Westermann, M.: Evaluation of online strategies for reordering buffers. In: Proceedings 5th International Workshop on Experimental Algorithms, pp. 183–194 (2006)

    Google Scholar 

  18. Fiat, A., Mansour, Y., Nadav, U.: Competitive queue management for latency sensitive packets. In: Proceedings 19th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 228–237 (2008)

    Google Scholar 

  19. Gamzu, I., Segev, D.: Improved online algorithms for the sorting buffer problem. In: Proceedings 24th Annual Symposium on Theoretical Aspects of Computer Science, pp. 658–669 (2007)

    Google Scholar 

  20. Garey, M.R., Johnson, D.S.: Complexity results for multiprocessor scheduling under resource constraints. SIAM J. Comput. 4(4), 397–411 (1975)

    Article  MathSciNet  MATH  Google Scholar 

  21. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New York (1979)

    MATH  Google Scholar 

  22. Gopal, I.S., Wong, C.K.: Minimizing the number of switchings in an ss/tdma system. IEEE Trans. Commun. 33(6), 497–501 (1985)

    Article  Google Scholar 

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

    Google Scholar 

  24. Kesselman, A., Lotker, Z., Mansour, Y., Patt-Shamir, B., Schieber, B., Sviridenko, M.: Buffer overflow management in qos switches. SIAM J. Comput. 33(3), 563–583 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  25. Kesselman, A., Mansour, Y., van Stee, R.: Improved competitive guarantees for qos buffering. Algorithmica 43(1–2), 63–80 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  26. Khandekar, R., Pandit, V.: Offline sorting buffers on line. In: Proceedings 17th International Symposium on Algorithms and Computation, pp. 81–89 (2006)

    Google Scholar 

  27. Khandekar, R., Pandit, V.: Online sorting buffers on line. In: Proceedings 23rd Annual Symposium on Theoretical Aspects of Computer Science, pp. 584–595 (2006)

    Google Scholar 

  28. Kohrt, J.S., Pruhs, K.: A constant approximation algorithm for sorting buffers. In: Proceedings 6th Latin American Symposium on Theoretical Informatics, pp. 193–202 (2004)

    Google Scholar 

  29. Lee, C.J., Mutlu, O., Narasiman, V., Patt, Y.N.: Prefetch-aware DRAM controllers. In: Proceedings 41st Annual IEEE/ACM International Symposium on Microarchitecture, pp. 200–209 (2008)

    Chapter  Google Scholar 

  30. Li, X., Hamdi, M.: On scheduling optical packet switches with reconfiguration delay. IEEE J. Sel. Areas Commun. 21(7), 1156–1164 (2003)

    Article  Google Scholar 

  31. Li, F., Sethuraman, J., Stein, C.: An optimal online algorithm for packet scheduling with agreeable deadlines. In: Proceedings 16th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 801–802 (2005)

    Google Scholar 

  32. Li, F., Sethuraman, J., Stein, C.: Better online buffer management. In: Proceedings 18th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 199–208 (2007)

    Google Scholar 

  33. Lotker, Z., Patt-Shamir, B.: Nearly optimal fifo buffer management for two packet classes. Comput. Netw. 42(4), 481–492 (2003)

    Article  MATH  Google Scholar 

  34. Mutlu, O., Moscibroda, T.: Stall-time fair memory access scheduling for chip multiprocessors. In: Proceedings 40th Annual IEEE/ACM International Symposium on Microarchitecture, pp. 146–160 (2007)

    Google Scholar 

  35. Räcke, H., Sohler, C., Westermann, M.: Online scheduling for sorting buffers. In: Proceedings 10th Annual European Symposium on Algorithms, pp. 820–832 (2002)

    Google Scholar 

  36. Rixner, S., Dally, W.J., Kapasi, U.J., Mattson, P.R., Owens, J.D.: Memory access scheduling. In: Proceedings 27th Annual International Symposium on Computer Architecture, pp. 128–138 (2000)

    Google Scholar 

  37. Schmidt, M.: Packet buffering: Randomization beats deterministic algorithms. In: Proceedings 22nd Annual Symposium on Theoretical Aspects of Computer Science, pp. 293–304 (2005)

    Google Scholar 

  38. Yao, A.: Probabilistic computations: Toward a unified measure of complexity. In: Proceedings 18th Annual IEEE Symposium on Foundations of Computer Science, pp. 222–227 (1977)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Blavatnik School of Computer Science, Tel-Aviv University, Tel-Aviv, 69978, Israel

    Yossi Azar

  2. Department of Computer Science and Applied Mathematics, The Weizmann Institute, Rehovot, 76100, Israel

    Uriel Feige

  3. Microsoft R&D Center, Herzliya, 46725, Israel

    Iftah Gamzu

  4. Microsoft Research, One Microsoft Way, Redmond, WA, 98052, USA

    Thomas Moscibroda

  5. College of Computing, Georgia Institute of Technology, Atlanta, GA, USA

    Prasad Raghavendra

Authors
  1. Yossi Azar
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Uriel Feige
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Iftah Gamzu
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Thomas Moscibroda
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Prasad Raghavendra
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Iftah Gamzu.

Additional information

An extended abstract of this paper appeared in Proceedings of the 21st Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 319–327, 2009.

Y. Azar was partially supported by the Israeli Science Foundation (grant No. 1404/10).

Rights and permissions

Reprints and permissions

About this article

Cite this article

Azar, Y., Feige, U., Gamzu, I. et al. Buffer Management for Colored Packets with Deadlines. Theory Comput Syst 49, 738–756 (2011). https://doi.org/10.1007/s00224-011-9346-3

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00224-011-9346-3

Keywords

Search

Navigation