License
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ICALP.2017.13
URN: urn:nbn:de:0030-drops-73942
URL: http://drops.dagstuhl.de/opus/volltexte/2017/7394/
Go to the corresponding LIPIcs Volume Portal


Bienkowski, Marcin ; Byrka, Jaroslaw ; Mucha, Marcin

Dynamic Beats Fixed: On Phase-Based Algorithms for File Migration

pdf-format:
LIPIcs-ICALP-2017-13.pdf (0.6 MB)


Abstract

In this paper, we construct a deterministic 4-competitive algorithm for the online file migration problem, beating the currently best 20-year old, 4.086-competitive MTLM algorithm by Bartal et al. (SODA 1997). Like MTLM, our algorithm also operates in phases, but it adapts their lengths dynamically depending on the geometry of requests seen so far. The improvement was obtained by carefully analyzing a linear model (factor-revealing LP) of a single phase of the algorithm. We also show that if an online algorithm operates in phases of fixed length and the adversary is able to modify the graph between phases, no algorithm can beat the competitive ratio of 4.086.

BibTeX - Entry

@InProceedings{bienkowski_et_al:LIPIcs:2017:7394,
  author =	{Marcin Bienkowski and Jaroslaw Byrka and Marcin Mucha},
  title =	{{Dynamic Beats Fixed: On Phase-Based Algorithms for File Migration}},
  booktitle =	{44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
  pages =	{13:1--13:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-041-5},
  ISSN =	{1868-8969},
  year =	{2017},
  volume =	{80},
  editor =	{Ioannis Chatzigiannakis and Piotr Indyk and Fabian Kuhn and Anca Muscholl},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2017/7394},
  URN =		{urn:nbn:de:0030-drops-73942},
  doi =		{10.4230/LIPIcs.ICALP.2017.13},
  annote =	{Keywords: file migration, factor-revealing linear programs, online algorithms, competitive analysis}
}

Keywords: file migration, factor-revealing linear programs, online algorithms, competitive analysis
Seminar: 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)
Issue Date: 2017
Date of publication: 06.07.2017


DROPS-Home | Fulltext Search | Imprint Published by LZI