On the power of randomization in online algorithms
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Online computation and competitive analysis
Online computation and competitive analysis
Buffer overflow management in QoS switches
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Competitive queueing policies for QoS switches
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Analysis of queueing policies in QoS switches
Journal of Algorithms
An optimal online algorithm for packet scheduling with agreeable deadlines
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Considering suppressed packets improves buffer management in QoS switches
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Improved online algorithms for buffer management in QoS switches
ACM Transactions on Algorithms (TALG)
Collecting weighted items from a dynamic queue
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Randomized Algorithms for Buffer Management with 2-Bounded Delay
Approximation and Online Algorithms
A survey of buffer management policies for packet switches
ACM SIGACT News
WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
Online scheduling of packets with agreeable deadlines
ACM Transactions on Algorithms (TALG)
Open problems in throughput scheduling
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Catch them if you can: how to serve impatient users
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
| Hi-index | 0.00 |
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.