核心鏈路感知的可生存虛擬網(wǎng)絡(luò)鏈路保護(hù)方法

蘇玉澤; 孟相如; 康巧燕; 韓曉陽

doi:10.11999/JEIT180737

核心鏈路感知的可生存虛擬網(wǎng)絡(luò)鏈路保護(hù)方法

doi: 10.11999/JEIT180737

1.
空軍工程大學(xué)研究生院? ?西安? ?710051
2.
空軍工程大學(xué)信息與導(dǎo)航學(xué)院? ?西安? ?710077

基金項(xiàng)目: 國(guó)家自然科學(xué)基金(61401499)

詳細(xì)信息

作者簡(jiǎn)介:
蘇玉澤：男，1990年生，博士生，研究方向?yàn)樘摂M網(wǎng)絡(luò)映射、網(wǎng)絡(luò)生存性

孟相如：男，1963年生，教授，研究方向?yàn)橄乱淮W(wǎng)絡(luò)、網(wǎng)絡(luò)安全

康巧燕：女，1980年生，副教授，研究方向?yàn)榫W(wǎng)絡(luò)生存性、下一代網(wǎng)絡(luò)

韓曉陽：男，1986年生，博士生，研究方向?yàn)樘摂M網(wǎng)絡(luò)映射、網(wǎng)絡(luò)優(yōu)化

通訊作者:
蘇玉澤　glgiuip@163.com

中圖分類號(hào): TP393
計(jì)量
- 文章訪問數(shù): 1970
- HTML全文瀏覽量: 866
- PDF下載量: 62
- 被引次數(shù): 0
出版歷程
- 收稿日期: 2018-07-20
- 修回日期: 2019-01-31
- 網(wǎng)絡(luò)出版日期: 2019-03-16
- 刊出日期: 2019-07-01

Core Link Aware Survivable Virtual Network Link Protection Method

1.
Graduate College, Air Force Engineering University, Xi’an 710051, China
2.
Information and Navigation College, Air Force Engineering University, Xi’an 710077, China

Funds: The National Natural Science Foundation of China (61401499)

摘要

摘要: 針對(duì)現(xiàn)有可生存虛擬網(wǎng)絡(luò)鏈路保護(hù)方法無差別對(duì)待所有虛擬鏈路、備份資源消耗多且故障后網(wǎng)絡(luò)恢復(fù)時(shí)延長(zhǎng)的問題，該文提出一種核心鏈路感知的可生存虛擬網(wǎng)絡(luò)鏈路保護(hù)(CLA-SVNLP)方法。首先，綜合考慮虛擬鏈路動(dòng)態(tài)和靜態(tài)兩方面因素構(gòu)建虛擬鏈路核心度度量模型，依據(jù)虛擬網(wǎng)絡(luò)生存性需求，對(duì)核心度較高的虛擬鏈路進(jìn)行備份保護(hù)；其次，將p圈引入可生存虛擬網(wǎng)絡(luò)鏈路保護(hù)，依據(jù)虛擬網(wǎng)絡(luò)特點(diǎn)構(gòu)建p圈，為核心虛擬鏈路提供1:N保護(hù)，即每條核心虛擬鏈路平均消耗1/N條的備份鏈路帶寬資源以減少備份鏈路資源消耗，并將單物理鏈路保護(hù)問題轉(zhuǎn)化為多個(gè)p圈內(nèi)的單虛擬鏈路保護(hù)問題；最后網(wǎng)絡(luò)編碼技術(shù)與p圈結(jié)合，將備份鏈路對(duì)核心虛擬鏈路提供的1:N保護(hù)轉(zhuǎn)化為1+N保護(hù)，避免了故障后定位、檢測(cè)及數(shù)據(jù)重傳。仿真結(jié)果表明，該方法提高了備份資源利用率且縮短了故障后的網(wǎng)絡(luò)恢復(fù)時(shí)延。
- 可生存虛擬網(wǎng)絡(luò) /
- 鏈路保護(hù) /
- 核心鏈路感知 /
- p圈 /
- 網(wǎng)絡(luò)編碼
Abstract: In order to solve the problems of all virtual links take without discrimination, high backup resource consumption and long network recovery delay after failures in existing survivable virtual network link protection methods, a Core Link Aware Survivable Virtual Network Link Protection (CLA-SVNLP) method is proposed. At first, the core degree metric model of virtual link is constructed by considering virtual link dynamic and static factors. According to virtual network survivable needs, virtual links with high core degrees are protected by backup resources. Then the p-cycle is introduced into survivable virtual network link protection and the p-cycle is constructed based on the characteristics of virtual network to provide 1:N protection for core virtual links. That means each core virtual link consumes 1/N backup link bandwidth resources and the backup link resource consumption is reduced. It also transforms the single physical link protection into single virtual link protection in multiple p-cycles. At last, the network coding and p-cycle are both used to transform the 1:N protection into 1+N protection for core virtual links which avoids fault location, detection and data retransmission after failures. Simulation results show that the proposed method can improve the utilization of backup resource and shorten the network recovery delay after failures.
- Survivable virtual network /
- Link protection /
- Core link aware /
- P-cycle /
- Network coding

HTML全文

圖 1 基于p圈和網(wǎng)絡(luò)編碼的可生存虛擬網(wǎng)絡(luò)鏈路保護(hù)示例

下載: 全尺寸圖片幻燈片

圖 2 請(qǐng)求接受率比較

下載: 全尺寸圖片幻燈片

圖 3 長(zhǎng)期平均收益開銷比比較

下載: 全尺寸圖片幻燈片

圖 4 備份帶寬比比較

下載: 全尺寸圖片幻燈片

表 1 方法比較

方法名稱	方法描述
CLA-SVNLP	核心鏈路感知的可生存虛擬網(wǎng)絡(luò)鏈路保護(hù)方法
1+1保護(hù)^[8]	1+1的專有虛擬鏈路保護(hù)方法
SPA-BK^[9]	物理層預(yù)留備份資源的Shared Pre-Allocation共享機(jī)制
G-Coding^[14]	虛擬拓?fù)湓鰪?qiáng)且采用通用網(wǎng)絡(luò)編碼策略的共享機(jī)制

下載: 導(dǎo)出CSV

表 2 平均網(wǎng)絡(luò)恢復(fù)時(shí)延(ms)

算法名稱	$\mu $
算法名稱	0.05	0.10	0.15	0.20	0.25
CLA-SVNLP	2.10	2.20	2.18	2.16	2.14
G-Coding^[14]	2.11	2.18	2.25	2.27	2.26
SPA-BK^[9]	4.13	4.12	4.29	4.30	4.27
1+1保護(hù)^[8]	4.25	4.20	4.35	4.33	4.31

下載: 導(dǎo)出CSV

參考文獻(xiàn)(16)

LI Defang, HONG Peilin, XUE Kaiping, et al. Virtual network function placement considering resource optimization and SFC requests in cloud datacenter[J]. IEEE Transactions on Parallel and Distributed Systems, 2018, 29(7): 1664–1677. doi: 10.1109/TPDS.2018.2802518

MIJUMBI R, SERRAT J, GORRICHO J L, et al. Network function virtualization: State-of-the-art and research challenges[J]. IEEE Communications Surveys & Tutorials, 2016, 18(1): 236–262. doi: 10.1109/COMST.2015.2477041

趙志遠(yuǎn), 孟相如, 蘇玉澤, 等. 基于節(jié)點(diǎn)鄰近感知與路徑綜合評(píng)估的虛擬網(wǎng)絡(luò)映射算法[J]. 電子與信息學(xué)報(bào), 2017, 39(8): 1979–1985. doi: 10.11999/JEIT161252

ZHAO Zhiyuan, MENG Xiangru, SU Yuze, et al. Virtual network mapping algorithm based on node adjacent-awareness and path comprehensive evaluation[J]. Journal of Electronics &Information Technology, 2017, 39(8): 1979–1985. doi: 10.11999/JEIT161252

江逸茗, 馬海龍, 卜佑軍, 等. 面向收益最大化的虛擬網(wǎng)跨域映射策略[J]. 工程科學(xué)與技術(shù), 2018, 50(2): 118–125. doi: 10.15961/j.jsuese.201601266

JIANG Yiming, MA Hailong, BU Youjun, et al. Inter-domain virtual network embedding policy for revenue maximization[J]. Advanced Engineering Sciences, 2018, 50(2): 118–125. doi: 10.15961/j.jsuese.201601266

MARKOPOULOU A, IANNACCONE G, BHATTACHARYYA S, et al. Characterization of failures in an operational IP backbone network[J]. IEEE/ACM Transactions on Networking, 2008, 16(4): 749–762. doi: 10.1109/TNET.2007.902727

SHAHRIAR N, CHOWDHURY S R, AHMED R, et al. Virtual network survivability through joint spare capacity allocation and embedding[J]. IEEE Journal on Selected Areas in Communications, 2018, 36(3): 502–518. doi: 10.1109/JSAC.2018.2815430

KAMAL A E and AL-KOFAHI O. Efficient and agile 1+N protection[J]. IEEE Transactions on Communications, 2011, 59(1): 169–180. doi: 10.1109/TCOMM.2011.102910.090178

RAHMAN M R and BOUTABA R. 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

GUO Tao, WANG Ning, MOESSNER K, et al. Shared backup network provision for virtual network embedding[C]. Proceedings of 2011 IEEE International Conference on Communications, Kyoto, Japan, 2011: 1–5. doi: 10.1109/icc.2011.5963301.

LI Bin, LU Chao, QI Bing, et al. P-cycle based protection scheme with cycle multiplexing and capacity balance for multicast service in substation communication network[J]. International Journal of Electrical Power & Energy Systems, 2018, 102: 340–348. doi: 10.1016/j.ijepes.2018.04.038

JARRAY A and KARMOUCH A. Cost-efficient mapping for fault-tolerant virtual networks[J]. IEEE Transactions on Computers, 2015, 64(3): 668–681. doi: 10.1109/TC.2013.2295612

KAFAIE S, AHMED M H, CHEN Yuanzhu, et al. Performance analysis of network coding with IEEE 802.11 DCF in multi-hop wireless networks[J]. IEEE Transactions on Mobile Computing, 2018, 17(5): 1148–1161. doi: 10.1109/TMC.2017.2737422

HAI D T. On optimal designs of transparent WDM networks with 1+1 protection leveraged by all-optical XOR network coding schemes[J]. Optical Fiber Technology, 2018, 40: 93–100. doi: 10.1016/j.yofte.2017.11.009

WANG Zhiming, WU Jiangxing, and CHENG Dongnian. Coding-aware virtual network mapping for surviving single link failure[C]. Proceedings of 2014 IEEE International Conference on Communications, Sydney, Australia, 2014: 3025–3030. doi: 10.1109/ICC.2014.6883785.

梁寧寧, 蘭巨龍, 張震. 基于拓?fù)涓兄目芍貥?gòu)服務(wù)承載網(wǎng)動(dòng)態(tài)重構(gòu)算法[J]. 通信學(xué)報(bào), 2016, 37(2): 72–79. doi: 10.11959/j.issn.1000-436x.2016032

LIANG Ningning, LAN Julong, and ZHANG Zhen. Dynamic topology awareness-based reconfigurable service carrying network reconfiguration[J]. Journal on Communications, 2016, 37(2): 72–79. doi: 10.11959/j.issn.1000-436x.2016032

蘇玉澤, 孟相如, 孟慶微, 等. 環(huán)境自適應(yīng)的拓?fù)渎?lián)合感知虛擬網(wǎng)映射算法[J]. 電子與信息學(xué)報(bào), 2018, 40(1): 79–86. doi: 10.11999/JEIT170325

SU Yuze, MENG Xiangru, MENG Qingwei, et al. Environment adaptive and joint topology aware virtual network embedding algorithm[J]. Journal of Electronics &Information Technology, 2018, 40(1): 79–86. doi: 10.11999/JEIT170325

相關(guān)文章

施引文獻(xiàn)

資源附件(0)

訪問統(tǒng)計(jì)