Optimal bounds for online page migration with generalized migration costs

Schneider, Johannes; Schmid, Stefan

doi:10.1109/infcom.2013.6566990

Cited by 2 publications

(1 citation statement)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, the work is only a comprehensive extension to the authors' previous results with the single server migration as the focus. They showed that for the service migration problem (single server), there does not exist any online algorithm whose competitive ratio is smaller than Ω(log n/ log log n) [3], [15]. But they did not further improve the bound for multiple server co-migration in their previous results in [16].…”

Section: Introductionmentioning

confidence: 99%

Virtual Servers Co-Migration for Mobile Accesses: Online versus Off-Line

Wang

Shi

2015

IEEE Trans. on Mobile Comput.

View full text Add to dashboard Cite

In this paper, we study the problem of co-migrating a set of service replicas residing on one or more redundant virtual servers in clouds in order to satisfy a sequence of mobile batch-request demands in a cost effective way. With such a migration, we can not only reduce the service access latency for end users but also minimize the network costs for service providers. The co-migration can be achieved at the cost of bulk-data transfer and increases the overall monetary costs for the service providers. To gain the benefits of service migration while minimizing the overall costs, we propose a co-migration algorithm Migk for multiple servers, each hosting a service replicas. Migk is a randomized algorithm with a competitive cost of O() to migrate κ services in a static n-node network where γ is the maximal ratio of the migration costs between any pair of neighbor nodes in the network, and where λ and µ represent the maximum wired transmission cost and the wireless link cost respectively. For comparison, we also study this problem in its static off-line form by proposing a parallel dynamic programming (hereafter DP) based algorithm that integrates the branch&bound strategy with sampling techniques in order to approximate the optimal DP results. We validate the advantage of the proposed algorithms via extensive simulation studies using various requests patterns and cloud network topologies. Our simulation results show that the proposed algorithms can effectively adapt to mobile access patterns to satisfy the service request sequences in a cost-effective way.

show abstract

Section: Introductionmentioning

confidence: 99%