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

高級搜索

留言板

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

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

QoS約束的鏈路故障多備份路徑恢復(fù)算法

崔文巖,  孟相如,  楊歡歡,  李紀真,  陳天平,  康巧燕

崔文巖, 孟相如, 楊歡歡, 李紀真, 陳天平, 康巧燕. QoS約束的鏈路故障多備份路徑恢復(fù)算法[J]. 電子與信息學(xué)報, 2016, 38(8): 1850-1857. doi: 10.11999/JEIT151230
引用本文: 崔文巖, 孟相如, 楊歡歡, 李紀真, 陳天平, 康巧燕. QoS約束的鏈路故障多備份路徑恢復(fù)算法[J]. 電子與信息學(xué)報, 2016, 38(8): 1850-1857. doi: 10.11999/JEIT151230
CUI Wenyan, MENG Xiangru, YANG Huanhuan, LI Jizhen, CHEN Tianping, KANG Qiaoyan. Link Failure Recovery Algorithm Based on Multiple Backup Paths with QoS Constraint[J]. Journal of Electronics & Information Technology, 2016, 38(8): 1850-1857. doi: 10.11999/JEIT151230
Citation: CUI Wenyan, MENG Xiangru, YANG Huanhuan, LI Jizhen, CHEN Tianping, KANG Qiaoyan. Link Failure Recovery Algorithm Based on Multiple Backup Paths with QoS Constraint[J]. Journal of Electronics & Information Technology, 2016, 38(8): 1850-1857. doi: 10.11999/JEIT151230

QoS約束的鏈路故障多備份路徑恢復(fù)算法

doi: 10.11999/JEIT151230
  • 1.

    (空軍工程大學(xué)信息與導(dǎo)航學(xué)院 西安 710077) ②(清華大學(xué)電子工程系 北京 100084)

基金項目: 

國家自然科學(xué)基金(61201209, 61401499)，陜西省自然科學(xué)基金(2013JQ8013，2015JM6340)

Link Failure Recovery Algorithm Based on Multiple Backup Paths with QoS Constraint

  • 1.

    (College of Information and Navigation, Air Force Engineering University, Xi&rsquo

Funds: 

The National Natural Science Foundation of China (61201209, 61401499), Natural Science Foundation of Shaanxi Province (2013JQ8013, 2015JM6340)

  • 摘要: 鏈路故障的恢復(fù)，不僅僅是選擇一條連通的備份路徑問題，還應(yīng)考慮網(wǎng)絡(luò)業(yè)務(wù)故障恢復(fù)過程中的QoS需求。針對此問題，該文基于多備份路徑策略，構(gòu)建概率關(guān)聯(lián)故障模型和重路由流量丟棄量優(yōu)化目標(biāo)。并基于該優(yōu)化目標(biāo)，以業(yè)務(wù)的QoS需求為約束，建立故障恢復(fù)問題的數(shù)學(xué)模型，提出一種QoS約束的鏈路故障多備份路徑恢復(fù)算法。該算法構(gòu)建單條備份路徑時，以最大程度地減少重路由流量丟棄為目標(biāo)，并采用改進的QoS約束的k最短路徑法進行拼接，且給與高優(yōu)先級鏈路更多的保護資源。此外還證明了算法的正確性并分析了時間空間復(fù)雜度。在NS2環(huán)境下的仿真結(jié)果表明，該算法顯著提升了鏈路故障恢復(fù)率和重路由流量QoS滿足率，且QoS約束條件越強，相較于其它算法優(yōu)勢越明顯。
    Abstract: Recovery of link failure is not only the issue of selecting a connected backup path, but the QoS requirement in the process of failure recovery of the network service should be also taken into account. The probabilistically correlated failure model and rerouting traffic disruption optimization target are built based on multiple backup paths strategy. Furthermore, a mathematical model of the failure recovery problem is modeled, which takes the minimum rerouting traffic disruption as the target and the QoS requirement as the constrain, and a link failure recovery algorithm based on multiple backup paths with QoS constrain is proposed. The proposed algorithm takes reducing rerouting traffic disruption farthest as the target and adopts the improved k shortest path algorithm with QoS constrain to splice the single backup path, and it gives the links more protection resource with high priority. Moreover, the correctness of the proposed algorithm is proved, and the time complex and the space complex are computed. The simulation results under NS2 show that the proposed algorithm significantly improves link failure recovery rate and the QoS satisfaction rate of the rerouting traffic, and it performs better when the QoS constrain is stronger.
    • HTML全文
  • WELLBROCK G and XIA T J. How will optical transport deal with future network traffic growth?[C]. Optical Communication(ECOC), Cannes, France, 2014: 21-25. doi: 10.1109/ECOC.2014.6964248.
    TURNER D, LEVCHENKO K, SNOEREN A C, et al. California fault lines: understanding the causes and impact of network failures[C]. ACM SIGCOMM, New Delhi, India, 2010: 315-326. doi: 10.1145/1851275.1851220.
    張民貴, 劉斌. IP網(wǎng)絡(luò)的快速故障恢復(fù)[J]. 電子學(xué)報, 2008, 36(8): 1595-1602.
    ZHANG Mingui and LIU Bin. Fast failure recovery of IP networks[J]. Acta Electronica Sinica, 2008, 36(8): 1595-1602.
    齊寧, 汪斌強, 王志明. 可重構(gòu)服務(wù)承載網(wǎng)容錯構(gòu)建算法研究[J]. 電子與信息學(xué)報, 2012, 34(2): 468-473. doi: 10.3724/SP.J.1146.2011. 00670.
    QI Ning, WANG Binqiang, and WANG Zhiming. Research on reconfigurable service carrying network resilient construction algorithms[J]. Journal of Electronics Information Technology, 2012, 34(2): 468-473. doi: 10.3724/SP.J. 1146.2011.00670.
    SHAND M and BRYANT S. IP fast reroute framework[P] America, RFC5714, 2010.
    王禹, 王振興, 張連成. 一種基于結(jié)構(gòu)化備份子圖的路由系統(tǒng)失效恢復(fù)方法[J]. 電子與信息學(xué)報, 2013, 35(9): 2254-2260. doi: 10.3724/SP.J.1146.2012.01669.
    WANG Yu, WANG Zhenxing, and ZHANG Liancheng. A failure recovery method for routing system based on structured backup subgraph[J]. Journal of Electronics Information Technology, 2013, 35(9): 2254-2260. doi: 10.3724/SP.J.1146.2012.01669.
    YANG B H, LIU J D, and SHENKER S, et al. Keep forwarding: Towards k-link failure resilient routing[C]. IEEE INFOCOM 2014 IEEE Conference on Computer Communications, Toronto, Canada, 2014: 1617-1625. doi: 10.1109/INFOCOM.2014.6848098.
    WANG Y, WANG H, MAHIMKAR A, et al. R3: resilient routing reconfiguration[C]. ACM SIGCOMM, New Delhi, India, 2010: 291-302. doi: 10.1145/1851275.1851218.
    SUCHARA M, XU D, DOVERSPIKE R, et al. Network architecture for joint failure recovery and traffic engineering[C]. ACM SIGMETRICS, New York, NY, USA, 2011: 97-108. doi: 10.1145/2007116.2007128.
    BANNER R and ORDA A. Designing low-capacity backup networks for fast restoration[C]. 2010 Proceedings IEEE INFOCOM, San Diego, America, 2010: 1-9. doi: 10.1109/INFCOM.2010.5462007.
    ZHENG Q, CAO G H, THOMAS F, et al. Cross-layer approach for minimizing routing disruption in IP networks[J]. IEEE Transactions on Parallel and Distributed Systems, 2014, 25(7): 1659-1669. doi: 10.1109/TPDS.2013.157.
    MISRA S, XUE G L, and YANG D J. Polynomial time approximations for multi-path routing with bandwidth and delay constrains[C]. IEEE INFOCOM, Rio de Janeiro, Brazil, 2009: 558-566. doi: 10.1109/INFCOM.2009.5061962.
    TERESA G, MIGUEL S, JOSE C, et al. Two heuristics for calculating a shared risk link group disjoint set of paths of min-sum cost[J]. Journal of Network and System Management, 2014, 37(10): 332-338. doi: 10.1007/s10922- 014-9332-6.
    ZHENG Q, CAO G, PORTA T L, et al. Optimal recovery from large-scale failures in IP networks[C]. IEEE ICDCS, Macau, China, 2012: 295-304. doi: 10.1109/ICDCS.2012.47.
    JOHNSTON M, LEE H W, and MODIANO E. A robust optimization approach to backup network design with random failures[C]. IEEE INFOCOM, Shanghai, China, 2011: 1512-1520. doi: 10.1287/opre.1050.0238.
    周靈, 王建新. 路徑節(jié)點驅(qū)動的低代價最短路徑樹算法[J]. 計算機研究與發(fā)展, 2011, 48(5): 721-728.
    ZHOU Ling and WANG Jianxin. Path nodes-driven least-cost shortest path tree algorithm[J]. Journal of Computer Research and Development, 2011, 48(5): 721-728.
    ZHENG Q, ZHAO J, and CAO G H. A cross-layer approach for IP network protection[C]. Dependable Systems and Networks (DSN), Boston, MA, USA, 2012: 1-12.
  • 加載中
計量
  • 文章訪問數(shù):  1415
  • HTML全文瀏覽量:  136
  • PDF下載量:  452
  • 被引次數(shù): 0
出版歷程
  • 收稿日期:  2015-11-03
  • 修回日期:  2016-03-03
  • 刊出日期:  2016-08-19

目錄

    /

    返回文章
    返回