Randomized Two-Valued Bounded Delay Online Buffer Management - Archive ouverte HAL Access content directly
Journal Articles Operations Research Letters Year : 2021

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 + α).
Fichier principal
Vignette du fichier
bounded_delay_1a.pdf (128.35 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02558500 , version 1 (29-04-2020)
hal-02558500 , version 2 (18-11-2020)

Identifiers

Cite

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

Altmetric

Share

Gmail Facebook X LinkedIn More