Randomized Two-Valued Bounded Delay Online Buffer Management
Abstract
In the bounded delay buffer management problem unit size packets arrive online to be sent over a network link. The objective is to maximize the total weight of packets sent before their deadline. In this paper we are interested in the two-valued variant of the problem, where every packet has either low (1) or high priority weight ($\alpha$ > 1). We show that its randomized competitive ratio against an oblivious adversary is 1 + ($\alpha$ -- 1)/($\alpha$ 2 + $\alpha$).
- Publication:
-
arXiv e-prints
- Pub Date:
- April 2020
- DOI:
- 10.48550/arXiv.2004.14715
- arXiv:
- arXiv:2004.14715
- Bibcode:
- 2020arXiv200414715D
- Keywords:
-
- Computer Science - Data Structures and Algorithms