Optimal regenerator placement for path protection in impairment-aware WDM networks

R. Ramlall, Quazi Rahman, Y. Aneja, S. Bandyopadhyay
{"title":"Optimal regenerator placement for path protection in impairment-aware WDM networks","authors":"R. Ramlall, Quazi Rahman, Y. Aneja, S. Bandyopadhyay","doi":"10.1109/HPSR.2015.7483111","DOIUrl":null,"url":null,"abstract":"This paper addresses the regenerator placement problem (RPP) when designing resilient, impairment aware WDM optical networks. For the RPP, we have proposed two solutions; an optimal solution for small networks (less than 10 nodes) and a near-optimal heuristic solution for practical-sized networks. The optimal solution uses an Integer Linear Program which can be implemented by any solver for mathematical programming. The heuristic makes use of an approach, proposed in a recent paper, that requires a formulation involving an exponential number of constraints. It was shown in that paper that this formulation can be solved very efficiently using a branch-and-cut algorithm and that the approach may be used to design resilient networks which guarantees restoration. In this paper we have shown that this branch-and-cut approach may be used as a part of a highly efficient heuristic which gave optimal results in an overwhelming number of cases that we tested.","PeriodicalId":360703,"journal":{"name":"2015 IEEE 16th International Conference on High Performance Switching and Routing (HPSR)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE 16th International Conference on High Performance Switching and Routing (HPSR)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/HPSR.2015.7483111","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

This paper addresses the regenerator placement problem (RPP) when designing resilient, impairment aware WDM optical networks. For the RPP, we have proposed two solutions; an optimal solution for small networks (less than 10 nodes) and a near-optimal heuristic solution for practical-sized networks. The optimal solution uses an Integer Linear Program which can be implemented by any solver for mathematical programming. The heuristic makes use of an approach, proposed in a recent paper, that requires a formulation involving an exponential number of constraints. It was shown in that paper that this formulation can be solved very efficiently using a branch-and-cut algorithm and that the approach may be used to design resilient networks which guarantees restoration. In this paper we have shown that this branch-and-cut approach may be used as a part of a highly efficient heuristic which gave optimal results in an overwhelming number of cases that we tested.
损伤感知WDM网络中路径保护的最优再生器布局
本文研究了在设计具有弹性、损伤感知的WDM光网络时,再生器的放置问题。对于RPP,我们提出了两个解决方案;小型网络(少于10个节点)的最优解决方案和实际规模网络的近最优启发式解决方案。最优解使用整数线性规划,它可以由任何数学规划求解器实现。启发式使用了最近一篇论文中提出的一种方法,该方法需要一个涉及指数数量约束的公式。结果表明,该公式可以用分支切断算法有效地求解,该方法可用于设计保证恢复的弹性网络。在本文中,我们已经表明,这种分支切断方法可以用作高效启发式的一部分,在我们测试的绝大多数情况下,它给出了最佳结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信