Virtual Network Embedding Algorithm Based on Regional Resource Clustering Index
Mao Yu-xing① Guo Yun-fei② Wang Zhi-ming② Hu Hong-chao②
①(Command Information System Institute, PLA University of Science and Technology, Nanjing 210007, China) ②(National Digital Switching System Engineering & Technology Research Center, Zhengzhou 450002, China)
Virtual network embedding is a critical issue in network virtualization. To overcome the ignorance of network local topology information in existing literatures, a Virtual Network Embedding (VNE) algorithm based on regional Resource Clustering Index (RCI-VNE), is proposed. In embedding preprocessing stage, a node regional resource clustering index evaluation algorithm is proposed, which considers local topology information and resource aggregation extent. In node embedding stage, a 2-adjacent aggregation node embedding algorithm based on the regional resource clustering index is also proposed. The algorithm embeds virtual nodes intensively to the location of abundant resources in substrate network and decreases embedding cost. Simulation results show that the algorithm improves virtual network request acceptance ratio, long-time average revenue and benefit-cost ratio compared with the existing embedding algorithms.
Turner J S and Taylor D. Diversifying the Internet[C]. Proceedings of IEEE Conference on Global Telecommunications, St. Louis, 2005: 755-760.
[2]
Anderson T, Peterson L, Shenker S, et al.. Overcoming the Internet impasse through virtualization[J]. IEEE Computer Magazine, 2005, 38(4): 34-41.
[3]
Andersen D G. Theoretical Approaches to Node Assignment [M]. New York: Computer Science Department, 2002: 86-123.
[4]
Zhang Y, Ammar M, et al.. Algorithm for assigning substrate network resources to virtual network components[C]. Proceedings of IEEE INFOCOM, Barcelona, 2006: 1-12.
[5]
Yu M, Yi Y, Rexford J, et al.. Rethinking virtual network embedding: substrate support for path splitting and migration[J]. ACM SIGCOMM Computer Communication Review, 2008, 38(2): 17-29.
[6]
Houidi I, Louati W, et al.. A distributed virtual network mapping algorithm[C]. IEEE International Conference on Communication, Beijing, 2008: 5634-5640.
[7]
Chowdhury M, Rahman M, et al.. ViNEYard: virtual network embedding algorithms with coordinated node and link mapping[J]. IEEE/ACM Transactions on Networking, 2012, 20(1): 206-219.
[8]
Melo M, Sargento S, Killat U, et al.. Optimal virtual network embedding: node-link formulation[J]. IEEE Transactions on Network and Service Management, 2013, 10(4): 356-368.
[9]
Lischka J, Karl H, et al.. A virtual network mapping algorithm based on subgraph isomorphism detection[C]. Proceedings of the 1st ACM Workshop on Virtualized Infrastructure Systems and Architectures, Barcelona, 2009: 81-88.
Jiang Yi-ming, Lan Ju-long, Cheng Dong-nian, et al.. Virtual network embedding algorithm based on negotiation in distributed environment[J]. Journal on Communications, 2014, 35(12): 62-69.
[13]
Gong L, Wen Y, Zhu Z, et al.. Toward profit-seeking virtual network embedding algorithm via global resource capacity[C]. Proceedings of IEEE INFOCOM, Toronto, 2014: 1-9.
[14]
Cui H, Gao W, Liu J, et al.. A virtual network embedding algorithm based on virtual topology connection feature[C]. IEEE 16th International Symposium on Wireless Personal Multimedia Communications, Atlantic City, 2013: 1-5.
[15]
Qing S, Liao J, Zhu X, et al.. Hybrid virtual network embedding with K-core decomposition and time-oriented priority[C]. IEEE International Conference on Communications, Ottawa, Canada, 2012: 2695-2699.
[16]
Huang T, Liu J, Chen J, et al.. A topology-cognitive algorithm framework for virtual network embedding problem [J]. Communications, China, 2014, 11(4): 73-84.
[17]
Cui H, Tang S, Huang X, et al.. A novel method of virtual network embedding based on topology convergence-degree[C]. IEEE International Conference on Communications Workshops, Budapest, 2013: 246-250.
[18]
Chen D, Lü L, Shang M S, et al.. Identifying influential nodes in complex networks[J]. Physica A: Statistical Mechanics and Its Applications, 2012, 391(4): 1777-1787.
[19]
Fagiolo G. Clustering in complex directed networks[J]. Physical Review E, 2007, 76(2): 470-475.
[20]
Zegura E, Calvert K, and Bhattacharjee S. How to model an Internetwork[C]. Proceedings of IEEE INFOCOM, Philadelphia, 1996: 594-602.
