Optimal algorithms for page migration in dynamic networks

Authors:
Marcin Bienkowski;Jaroslaw Byrka;Miroslaw Korzeniowski;Friedhelm Meyer Auf Der Heide
Affiliations:
Institute of Computer Science, University of Wroclaw, ul. Joliot-Curie 15, 50-383 Wroclaw, Poland;CWI, P.O. Box 94079, 1090 GB Amsterdam, The Netherlands and Eindhoven University of Technology, P.O. Box 513, 5600 MB Eindhoven, The Netherlands;Institute of Mathematics and Computer Science, Wroclaw University of Technology, ul. Wybrzeze Wyspianskiego 27, 50-370 Wroclaw, Poland;Heinz Nixdorf Institute and Computer Science Department, University of Paderborn, Fürstenallee 11, Paderborn, Germany
Venue:
Journal of Discrete Algorithms
Year:
2009

Citing 21
Cited 1

Amortized efficiency of list update and paging rules

Communications of the ACM
Competitive algorithms for distributed data management

Journal of Computer and System Sciences - Special issue on selected papers presented at the 24th annual ACM symposium on the theory of computing (STOC '92)
Page migration algorithms using work functions

Journal of Algorithms
A better lower bound on the competitive ratio of the randomized 2-server problem

Information Processing Letters
Online computation and competitive analysis

Online computation and competitive analysis
New on-line algorithms for the page replication problem

Journal of Algorithms
Distributed paging for general networks

Journal of Algorithms
Competitive On-Line Algorithms for Distributed Data Management

SIAM Journal on Computing
On page migration and other relaxed task systems

Theoretical Computer Science
Online algorithms for page replication in rings

Theoretical Computer Science
Topology control and routing in ad hoc networks: a survey

ACM SIGACT News
Lower and Upper Bounds for the Problem of Page Replication in Ring Networks

MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
Models and Techniques for Communication in Dynamic Networks

STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
New results for online page replication

APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
Distributed Paging

Developments from a June 1996 seminar on Online algorithms: the state of the art
Fighting against two adversaries: page migration in dynamic networks

Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Dynamic page migration with stochastic requests

Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Bucket game with applications to set multicover and dynamic page migration

ESA'05 Proceedings of the 13th annual European conference on Algorithms
Page migration in dynamic networks

MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Dynamic page migration under brownian motion

Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
Improved algorithms for dynamic page migration

STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science

Power-aware online file allocation in mobile ad hoc networks: [extended abstract]

Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present an extension of a classical data management subproblem, the page migration. The problem is investigated in dynamic networks, where costs of communication between different nodes may change with time. We construct asymptotically optimal online algorithms for this problem, both in deterministic and randomized scenarios.