An optimal on-line algorithm for metrical task system
Journal of the ACM (JACM)
Randomized algorithms for metrical task systems
Theoretical Computer Science
Online computation and competitive analysis
Online computation and competitive analysis
Introduction to algorithms
Better Algorithms for Unfair Metrical Task Systems and Applications
SIAM Journal on Computing
A solver for the network testbed mapping problem
ACM SIGCOMM Computer Communication Review
Live wide-area migration of virtual machines including local persistent state
Proceedings of the 3rd international conference on Virtual execution environments
OpenFlow: enabling innovation in campus networks
ACM SIGCOMM Computer Communication Review
Multi-dimensional online tracking
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
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
Competitive analysis for service migration in VNets
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
Minimum congestion mapping in a cloud
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Online strategies for intra and inter provider service migration in virtual networks
IPTcomm '11 Proceedings of the 5th International Conference on Principles, Systems and Applications of IP Telecommunications
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
Online algorithms for geographical load balancing
IGCC '12 Proceedings of the 2012 International Green Computing Conference (IGCC)
Optimizing Long-Lived CloudNets with Migrations
UCC '12 Proceedings of the 2012 IEEE/ACM Fifth International Conference on Utility and Cloud Computing
Hi-index | 0.00 |
Today's trend toward network virtualization and software-defined networking enables flexible new distributed systems where resources can be dynamically allocated and migrated to locations where they are most useful. This paper proposes a competitive analysis approach to design and reason about online algorithms that find a good tradeoff between the benefits and costs of a migratable service. A competitive online algorithm provides worst-case performance guarantees under any demand dynamics, and without any information or statistical assumptions on the demand in the future. This is attractive especially in scenarios where the demand is hard to predict and can be subject to unexpected events. As a case study, we describe a service (e.g., an SAP server or a gaming application) that uses network virtualization to improve the quality of service (QoS) experienced by thin client applications running on mobile devices. By decoupling the service from the underlying resource infrastructure, it can be migrated closer to the current client locations while taking into account migration costs. We identify the major cost factors in such a system and formalize the wide-area service migration problem. Our main contributions are a randomized and a deterministic online algorithm that achieve a competitive ratio of $O(\log {n})$ in a simplified scenario, where $n$ is the size of the substrate network. This is almost optimal. We complement our worst-case analysis with simulations in different specific scenarios and also sketch a migration demonstrator.