Randomized Algorithm for Agreeable Deadlines Packet Scheduling

Jez, Lukasz

doi:10.4230/LIPIcs.STACS.2010.2479

Document

Randomized Algorithm for Agreeable Deadlines Packet Scheduling

Author Lukasz Jez

Part of: Volume: 27th International Symposium on Theoretical Aspects of Computer Science (STACS 2010)
Part of: Series: Leibniz International Proceedings in Informatics (LIPIcs)
Part of: Conference: Symposium on Theoretical Aspects of Computer Science (STACS)
License: Creative Commons Attribution-NoDerivs 3.0 Unported license
Publication Date: 2010-03-09

PDF

File

PDF

LIPIcs.STACS.2010.2479.pdf

Filesize: 300 kB
12 pages

Document Identifiers

DOI: 10.4230/LIPIcs.STACS.2010.2479
URN: urn:nbn:de:0030-drops-24795

Subject Classification

Keywords

Online algorithms
scheduling
buffer management

Metrics

Access Statistics
Total Accesses (updated on a weekly basis)

0

PDF Downloads

0

Metadata Views

Abstract

In 2005 Li~et~al. gave a \(\phi\)-competitive deterministic online algorithm for scheduling of packets with agreeable deadlines~\cite{DBLP:conf/soda/LiSS05} with a very interesting analysis. This is known to be optimal due to a lower bound by Hajek~\cite{Hajek-det-lb}. 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 (\frac{4}{3}\). Note that this still leaves a gap between the best known lower bound of \(\frac{5}{4}\) by Chin~et~al.~\cite{DBLP:journals/algorithmica/ChinF03} for randomized algorithms against oblivious adversary.

Cite As Get BibTex

Lukasz Jez. Randomized Algorithm for Agreeable Deadlines Packet Scheduling. In 27th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 5, pp. 489-500, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010) https://doi.org/10.4230/LIPIcs.STACS.2010.2479

Author Details

Lukasz Jez

Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail