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

Łukasz Jeż 1, *
* Corresponding author
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.
Document type :
Conference papers
Complete list of metadatas

https://hal.inria.fr/inria-00455740
Contributor : Publications Loria <>
Submitted on : Thursday, February 11, 2010 - 9:49:52 AM
Last modification on : Thursday, February 11, 2010 - 9:57:31 AM
Long-term archiving on : Friday, June 18, 2010 - 8:08:41 PM

File

jez-lukasz.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00455740, version 1

Collections

Citation

Ł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⟩

Share

Metrics

Record views

128

Files downloads

71