Optimal Bounds for Online Page Migration with Generalized Migration Costs

Optimal Bounds for Online Page Migration with Generalized Migration Costs

Abstract

This paper attends to a generalized version of the classic page migration problem where migration costs are not necessarily given by the migration distance only, but may depend on prior migrations, or on the available bandwidth along the migration path. Interestingly, this problem cannot be viewed from a Metrical Task System (MTS) perspective, despite the generality of MTS: The corresponding MTS has an unbounded state space and, thus, an unbounded competitive ratio. Nevertheless, we are able to present an optimal online algorithm for a wide range of problem variants, improving the best upper bounds known so far for more specific problems. For example, we present a tight bound of Θ(log n/ log log n) for the competitive ratio of the virtual server migration problem introduced recently

Grafik Top
Authors
  • Schneider, Johannes
  • Schmid, Stefan
Grafik Top
Supplemental Material
Shortfacts
Category
Paper in Conference Proceedings or in Workshop Proceedings (Paper)
Event Title
32nd IEEE Conference on Computer Communications (INFOCOM)
Divisions
Communication Technologies
Subjects
Informatik Allgemeines
Event Location
Turin, Italy
Event Type
Conference
Event Dates
April 2013
Date
2013
Export
Grafik Top