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.
Nikolaos Geroliminis, Claudia Bongiovanni, Mor Kaspi
Katrin Beyer, Mahmoud S. M. Shaqfa