Journal ArticleDOI
Rethinking virtual network embedding: substrate support for path splitting and migration
Minlan Yu,Yung Yi,Jennifer Rexford,Mung Chiang +3 more
- Vol. 38, Iss: 2, pp 17-29
TLDR
This paper simplifies virtual link embedding by allowing the substrate network to split a virtual link over multiple substrate paths and employing path migration to periodically re-optimize the utilization of the substrates network.Abstract:
Network virtualization is a powerful way to run multiple architectures or experiments simultaneously on a shared infrastructure. However, making efficient use of the underlying resources requires effective techniques for virtual network embedding--mapping each virtual network to specific nodes and links in the substrate network. Since the general embedding problem is computationally intractable, past research restricted the problem space to allow efficient solutions, or focused on designing heuristic algorithms. In this paper, we advocate a different approach: rethinking the design of the substrate network to enable simpler embedding algorithms and more efficient use of resources, without restricting the problem space. In particular, we simplify virtual link embedding by: i) allowing the substrate network to split a virtual link over multiple substrate paths and ii) employing path migration to periodically re-optimize the utilization of the substrate network. We also explore node-mapping algorithms that are customized to common classes of virtual-network topologies. Our simulation experiments show that path splitting, path migration,and customized embedding algorithms enable a substrate network to satisfy a much larger mix of virtual networksread more
Citations
More filters
Journal ArticleDOI
A survey of network virtualization
TL;DR: The existing technologies and a wide array of past and state-of-the-art projects on network virtualization are surveyed followed by a discussion of major challenges in this area.
Journal ArticleDOI
Virtual Network Embedding: A Survey
TL;DR: A survey of current research in the Virtual Network Embedding (VNE) area is presented and a taxonomy of current approaches to the VNE problem is provided and opportunities for further research are discussed.
Proceedings ArticleDOI
Virtual Network Embedding with Coordinated Node and Link Mapping
TL;DR: This paper formulate the VN em- bedding problem as a mixed integer program through substrate network augmentation, and devise two VN embedding algo- rithms D-ViNE and R- ViNE using deterministic and randomized rounding techniques, respectively.
Proceedings ArticleDOI
Towards predictable datacenter networks
TL;DR: The case for extending the tenant-provider interface to explicitly account for the network is made, and the design of virtual network abstractions that capture the trade-off between the performance guarantees offered to tenants, their costs and the provider revenue are proposed.
Journal ArticleDOI
Resource Allocation in NFV: A Comprehensive Survey
TL;DR: This paper presents a comprehensive state of the art of NFV-RA by introducing a novel classification of the main approaches that pose solutions to solve the NFV resource allocation problem.
References
More filters
Journal ArticleDOI
Optimization by Simulated Annealing
TL;DR: There is a deep and useful connection between statistical mechanics and multivariate or combinatorial optimization (finding the minimum of a given function depending on many parameters), and a detailed analogy with annealing in solids provides a framework for optimization of very large and complex systems.
Book
Network Flows: Theory, Algorithms, and Applications
TL;DR: In-depth, self-contained treatments of shortest path, maximum flow, and minimum cost flow problems, including descriptions of polynomial-time algorithms for these core models are presented.
Proceedings ArticleDOI
How to model an internetwork
TL;DR: This work considers the problem of efficiently generating graph models that accurately reflect the topological properties of real internetworks, and proposes efficient methods for generating topologies with particular properties, including a transit-stub model that correlates well with the internet structure.
Journal ArticleDOI
The power of two choices in randomized load balancing
TL;DR: This work uses a limiting, deterministic model representing the behavior as n/spl rarr//spl infin/ to approximate the behavior of finite systems and provides simulations that demonstrate that the method accurately predicts system behavior, even for relatively small systems.
Journal ArticleDOI
Finding the k Shortest Paths
TL;DR: K shortest paths are given for finding the k shortest paths connecting a pair of vertices in a digraph, and applications to dynamic programming problems including the knapsack problem, sequence alignment, maximum inscribed polygons, and genealogical relationship discovery are described.