一级黄色片免费播放|中国黄色视频播放片|日本三级a|可以直接考播黄片影视免费一级毛片

高級搜索

留言板

尊敬的讀者、作者、審稿人, 關(guān)于本刊的投稿、審稿、編輯和出版的任何問題, 您可以本頁添加留言。我們將盡快給您答復(fù)。謝謝您的支持!

姓名
郵箱
手機號碼
標(biāo)題
留言內(nèi)容
驗證碼

基于災(zāi)難預(yù)測多區(qū)域故障的虛擬光網(wǎng)絡(luò)生存性映射

劉煥淋 杜理想 陳勇 王展鵬

劉煥淋, 杜理想, 陳勇, 王展鵬. 基于災(zāi)難預(yù)測多區(qū)域故障的虛擬光網(wǎng)絡(luò)生存性映射[J]. 電子與信息學(xué)報, 2020, 42(7): 1710-1717. doi: 10.11999/JEIT190561
引用本文: 劉煥淋, 杜理想, 陳勇, 王展鵬. 基于災(zāi)難預(yù)測多區(qū)域故障的虛擬光網(wǎng)絡(luò)生存性映射[J]. 電子與信息學(xué)報, 2020, 42(7): 1710-1717. doi: 10.11999/JEIT190561
Huanlin LIU, Lixiang DU, Yong CHEN, Zhanpeng WANG. Disaster Prediction-based Survivable Virtual Optical Network Mapping for Multi-Area Faults[J]. Journal of Electronics & Information Technology, 2020, 42(7): 1710-1717. doi: 10.11999/JEIT190561
Citation: Huanlin LIU, Lixiang DU, Yong CHEN, Zhanpeng WANG. Disaster Prediction-based Survivable Virtual Optical Network Mapping for Multi-Area Faults[J]. Journal of Electronics & Information Technology, 2020, 42(7): 1710-1717. doi: 10.11999/JEIT190561

基于災(zāi)難預(yù)測多區(qū)域故障的虛擬光網(wǎng)絡(luò)生存性映射

doi: 10.11999/JEIT190561 cstr: 32379.14.JEIT190561
基金項目: 國家自然科學(xué)基金(51977021);重慶市自然科學(xué)基金面上項目(2019jcyj-msxmX0613)
詳細信息
    作者簡介:

    劉煥淋:女,1970年生,教授,研究方向為光通信技術(shù)與未來網(wǎng)絡(luò)

    杜理想:男,1995年生,碩士,研究方向為光網(wǎng)絡(luò)生存性路由算法

    陳勇:男,1963年生,教授,研究方向為光通信技術(shù)、傳感檢測與自動化技術(shù)

    王展鵬:男,1996年生,碩士,研究方向為光網(wǎng)絡(luò)生存性調(diào)度算法

    通訊作者:

    劉煥淋 liuhl2@sina.com

  • 中圖分類號: TN929.11

Disaster Prediction-based Survivable Virtual Optical Network Mapping for Multi-Area Faults

Funds: The National Natural Science Foundation of China (51977021), The Natural Science Foundation Project of Chongqing Science and Technology Commission (2019 jcyj-msxmX0613)
  • 摘要:

    生存性虛擬光網(wǎng)絡(luò)映射是提高光網(wǎng)絡(luò)應(yīng)對災(zāi)難故障的重要技術(shù)保障措施。為解決災(zāi)難性多區(qū)域故障導(dǎo)致彈性光網(wǎng)絡(luò)的帶寬容量損失問題,該文提出基于災(zāi)難預(yù)測故障模型的蟻群優(yōu)化虛擬光網(wǎng)絡(luò)映射 (DFM-ACO-VNM)算法。在該算法中,設(shè)計基于光節(jié)點資源和相鄰鏈路的全局潛在故障概率的光節(jié)點排序映射準(zhǔn)則,并設(shè)計啟發(fā)式信息公式實現(xiàn)多區(qū)域故障下最小帶寬容量損失的虛擬節(jié)點和虛擬鏈路協(xié)同映射。仿真結(jié)果表明,該文所提算法在多區(qū)域故障時能降低帶寬容量損失,減少帶寬阻塞率和提高頻譜利用率。

  • 圖  1  虛擬網(wǎng)絡(luò)映射到災(zāi)難彈性光網(wǎng)絡(luò)示意圖

    圖  2  仿真網(wǎng)絡(luò)多區(qū)域災(zāi)難故障拓撲

    圖  3  不同負載下帶寬阻塞率的對比

    圖  4  不同負載下帶寬容量損失的對比

    圖  5  不同負載下頻譜利用率的對比

    表  1  DFM-ACO-VNM算法

     輸入:輸入底層網(wǎng)絡(luò)${{{G}}_{\rm{s}}}({{{N}}_{\rm{s}}},{{{{\rm E}}}_{\rm{s}}})$和災(zāi)難事件F,虛擬網(wǎng)絡(luò)請求${{{G}}_{\rm{v}}}({{{N}}_{\rm{v}}},{{{E}}_{\rm{v}}})$。
     輸出:Antbest,即虛擬網(wǎng)絡(luò)的虛擬節(jié)點映射,虛擬鏈路映射和頻譜資源分配結(jié)果。
     (1)  初始化信息素濃度矩陣τ[n][m],啟發(fā)式信息矩陣η[n][m],轉(zhuǎn)移概率矩陣P[n][m],初始化${A_{{\rm{best}}}} = 1000000$, nNv集合的虛擬節(jié)點
        數(shù),mNs集合的光節(jié)點數(shù),設(shè)置蟻群算法最大迭代次數(shù)Gmax,迭代變量j=0; Aj為虛擬網(wǎng)絡(luò)蟻群映射第j輪結(jié)果;
     (2)  根據(jù)災(zāi)難集合F,計算EONs區(qū)域A災(zāi)難概率${p_A}\left( {{f_i}} \right)\;$,根據(jù)式(7)計算各光纖鏈路es的災(zāi)難評估$M({e_{\rm{s}}})$值;
     (3)  根據(jù)式(5),對虛擬網(wǎng)絡(luò)中的虛擬節(jié)點降序排列在集合${R_{{n_{\rm{v}}}}}$中;
     (4)  For(j =0, j+1, j <Gmax)
     (5)   For 從排序第1個虛擬節(jié)點到第n個虛擬節(jié)點
     (6)    執(zhí)行EBCL-VNM映射算法(表2),構(gòu)造虛擬網(wǎng)絡(luò)映射解Aj;
     (7)   End for
     (8)    If ${{\rm{E}}_{{\rm{BCL}}}}({A_{{\rm{best}}}})$ > ${{{E}}_{{\rm{BCL}}}}({A_j})$
     (9)     令${{{E}}_{{\rm{BCL}}}}({A_{{\rm{best}}}})$ = ${{{E}}_{{\rm{BCL}}}}({A_j})$
     (10)    End if
     (11)    根據(jù)式(10),更新信息素濃度矩陣
     (12)    if converge
     (13)     Break;
     (14)    end if
     (15)  end for
     (16)  Return ${{\rm{E}}_{{\rm{BCL}}}}({A_{{\rm{best}}}})$ and ${A_{{\rm{best}}}}$
    下載: 導(dǎo)出CSV

    表  2  EBCL-VNM 算法

     (1)  初始化虛擬網(wǎng)絡(luò)請求的虛擬節(jié)點、鏈路映射結(jié)果集合和資源分配結(jié)合,即A0 = Φ;
     (2)  根據(jù)式(6),排序EONs中光節(jié)點在集合${R_{{n_{\rm{s}}}}}$中;
     (3)  選擇順序列表${R_{{n_{\rm{v}}}}}$中的第1個虛擬節(jié)點$n_{\rm{v}}^0$;
     (4) 選擇順序列表${R_{{n_{\rm{s}}}}}$中的第1個光節(jié)點$n_{\rm{s}}^0$;
     (5)  將滿足資源約束的$n_{\rm{v}}^0$映射到$n_{\rm{s}}^0$,記錄已映射節(jié)點信息,并從集合${R_{{n_{\rm{v}}}}}$中刪除$n_{\rm{v}}^0$;
     (6)  For 依次映射集合${R_{{n_{\rm{v}}}}}$的剩余虛擬節(jié)點
     (7)  當(dāng)前擬映射虛擬節(jié)點$n_v^i$加入已映射虛擬節(jié)點和虛擬鏈路集合時,根據(jù)式(8)結(jié)果確定需要新映射的虛擬鏈路;
     (8)  找出滿足虛擬節(jié)點資源約束條件的候選光節(jié)點集合$n_{\rm{s}}^{i{\rm{ - C}}}$;
     (9)   For 對所有候選光節(jié)點集合$n_{\rm{s}}^{i{\rm{ - C}}}$依次執(zhí)行
     (10)    運行多商品流算法映射各虛擬鏈路的K條候選光路路由和資源光路帶寬分配;
     (11)    根據(jù)式(8)計算啟發(fā)式信息矩陣η[$n_{\rm{v}}^i$][$n_{\rm{s}}^j$];
     (12)    根據(jù)式(9)計算轉(zhuǎn)移概率矩陣P[$n_{\rm{v}}^i$][$n_{\rm{s}}^j$];
     (13)    將虛擬節(jié)點i按式(9)計算值,概率地選擇映射到光節(jié)點j;
     (14)   End for
     (15)   更新虛擬節(jié)點和虛擬鏈路映射集合;
     (16)  End for
     (17)  Return 虛擬節(jié)點映射、虛擬鏈路映射和資源分配結(jié)果。
    下載: 導(dǎo)出CSV
  • 鮑寧海, 蘇國慶, 陳靜波. 恢復(fù)時間敏感的光網(wǎng)絡(luò)混合通路保護算法[J]. 重慶郵電大學(xué)學(xué)報: 自然科學(xué)版, 2017, 29(3): 313–319. doi: 10.3979/j.issn.1673-825X.2017.03.005

    BAO Ninghai, SU Guoqing, and CHEN Jingbo. Recovery-time aware hybrid path protection algorithm in optical networks[J]. Journal of Chongqing University of Posts and Telecommunications:Natural Science Edition, 2017, 29(3): 313–319. doi: 10.3979/j.issn.1673-825X.2017.03.005
    LIU Huanlin, DU Jundan, CHEN Yong, et al. A coordinated virtual optical network embedding algorithm based on resources availability-aware over elastic optical networks[J]. Optical Fiber Technology, 2018, 45: 391–398. doi: 10.1016/j.yofte.2018.08.021
    ELMIRGHANI J M H, KLEIN T, HINTON K, et al. GreenTouch greenMeter core network energy-efficiency improvement measures and optimization[J]. Journal of Optical Communications and Networking, 2018, 10(2): A250–A269. doi: 10.1364/JOCN.10.00A250
    PAOLUCCI F, CUGINI F, FRESI F, et al. Superfilter technique in SDN-controlled elastic optical networks[Invited][J]. Journal of Optical Communications and Networking, 2015, 7(2): A285–A292. doi: 10.1364/JOCN.7.00A285
    LU Shuaibing, WU Jie, ZHENG Huanyang, et al. On maximum elastic scheduling in cloud-based data center networks for virtual machines with the hose model[J]. Journal of Computer Science and Technology, 2019, 34(1): 185–206. doi: 10.1007/s11390-019-1890-3
    LIN Rongping, LUO Shan, ZHOU Jingwei, et al. Column generation algorithms for virtual network embedding in flexi-grid optical networks[J]. Optics Express, 2018, 26(8): 10898–10913. doi: 10.1364/OE.26.010898
    DUBOIS D J and CASALE G. Autonomic provisioning and application mapping on spot cloud resources[C]. 2015 International Conference on Cloud and Autonomic Computing, Boston, USA, 2015: 57–68. doi: 10.1109/ICCAC.2015.21.
    XIE Weisheng, JUE J P, ZHANG Qiong, et al. Survivable virtual optical network mapping in flexible-grid optical networks[C]. 2014 International Conference on Computing, Networking and Communications, Honolulu, USA, 2014: 221–225. doi: 10.1109/ICCNC.2014.6785335.
    ZHANG Huibin, WANG Wei, ZHAO Yongli, et al. Shared protection based virtual network mapping in space division multiplexing optical networks[J]. Optical Fiber Technology, 2018, 42: 63–68. doi: 10.1016/j.yofte.2017.12.004
    XUAN Hejun, WANG Yuping, XU Zhanqi, et al. Virtual optical network mapping and core allocation in elastic optical networks using multi-core fibers[J]. Optics Communications, 2017, 402: 26–35. doi: 10.1016/j.optcom.2017.05.065
    GALDAMEZ C and YE Zilong. Resilient virtual network mapping against large-scale regional failures[C]. 2017 IEEE Conference of Wireless and Optical Communication, Newark, USA, 2017: 1–4. doi: 10.1109/WOCC.2017.7928978.
    FERDOUSI S, DIKBIYIK F, FARHAN HABIB M, et al. Disaster-aware datacenter placement and dynamic content management in cloud networks[J]. IEEE OSA Journal of Optical Communications and Networking, 2015, 7(7): 681–694. doi: 10.1364/JOCN.7.000681
    GOUR R, KONG Jian, ISHIGAKI G, et al. Survivable routing in multi-domain optical networks with geographically correlated failures[C]. 2017 IEEE Global Communications Conference, Singapore, 2017: 1–6. doi: 10.1109/GLOCOM.2017.8254775.
    劉煥淋, 易鵬飛, 陳勇, 等. 一種最小故障風(fēng)險損失的彈性光網(wǎng)絡(luò)多鏈路故障概率保護策略[J]. 電子與信息學(xué)報, 2017, 39(8): 1819–1825. doi: 10.11999/JEIT161159

    LIU Huanlin, YI Pengfei, CHEN Yong, et al. Multi-link failure probability protection strategy based on minimum fault risk loss in elastic optical networks[J]. Journal of Electronics &Information Technology, 2017, 39(8): 1819–1825. doi: 10.11999/JEIT161159
    劉煥淋, 林振宇, 王欣, 等. 彈性光網(wǎng)絡(luò)中基于安全性感知的差異化虛擬光網(wǎng)絡(luò)的映射策略[J]. 電子與信息學(xué)報, 2019, 41(2): 424–432. doi: 10.11999/JEIT180335

    LIU Huanlin, LIN Zhengyu, WANG Xin, et al. A diverse virtual optical network mapping strategy based on security awareness in elastic optical networks[J]. Journal of Electronics &Information Technology, 2019, 41(2): 424–432. doi: 10.11999/JEIT180335
    POURVALI M, BAI Hao, CRICHIGNO J, et al. Multicast virtual network services embedding for improved disaster recovery support[J]. IEEE Communications Letters, 2018, 22(7): 1362–1365. doi: 10.1109/LCOMM.2018.2822739
    WANG Ying, LIU Xiao, QIU Xuesong, et al. Prediction-based survivable virtual network mapping against disaster failures[J]. International Journal of Network Management, 2016, 26(5): 336–354. doi: 10.1002/nem.1939
    朱顥東, 孫振, 吳迪, 等. 基于改進蟻群算法的移動機器人路徑規(guī)劃[J]. 重慶郵電大學(xué)學(xué)報: 自然科學(xué)版, 2016, 28(6): 849–855. doi: 10.3979/j.issn.1673-825X.2016.06.017

    ZHU Haodong, SUN Zhen, WU Di, et al. Path planning for mobile robot based on improved ant colony algorithm[J]. Journal of Chongqing University of Posts and Telecommunications:Natural Science Edition, 2016, 28(6): 849–855. doi: 10.3979/j.issn.1673-825X.2016.06.017
    ZHENG Hongkun, LI Jingjing, GONG Yuejiao, et al. Link mapping-oriented ant colony system for virtual network embedding[C]. 2017 IEEE Congress on Evolutionary Computation, San Sebastian, Spain, 2017: 1223–1230. doi: 10.1109/CEC.2017.7969445.
    謝暉. 抗毀SDN光網(wǎng)絡(luò)資源優(yōu)化調(diào)度研究[J]. 激光雜志, 2019, 40(4): 97–101. doi: 10.14016/j.cnki.jgzz.2019.04.097

    XIE Hui. Research on optimal scheduling of SDN optical network resources[J]. Laser Journal, 2019, 40(4): 97–101. doi: 10.14016/j.cnki.jgzz.2019.04.097
    DU Xiaowu and MA Lisheng. Backup path provisioning for service protection against disaster failures in telecom networks[C]. 2017 International Conference on Networking and Network Applications, Kathmandu, Nepal, 2017: 220–224. doi: 10.1109/NaNA.2017.40.
  • 加載中
圖(5) / 表(2)
計量
  • 文章訪問數(shù):  2543
  • HTML全文瀏覽量:  812
  • PDF下載量:  51
  • 被引次數(shù): 0
出版歷程
  • 收稿日期:  2019-07-25
  • 修回日期:  2020-02-19
  • 網(wǎng)絡(luò)出版日期:  2020-03-12
  • 刊出日期:  2020-07-23

目錄

    /

    返回文章
    返回