Online Strategies for Intra and Inter Provider Service Migration in Virtual Networks
Dushyant Arora, Marcin Bienkowski, Anja Feldmann, Gregor Schaffrath,, Stefan Schmid

TL;DR
This paper explores online algorithms for service migration in virtual networks, balancing QoS improvements with migration costs, supported by simulations and competitive analysis.
Contribution
It introduces new online algorithms with provable guarantees for intra- and inter-provider service migration in virtual networks.
Findings
Proposed algorithms achieve good tradeoffs between QoS and migration costs.
Simulation results validate the effectiveness of the algorithms.
Constructed an optimal offline algorithm for benchmarking.
Abstract
Network virtualization allows one to build dynamic distributed systems in which resources can be dynamically allocated at locations where they are most useful. In order to fully exploit the benefits of this new technology, protocols need to be devised which react efficiently to changes in the demand. This paper argues that the field of online algorithms and competitive analysis provides useful tools to deal with and reason about the uncertainty in the request dynamics, and to design algorithms with provable performance guarantees. As a case study, we describe a system (e.g., a gaming application) where network virtualization is used to support thin client applications for mobile devices to improve their QoS. By decoupling the service from the underlying resource infrastructure, it can be migrated closer to the current client locations while taking into account migration cost. This paper…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsOptimization and Search Problems · Cloud Computing and Resource Management · Caching and Content Delivery
