An optimal on-line algorithm for metrical task system
Journal of the ACM (JACM)
Online computation and competitive analysis
Online computation and competitive analysis
Tussle in cyberspace: defining tomorrow's internet
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
A solver for the network testbed mapping problem
ACM SIGCOMM Computer Communication Review
Measuring ISP topologies with rocketfuel
IEEE/ACM Transactions on Networking (TON)
Live wide-area migration of virtual machines including local persistent state
Proceedings of the 3rd international conference on Virtual execution environments
Rethinking virtual network embedding: substrate support for path splitting and migration
ACM SIGCOMM Computer Communication Review
OpenFlow: enabling innovation in campus networks
ACM SIGCOMM Computer Communication Review
A framework for virtual network embedding in wireless networks
CFI '09 Proceedings of the 4th International Conference on Future Internet Technologies
Proceedings of the 1st ACM workshop on Virtualized infrastructure systems and architectures
Network virtualization architecture: proposal and initial prototype
Proceedings of the 1st ACM workshop on Virtualized infrastructure systems and architectures
A virtual network mapping algorithm based on subgraph isomorphism detection
Proceedings of the 1st ACM workshop on Virtualized infrastructure systems and architectures
Enhancing dynamic cloud-based services using network virtualization
ACM SIGCOMM Computer Communication Review
A survey of network virtualization
Computer Networks: The International Journal of Computer and Telecommunications Networking
On the competitive ratio for online facility location
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Competitive analysis for service migration in VNets
Proceedings of the second ACM SIGCOMM workshop on Virtualized infrastructure systems and architectures
PolyViNE: policy-based virtual network embedding across multiple domains
Proceedings of the second ACM SIGCOMM workshop on Virtualized infrastructure systems and architectures
On the benefit of virtualization: strategies for flexible server allocation
Hot-ICE'11 Proceedings of the 11th USENIX conference on Hot topics in management of internet, cloud, and enterprise networks and services
Cost-aware live migration of services in the cloud
Hot-ICE'11 Proceedings of the 11th USENIX conference on Hot topics in management of internet, cloud, and enterprise networks and services
Online function tracking with generalized penalties
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
Competitive and deterministic embeddings of virtual networks
ICDCN'12 Proceedings of the 13th international conference on Distributed Computing and Networking
Optimizing Long-Lived CloudNets with Migrations
UCC '12 Proceedings of the 2012 IEEE/ACM Fifth International Conference on Utility and Cloud Computing
Traffic pattern based virtual network embedding
Proceedings of the 2013 workshop on Student workhop
Distributed Online Algorithms for the Agent Migration Problem in WSNs
Mobile Networks and Applications
The Wide-Area Virtual Service Migration Problem: A Competitive Analysis Approach
IEEE/ACM Transactions on Networking (TON)
Hi-index | 0.00 |
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 Quality-of-Service (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 identifies the major cost factors in such a system, and formalizes the corresponding optimization problem. Both randomized and deterministic, gravity center based online algorithms are presented which achieve a good tradeoff between improved QoS and migration cost in the worst-case, both for service migration within an infrastructure provider as well as for networks supporting cross-provider migration. We report on our simulation results and also present an explicit construction of an optimal offline algorithm which can be used, e.g., to evaluate the competitive ratio empirically.