DocumentCode
1978778
Title
Topology-aware virtual network embedding through bayesian network analysis
Author
Sude Qing ; Qi Qi ; Jingyu Wang ; Tong Xu ; Jianxin Liao
Author_Institution
State Key Lab. of Networking & Switching Technol., Beijing Univ. of Posts & Telecommun., Beijing, China
fYear
2012
fDate
3-7 Dec. 2012
Firstpage
2621
Lastpage
2627
Abstract
Multiple heterogenous virtual networks are given the ability to run on a shared infrastructure simultaneously as independent slices in the network virtualization environment. However, a major challenge is how to map multiple virtual networks, with specific node and link constraints, onto the shared substrate network, known as virtual network embedding problem. By taking topology attribute into account, topology-aware virtual network embedding algorithms efficiently improve the performance by leveraging a node ranking method based on Markov chain. However, as the basis of node ranking, the resource evaluation of node which is calculated as the product of its CPU and bandwidth may be incorrect. Moreover, a greedy matching strategy is always applied in the node mapping stage, which may lead to unnecessary bandwidth consumption by ignoring the relationships between the mapped substrate nodes and the mapping one. In this paper, we re-think the topology-aware virtual network embedding from a statistical perspective by proposing a statistical method to generate a dependency matrix representing the importance of every node and the relationships between every two nodes in the substrate network. Based on this dependency matrix, bayesian network analysis is leveraged to iteratively select the substrate node, with the closest relationship to the selected ones, to achieve node mapping process. Extensive simulations were conducted and the results show that our proposed algorithm has better performance in the long-term run.
Keywords
Internet; Markov processes; belief networks; virtual private networks; Bayesian network analysis; CPU; Internet architecture; Markov chain; bandwidth consumption; dependency matrix; greedy matching strategy; link constraints; multiple heterogenous virtual networks; network virtualization environment; node mapping process; node ranking method; resource evaluation; shared infrastructure; shared substrate network; statistical perspective; topology-aware virtual network embedding;
fLanguage
English
Publisher
ieee
Conference_Titel
Global Communications Conference (GLOBECOM), 2012 IEEE
Conference_Location
Anaheim, CA
ISSN
1930-529X
Print_ISBN
978-1-4673-0920-2
Electronic_ISBN
1930-529X
Type
conf
DOI
10.1109/GLOCOM.2012.6503512
Filename
6503512
Link To Document