Optimal Algorithms for Page Migration in Dynamic Networks

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.


Published in:
Journal of Discrete Algorithms, 7, 4, 545-569
Year:
2009
Keywords:
Laboratories:




 Record created 2009-08-07, last modified 2018-03-17

n/a:
Download fulltext
PDF

Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)