One to Rule Them All: A General Randomized Algorithm for Buffer Management with Bounded Delay
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.
KeywordsCompetitive Ratio Online Algorithm Deterministic Algorithm Packet Schedule Adversary Model
Unable to display preview. Download preview PDF.
- 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
- 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
- 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
- 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
- 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