An optimal randomized online algorithm for reordering buffer management

Noa Avigdor-Elgrabli, Yuval Rabani

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

17 Scopus citations

Abstract

We give an O(log log k)-competitive randomized online algorithm for reordering buffer management, where k is the buffer size. Our bound matches the lower bound of Adamaszek et al. (STOC 2011). Our algorithm has two stages which are executed online in parallel. The first stage computes deterministically a feasible fractional solution to an LP relaxation for reordering buffer management. The second stage "rounds" using randomness the fractional solution. The first stage is based on the online primal-dual schema, combined with a dual fitting charging scheme. As primal-dual steps and dual fitting steps are interleaved and in some sense conflicting, combining them is challenging. We also note that we apply the primal-dual schema to a relaxation with mixed packing and covering constraints. The first stage produces a fractional LP solution with cost within a factor of O(log log k) of the optimal LP cost. The second stage is an online algorithm that converts any LP solution to an integral solution, while increasing the cost by a constant factor. This stage generalizes recent results that gave a similar approximation guarantee using an offline rounding algorithm.

Original languageAmerican English
Title of host publicationProceedings - 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, FOCS 2013
Pages1-10
Number of pages10
DOIs
StatePublished - 2013
Event2013 IEEE 54th Annual Symposium on Foundations of Computer Science, FOCS 2013 - Berkeley, CA, United States
Duration: 27 Oct 201329 Oct 2013

Publication series

NameProceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
ISSN (Print)0272-5428

Conference

Conference2013 IEEE 54th Annual Symposium on Foundations of Computer Science, FOCS 2013
Country/TerritoryUnited States
CityBerkeley, CA
Period27/10/1329/10/13

Keywords

  • Online computing
  • Randomized algorithms
  • Reordering buffer management

Fingerprint

Dive into the research topics of 'An optimal randomized online algorithm for reordering buffer management'. Together they form a unique fingerprint.

Cite this