段共享保护的深入研究

7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings. Pub Date : 2004-05-10 DOI:10.1109/ISPAN.2004.1300499

János Tapolcai, P. Ho

{"title":"段共享保护的深入研究","authors":"János Tapolcai, P. Ho","doi":"10.1109/ISPAN.2004.1300499","DOIUrl":null,"url":null,"abstract":"This paper studies the survivable routing problem for segment shared protection (SSP) in mesh communication networks with bandwidth-guaranteed tunnels. Firstly, the NP-completeness proof is given to this problem. Then, we extend the integer linear program (ILP) formulation for SSP by additionally considering the constraint on the restoration time for each connection request and the switching/merging capability in each node. Extensive simulation efforts are addressed to investigate the performance impairment by adopting different upper bounds of the two constraints. The computation time and the problem size in the CPLEX solver are analyzed.","PeriodicalId":198404,"journal":{"name":"7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2004-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"A deeper study on segment shared protection\",\"authors\":\"János Tapolcai, P. Ho\",\"doi\":\"10.1109/ISPAN.2004.1300499\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper studies the survivable routing problem for segment shared protection (SSP) in mesh communication networks with bandwidth-guaranteed tunnels. Firstly, the NP-completeness proof is given to this problem. Then, we extend the integer linear program (ILP) formulation for SSP by additionally considering the constraint on the restoration time for each connection request and the switching/merging capability in each node. Extensive simulation efforts are addressed to investigate the performance impairment by adopting different upper bounds of the two constraints. The computation time and the problem size in the CPLEX solver are analyzed.\",\"PeriodicalId\":198404,\"journal\":{\"name\":\"7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-05-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISPAN.2004.1300499\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISPAN.2004.1300499","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 8

摘要

研究了带带宽保证隧道的网状通信网络中网段共享保护(SSP)的可生存路由问题。首先，给出了该问题的np完备性证明。在此基础上，对SSP的整数线性规划(ILP)公式进行了扩展，在此基础上考虑了每个连接请求的恢复时间约束和每个节点的交换/合并能力约束。通过采用两种约束的不同上界，进行了大量的仿真工作来研究性能损害。分析了CPLEX求解器的计算时间和问题大小。

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

查看原文本刊更多论文

A deeper study on segment shared protection

This paper studies the survivable routing problem for segment shared protection (SSP) in mesh communication networks with bandwidth-guaranteed tunnels. Firstly, the NP-completeness proof is given to this problem. Then, we extend the integer linear program (ILP) formulation for SSP by additionally considering the constraint on the restoration time for each connection request and the switching/merging capability in each node. Extensive simulation efforts are addressed to investigate the performance impairment by adopting different upper bounds of the two constraints. The computation time and the problem size in the CPLEX solver are analyzed.

求助全文

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

来源期刊

7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.

自引率

0.00%

发文量