{"@context":"https:\/\/schema.org\/","@type":"ScholarlyArticle","@id":"#article6698","name":"Randomized Algorithm for Agreeable Deadlines Packet Scheduling","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.","keywords":["Online algorithms","scheduling","buffer management"],"author":{"@type":"Person","name":"Jez, Lukasz","givenName":"Lukasz","familyName":"Jez"},"position":43,"pageStart":489,"pageEnd":500,"dateCreated":"2010-03-09","datePublished":"2010-03-09","isAccessibleForFree":true,"license":"https:\/\/creativecommons.org\/licenses\/by-nd\/3.0\/legalcode","copyrightHolder":{"@type":"Person","name":"Jez, Lukasz","givenName":"Lukasz","familyName":"Jez"},"copyrightYear":"2010","accessMode":"textual","accessModeSufficient":"textual","creativeWorkStatus":"Published","inLanguage":"en-US","sameAs":"https:\/\/doi.org\/10.4230\/LIPIcs.STACS.2010.2479","publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","isPartOf":{"@type":"PublicationVolume","@id":"#volume6208","volumeNumber":5,"name":"27th International Symposium on Theoretical Aspects of Computer Science","dateCreated":"2010-03-09","datePublished":"2010-03-09","editor":[{"@type":"Person","name":"Marion, Jean-Yves","givenName":"Jean-Yves","familyName":"Marion"},{"@type":"Person","name":"Schwentick, Thomas","givenName":"Thomas","familyName":"Schwentick"}],"isAccessibleForFree":true,"publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","hasPart":"#article6698","isPartOf":{"@type":"Periodical","@id":"#series116","name":"Leibniz International Proceedings in Informatics","issn":"1868-8969","isAccessibleForFree":true,"publisher":"Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik","hasPart":"#volume6208"}}}