A 4/3-competitive randomized algorithm for online scheduling of packets with agreeable deadlines - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2010

A 4/3-competitive randomized algorithm for online scheduling of packets with agreeable deadlines

Abstract

In 2005 Li et al. gave a phi-competitive deterministic online algorithm for scheduling of packets with agreeable deadlines with a very interesting analysis. This is known to be optimal due to a lower bound by Hajek. We claim that the algorithm by Li et al. can be slightly simplified, while retaining its competitive ratio. Then we introduce randomness to the modified algorithm and argue that the competitive ratio against oblivious adversary is at most 4/3. Note that this still leaves a gap between the best known lower bound of 5/4 by Chin et al. for randomised algorithms against oblivious adversary.
Fichier principal
Vignette du fichier
jez-lukasz.pdf (215.71 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00455740 , version 1 (11-02-2010)

Identifiers

  • HAL Id : inria-00455740 , version 1

Cite

Łukasz Jeż. A 4/3-competitive randomized algorithm for online scheduling of packets with agreeable deadlines. 27th International Symposium on Theoretical Aspects of Computer Science - STACS 2010, Inria Nancy Grand Est & Loria, Mar 2010, Nancy, France. pp.489-500. ⟨inria-00455740⟩

Collections

STACS2010
46 View
48 Download

Share

Gmail Facebook X LinkedIn More