Proceedings ArticleDOI
VNA: An Enhanced Algorithm for Virtual Network Embedding
Sarang Bharadwaj Masti,S. V. Raghavan +1 more
- pp 1-9
Reads0
Chats0
TLDR
VNA, an algorithm for VNE that achieves high VN request acceptance ratio while balancing the load across the network, takes into account the residual capacity of links in the substrate network during node mapping, thereby reducing the possibility of failure during the link mapping phase.Abstract:
Network virtualization enables the co-existence of multiple virtual networks (VNs) on the same substrate network by sharing the available resources. One of the major challenges in network virtualization is the efficient allocation of substrate resources to the VNs - a problem known as Virtual Network Embedding(VNE). In this paper, we propose VNA, an algorithm for VNE that achieves high VN request acceptance ratio while balancing the load across the network. VNA, takes into account the residual capacity of links in the substrate network during node mapping, thereby reducing the possibility of failure during the link mapping phase. For mapping the virtual links, VNA identifies a set of low utilization paths along which resources have to be reserved for the virtual links. Simulation results show that VNA achieves high request acceptance ratio, outperforming many of the existing algorithms for VNE.read more
Citations
More filters
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.
Journal ArticleDOI
Generating Virtual Network Embedding Problems With Guaranteed Solutions
Andreas Fischer,Hermann de Meer +1 more
TL;DR: A novel scenario generation approach is presented and it is demonstrated how to produce scenarios with a guaranteed exact solution, thereby, facilitating better evaluation of embedding algorithms.
Journal ArticleDOI
Secure virtual network embedding with flexible bandwidth-based revenue maximization
TL;DR: This paper proposes a virtual network embedding problem that ensures that the virtual networks of conflicting operators are mapped to different physical equipments and enables the virtual links to select among a range of discrete bandwidth values, each with a corresponding price and thereby realizing any possible revenue function.
Proceedings ArticleDOI
A virtual network embedding algorithm based on mapping tree
TL;DR: This paper proposes a new virtual network mapping algorithm based on a mapping tree on nodes mapping phase, which has a good performance in the acceptance ratio of virtual network requests, and the average revenue of substrate network.
Proceedings Article
An efficient virtual network embedding algorithm with delay constraints
TL;DR: This paper proposes an algorithm (VNE-DC) based on multi-agent approach to embed virtual networks onto a substrate network with delay constraints that can achieve an excellent performance in average bandwidth cost, and guarantee the accept ratio at the same time.
References
More filters
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
A new approach to the maximum-flow problem
TL;DR: An alternative method based on the preflow concept of Karzanov, which runs as fast as any other known method on dense graphs, achieving an O(n) time bound on an n-vertex graph and faster on graphs of moderate density.
Proceedings ArticleDOI
A new approach to the maximum flow problem
TL;DR: By incorporating the dynamic tree data structure of Sleator and Tarjan, a version of the algorithm running in O(nm log(n'/m)) time on an n-vertex, m-edge graph is obtained, as fast as any known method for any graph density and faster on graphs of moderate density.
Journal ArticleDOI
Rethinking virtual network embedding: substrate support for path splitting and migration
TL;DR: 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.
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.