基于需求的共享保护的计算研究

DRCN 2005). Proceedings.5th International Workshop on Design of Reliable Communication Networks, 2005. Pub Date : 2005-12-14 DOI:10.1109/DRCN.2005.1563902

C. Gruber, A. Koster, S. Orlowski, R. Wessäly, A. Zymolka

{"title":"基于需求的共享保护的计算研究","authors":"C. Gruber, A. Koster, S. Orlowski, R. Wessäly, A. Zymolka","doi":"10.1109/DRCN.2005.1563902","DOIUrl":null,"url":null,"abstract":"In this paper, we compare the new resilience mechanism demand-wise shared protection (DSP) with dedicated and shared path protection. The computational study on five realistic network planning scenarios reveals that that the best solutions for DSP are on average 15% percent better than the corresponding 1+1 dedicated path protection solutions, and only 15% percent worse than shared path protection.","PeriodicalId":415896,"journal":{"name":"DRCN 2005). Proceedings.5th International Workshop on Design of Reliable Communication Networks, 2005.","volume":"21 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"24","resultStr":"{\"title\":\"A computational study for demand-wise shared protection\",\"authors\":\"C. Gruber, A. Koster, S. Orlowski, R. Wessäly, A. Zymolka\",\"doi\":\"10.1109/DRCN.2005.1563902\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we compare the new resilience mechanism demand-wise shared protection (DSP) with dedicated and shared path protection. The computational study on five realistic network planning scenarios reveals that that the best solutions for DSP are on average 15% percent better than the corresponding 1+1 dedicated path protection solutions, and only 15% percent worse than shared path protection.\",\"PeriodicalId\":415896,\"journal\":{\"name\":\"DRCN 2005). Proceedings.5th International Workshop on Design of Reliable Communication Networks, 2005.\",\"volume\":\"21 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-12-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"24\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"DRCN 2005). Proceedings.5th International Workshop on Design of Reliable Communication Networks, 2005.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DRCN.2005.1563902\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"DRCN 2005). Proceedings.5th International Workshop on Design of Reliable Communication Networks, 2005.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DRCN.2005.1563902","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 24

摘要

在本文中，我们比较了新的弹性机制需求智能共享保护(DSP)与专用和共享路径保护。对五种现实网络规划场景的计算研究表明，DSP的最佳方案比相应的1+1专用路径保护方案平均好15%，比共享路径保护方案平均差15%。

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

查看原文本刊更多论文

A computational study for demand-wise shared protection

In this paper, we compare the new resilience mechanism demand-wise shared protection (DSP) with dedicated and shared path protection. The computational study on five realistic network planning scenarios reveals that that the best solutions for DSP are on average 15% percent better than the corresponding 1+1 dedicated path protection solutions, and only 15% percent worse than shared path protection.

求助全文

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

来源期刊

DRCN 2005). Proceedings.5th International Workshop on Design of Reliable Communication Networks, 2005.

自引率

0.00%

发文量