環(huán)境自適應的拓撲聯(lián)合感知虛擬網(wǎng)映射算法

蘇玉澤; 孟相如; 孟慶微; 趙志遠

doi:10.11999/JEIT170325

環(huán)境自適應的拓撲聯(lián)合感知虛擬網(wǎng)映射算法

doi: 10.11999/JEIT170325 cstr: 32379.14.JEIT170325

基金項目:

國家自然科學基金(61401499)

計量
- 文章訪問數(shù): 1465
- HTML全文瀏覽量: 168
- PDF下載量: 158
- 被引次數(shù): 0
出版歷程
- 收稿日期: 2017-04-13
- 修回日期: 2017-09-12
- 刊出日期: 2018-01-19

Environment Adaptive and Joint Topology Aware Virtual Network Embedding Algorithm

Funds:

The National Natural Science Foundation of China (61401499)

摘要

摘要: 針對虛擬網(wǎng)映射算法環(huán)境適應度低、拓撲關(guān)聯(lián)性較差且映射開銷較大的問題，該文提出一種環(huán)境自適應的拓撲聯(lián)合感知虛擬網(wǎng)映射算法。首先提出一種加權(quán)相對熵排序方法對具有多指標的節(jié)點進行量化處理，依環(huán)境變化賦予節(jié)點指標不同的權(quán)值；在虛擬節(jié)點排序階段采用加權(quán)相對熵和廣度優(yōu)先搜索算法雙重排序，物理節(jié)點排序中引入就近度與加權(quán)相對熵算法配合使用，實現(xiàn)了對虛擬拓撲和物理拓撲的聯(lián)合感知；最后利用k-最短路徑算法完成虛擬鏈路映射。仿真結(jié)果表明，該算法依據(jù)環(huán)境變化自適應調(diào)整指標權(quán)值，提高了虛擬網(wǎng)映射成功率和收益開銷比。
- 虛擬網(wǎng) /
- 映射算法 /
- 環(huán)境自適應 /
- 拓撲聯(lián)合感知 /
- 加權(quán)相對熵方法
Abstract: In order to solve the problem of low environmental adaptability, poor topology correlation and large embedding cost in virtual network embedding algorithms, an environment adaptive and joint topology aware virtual network embedding algorithm is proposed. At first, a ranking method of weighted relative entropy is proposed to quantify the nodes with multi-index and the weights are changed according to different environment. The weighted relative entropy and breadth first search algorithm are both used in virtual node ranking phase, the nearest degree is introduced into physical node ranking and all these are used to achieve the joint awareness to the virtual topology and physical topology. Finally, the k-shortest path algorithm is introduced into virtual link embedding. Simulation results show that the proposed algorithm can improve the acceptance radio and the revenue to cost ratio by adjusting the weights according to the environment.
- Virtual network /
- Embedding algorithm /
- Environment adaptive /
- Joint topology aware /
- Weighted relative entropy method

HTML全文

參考文獻(23)

MUNTASIR R R and RAOUF B. SVNE: Survivable virtual network embedding algorithms for network virtualization[J]. IEEE Transactions on Network and Service Management, 2013, 10(2): 105-118. doi: 10.1109/TNSM.2013.013013. 110202.

MD M, NASHID S, REAZ A, et al. Multi-path link embedding for survivability in virtual networks[J]. IEEE Transactions on Network and Service Management, 2016, 13(2): 253-266. doi: 10.1109/TNSM.2016.2558598.

JIANG Huihui, WANG Yixiang, GONG Long, et al. Availability-aware survivable virtual network embedding in optical datacenter networks[J]. Journal of Optical Communications and Networking, 2015, 7(12): 1160-1171. doi: 10.1364/JOCN.7.001160.

程祥, 張忠寶, 蘇森, 等. 虛擬網(wǎng)絡映射問題研究綜述[J]. 通信學報, 2011, 32(10): 143-151.

CHENG Xiang, ZHANG Zhongbao, SU Sen, et al. Survey of virtual network embedding problem[J]. Journal on Communications, 2011, 32(10): 143-151.

LISCHKA J and KARL H. A virtual network mapping algorithm based on subgraph isomorphism detection[C]. Proceedings of the 1st ACM Workshop on Virtualized Infrastructure Systems and Architectures, Barcelona, Spain, 2009: 81-88.

CHENG X, SU S, ZHANG Z, et al. Virtual network embedding through topology-aware node ranking[J]. ACM SIGCOMM Computer Communication Review, 2011, 41(2): 39-47.

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): 19-29.

LEONARD N, TAISIR E H, El-G, et al. Energy efficient virtual network embedding for cloud networks[J]. Journal of Lightwave Technology, 2015, 33(9): 1828-1849. doi: 10.1109/ JLT.2014.2380777.

常磊, 顧華璽, 張之義, 等. 一種粒子群優(yōu)化的用戶優(yōu)先級虛擬網(wǎng)絡映射算法[J]. 西安電子科技大學學報(自然科學版), 2015, 42(1): 16-22. doi: 10.3969/j.issn.1001-2400.2015.01.003.

CHANG Lei, GU Huaxi, ZHANG Zhiyi, et al. Particle swarm optimization user-priority virtual network embedding algorithm[J]. Journal of Xidian University, 2015, 42(1): 16-22. doi: 10.3969/j.issn.1001-2400.2015.01.003.

SUN G, YU H, ANAND V, et al. A cost efficient framework and algorithm for embedding dynamic virtual network requests[J]. Future Generation Computer Systems, 2013, 29(5): 1265-1277. doi: 10.1016/j.future.2012.08.002.

王子厚, 韓言妮, 林濤, 等. 可重構(gòu)網(wǎng)絡中基于中心度與拓撲勢排序的資源分配算法[J]. 通信學報, 2012, 33(8): 10-20.

WANG Zihou, HAN Yanni, LIN Tao, et al. Resource allocation algorithms in the reconfigurable network based on network centrality and topology potential[J]. Journal on Communications, 2012, 33(8): 10-20.

毛宇星, 郭云飛, 王志明, 等. 基于資源區(qū)域聚集度的虛擬網(wǎng)映射算法[J]. 電子與信息學報, 2015, 37(10): 2405-2410. doi: 10.11999/JEIT150278.

MAO Yuxing, GUO Yunfei, WANG Zhiming, et al. Virtual network embedding algorithm based on regional resource clustering index[J]. Journal of Electronics Information Technology, 2015, 37(10): 2405-2410. doi: 10.11999/ JEIT150278.

CUI H Y, GAO W J, LIU J, et al. A virtual network embedding algorithm based on virtual topology connection feature[C]. 2013 16th International Symposium on Wireless Personal Multimedia Communications, New Jersey, USA, 2013: 1-5.

龔水清, 陳靖, 黃聰會, 等. 信任感知的安全虛擬網(wǎng)絡映射算法[J]. 通信學報, 2015, 36(11): 180-189. doi: 10.11959/j.issn. 1000-436x.2015272.

GONG Shuiqing, CHEN Jing, HUANG Conghui, et al. Trust-aware secure virtual network embedding algorithm[J]. Journal on Communications, 2015, 36(11): 180-189. doi: 10.11959/j.issn.1000-436x.2015272.

趙萌, 邱菀華, 劉北上. 基于相對熵的多屬性決策排序方法[J]. 控制與決策, 2010, 25(7): 1098-1100.

ZHAO Meng, QIU Wanhua, and LIU Beishang. Relative entropy evaluation method for multiple attribute decision making[J]. Control and Decision, 2010, 25(7): 1098-1100.

蔡志平, 劉強, 呂品, 等. 虛擬網(wǎng)絡映射模型及其優(yōu)化算法[J]. 軟件學報, 2012, 23(4): 864-877.

CAI Zhiping, LIU Qiang, L Pin, et al. Virtual network mapping model and optimization algorithms[J]. Journal of Software, 2012, 23(4): 864-877.

相關(guān)文章

施引文獻

資源附件(0)

訪問統(tǒng)計