DocumentCode
3169552
Title
VNA: An Enhanced Algorithm for Virtual Network Embedding
Author
Masti, Sarang Bharadwaj ; Raghavan, S.V.
Author_Institution
Dept. of Comput. Sci. & Eng., Indian Inst. of Technol. Madras, Chennai, India
fYear
2012
fDate
July 30 2012-Aug. 2 2012
Firstpage
1
Lastpage
9
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.
Keywords
Internet; VN request acceptance ratio; VNA; VNE; enhanced algorithm; link mapping phase; network virtualization; node mapping; residual capacity; substrate resources; virtual link; virtual network embedding; Algorithm design and analysis; Bandwidth; Complexity theory; Internet; Resource management; Substrates;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Communications and Networks (ICCCN), 2012 21st International Conference on
Conference_Location
Munich
Print_ISBN
978-1-4673-1543-2
Type
conf
DOI
10.1109/ICCCN.2012.6289180
Filename
6289180
Link To Document