Skip to Main content Skip to Navigation
Journal articles

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 (α > 1). We show that its randomized competitive ratio against an oblivious adversary is 1 + (α − 1)/(α 2 + α).
Document type :
Journal articles
Complete list of metadata

Cited literature [11 references]  Display  Hide  Download
Contributor : Christoph Dürr Connect in order to contact the contributor
Submitted on : Wednesday, November 18, 2020 - 5:52:49 PM
Last modification on : Friday, October 15, 2021 - 3:40:55 AM


Files produced by the author(s)




Christoph Dürr, Shahin Kamali. Randomized Two-Valued Bounded Delay Online Buffer Management. Operations Research Letters, Elsevier, 2021, 49 (2), pp.246-249. ⟨10.1016/j.orl.2021.01.010⟩. ⟨hal-02558500v2⟩



Record views


Files downloads