Efficient Mapping of Virtual Networks onto a Shared Substrate

@inproceedings{Lu2006EfficientMO,
  title={Efficient Mapping of Virtual Networks onto a Shared Substrate},
  author={Jing Lu and Jonathan S. Turner},
  year={2006}
}
Virtualization has been proposed as a vehicle for overcoming the growing problem of internet ossification [1]. This paper studies the problem of mapping diverse virtual networks onto a common physical substrate. In particular, we develop a method for mapping a virtual network onto a substrate network in a cost-efficient way, while allocating sufficient capacity to virtual network links to ensure that the virtual network can handle any traffic pattern allowed by a general set of traffic… 
Virtual network mapping into heterogeneous substrate networks
TLDR
This paper proposes a heuristic algorithm for virtual resources mapping in the physical infrastructure that supports the heterogeneity of networks, in both links and nodes, and demonstrates its ability to embed a high percentage of the Virtual Network (VNet) requests respecting all links and node constraints.
Opportunistic Bandwidth Sharing for Virtual Network Mapping
TLDR
Two heuristic algorithms HA-I and HA-II, which consider the problem of assigning time slots to dispensable sub-flows with constraints on the performance guarantee and the objective of minimizing the number of time slots used, are presented, as an optimization problem.
Virtual Network Embedding with Coordinated Node and Link Mapping
TLDR
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.
Virtual Network Mapping - An Optimization Problem
TLDR
An integer linear programming formulation is proposed to solve the virtual network embedding problem, as a simultaneous optimization of virtual nodes and links placement, providing the optimal boundary for each virtual network mapping.
Minimizing bottleneck nodes of a substrate in virtual network embedding
TLDR
This paper focuses on mapping the VNs in such a way that node resources in the substrate are not completely exhausted, and an approach referred to as bottleneck node reduced mapping is presented.
Introducing the Virtual Network Mapping Problem with Delay, Routing and Location Constraints
TLDR
The main goal was to include VNMP-DRL instances which are as realistic as possible, a goal met by using parts of real network topologies to model the physical networks and by using different classes of virtual networks to model possible use-cases, instead of relying on random graphs.
Survivable Mapping of Virtual Networks onto a Shared Substrate Network
TLDR
The author devises two kinds of algorithms for solving the survivable virtual network mapping (SVNM) problem efficiently and shows that the algorithms can be used to balance the tradeoff between time efficiency and mapping cost.
Rethinking virtual network embedding: substrate support for path splitting and migration
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.
Virtual Network Embedding with Opportunistic Resource Sharing
TLDR
An opportunistic resource sharing-based mapping framework, ORS, where substrate resources are opportunistically shared among multiple virtual networks, and it is proved that ORS provides a more efficient utilization of substrate resources than two state-of-the-art fixed-resource embedding schemes.
Network Virtualization strategy based on Paths Algebra to implement the concept of Infrastructure as a Service
TLDR
A virtual link mapping approach supporting multiple constraints using the “paths algebra” routing framework is introduced that can help solve the multiple multi- constraint routing problems of VNE.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 13 REFERENCES
Algorithms for Assigning Substrate Network Resources to Virtual Network Components
  • Yong Zhu, M. Ammar
  • Business, Computer Science
    Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications
  • 2006
TLDR
This paper develops a basic scheme as a building block for all other advanced algorithms of the VN assignment problem and develops a selective VN reconfiguration scheme that prioritizes the reconfigurations of the most critical VNs.
A solver for the network testbed mapping problem
TLDR
The design, implementation, and evaluation of a solver for this problem, which is in production use on the Netbed shared network testbed, builds on simulated annealing to find very good solutions in a few seconds for the historical workload, and scales gracefully on large well-connected synthetic topologies.
A flexible model for resource management in virtual private networks
TLDR
A new service interface is proposed, termed a hose, to provide the appropriate performance abstraction to manage network resources in the face of increased uncertainty, and the statistical multiplexing and resizing techniques deal effectively with uncertainties about the traffic.
Approximation algorithms for configuring nonblocking communication networks
TLDR
It is shown that if the network nodes are capable of supporting multicast connections without blocking, then the entire network can also, and generalize this method of specifying the traffic for larger networks, in which groups of nodes can be organized into clusters with high traffic among nodes within the clusters, but less traffic between nodes in different clusters.
Designing Least-Cost Nonblocking Broadband Networks
TLDR
This paper proposes a new model for broadband networks and investigates the question of their optimal topology from a worst-case performance point of view, and shows that a minimum-cost nonblockingstarnetwork achieves near-optimal cost.
Resource configuration and network design in extensible networks
TLDR
This dissertation presents a general method, called layered network, for the problem of configuring application sessions that require intermediate processing and generalizes the constraint-based network design methods originally developed for conventional networks for designing extensible networks.
PlanetLab: an overlay testbed for broad-coverage services
TLDR
This paper discribes the initial implementation of PlanetLab, including the mechanisms used to impelment virtualization, and the collection of core services used to manage PlanetLab.
Constraint based design of ATM networks, an experimental study
TLDR
A novel network design tool is used, implemented in Java, to design representative networks joining major U.S. cities, and the cost of three topologies, Best Star, Minimum Spanning Tree, and Delaunay Triangulation, are compared.
Designing Minimum Cost Nonblocking Communication Networks
TLDR
This paper addresses the problem of topological design of ATM and similar com munication networks from a worst case point of view seeking network designs that subject to speci ed constraints are nonblocking for point to point and multicast virtual circuits.
Diversifying the Internet
TLDR
A detailed exposition of the diversified Internet concept, how it can address the problem of network ossification and some of the technical challenges that must be met to turn the vision into reality are provided.
...
1
2
...