具有共享风险链路组约束的保护算法研究

2016 IEEE Optoelectronics Global Conference (OGC) Pub Date : 2016-09-01 DOI:10.1109/OGC.2016.7590491

Pei Zhang, Yi-qiang Hua, Yutao Zhang

{"title":"具有共享风险链路组约束的保护算法研究","authors":"Pei Zhang, Yi-qiang Hua, Yutao Zhang","doi":"10.1109/OGC.2016.7590491","DOIUrl":null,"url":null,"abstract":"Survivability is the key topic in the networks. This paper studies the shared-protection based on SRLG, and presents two algorithms. The effectiveness of the proposed algorithms is demonstrated by simulation. Compared with other algorithms; the two algorithms can reduce the blocking probability and improve network performance greatly.","PeriodicalId":300208,"journal":{"name":"2016 IEEE Optoelectronics Global Conference (OGC)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"The study of protection algorithms with shared risk link group (SRLG) constraint\",\"authors\":\"Pei Zhang, Yi-qiang Hua, Yutao Zhang\",\"doi\":\"10.1109/OGC.2016.7590491\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Survivability is the key topic in the networks. This paper studies the shared-protection based on SRLG, and presents two algorithms. The effectiveness of the proposed algorithms is demonstrated by simulation. Compared with other algorithms; the two algorithms can reduce the blocking probability and improve network performance greatly.\",\"PeriodicalId\":300208,\"journal\":{\"name\":\"2016 IEEE Optoelectronics Global Conference (OGC)\",\"volume\":\"3 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 IEEE Optoelectronics Global Conference (OGC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/OGC.2016.7590491\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 IEEE Optoelectronics Global Conference (OGC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/OGC.2016.7590491","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

摘要

生存性是网络中的关键问题。研究了基于SRLG的共享保护，给出了两种算法。通过仿真验证了所提算法的有效性。与其他算法比较;这两种算法都能大大降低阻塞概率，提高网络性能。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

The study of protection algorithms with shared risk link group (SRLG) constraint

Survivability is the key topic in the networks. This paper studies the shared-protection based on SRLG, and presents two algorithms. The effectiveness of the proposed algorithms is demonstrated by simulation. Compared with other algorithms; the two algorithms can reduce the blocking probability and improve network performance greatly.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2016 IEEE Optoelectronics Global Conference (OGC)

自引率

0.00%

发文量