Survivable mapping algorithm by ring trimming (SMART) for large IP-over-WDM networks

M. Kurant, Patrick Thiran
{"title":"Survivable mapping algorithm by ring trimming (SMART) for large IP-over-WDM networks","authors":"M. Kurant, Patrick Thiran","doi":"10.1109/BROADNETS.2004.79","DOIUrl":null,"url":null,"abstract":"We develop a fast and efficient algorithm that finds a survivable (i.e., robust to single fiber failures) mapping of IP topology on the mesh of fibers in IP-over-WDM networks; we call it SMART. A number of algorithms solving this problem can be found in the literature. Since ILP solutions are highly complex, many heuristics were proposed. They usually start with some initial mapping and then try to gradually improve it. This involves the evaluation of the entire topology at each iteration, which is costly for large topologies. We propose a different approach. The SMART algorithm breaks down the task into a set of independent and very simple subtasks. The combination of solutions of these subtasks is a survivable mapping. This is why SMART is orders of magnitude faster than other proposals, especially when dealing with large topologies. We also extend the SMART algorithm to obtain a mapping resilient to fiber span failures, node failures and double-link failures. Finally, we show that the scalability of the standard heuristic approaches is additionally limited (contrary to SMART) when applied to double-link failures.","PeriodicalId":305639,"journal":{"name":"First International Conference on Broadband Networks","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"37","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"First International Conference on Broadband Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/BROADNETS.2004.79","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 37

Abstract

We develop a fast and efficient algorithm that finds a survivable (i.e., robust to single fiber failures) mapping of IP topology on the mesh of fibers in IP-over-WDM networks; we call it SMART. A number of algorithms solving this problem can be found in the literature. Since ILP solutions are highly complex, many heuristics were proposed. They usually start with some initial mapping and then try to gradually improve it. This involves the evaluation of the entire topology at each iteration, which is costly for large topologies. We propose a different approach. The SMART algorithm breaks down the task into a set of independent and very simple subtasks. The combination of solutions of these subtasks is a survivable mapping. This is why SMART is orders of magnitude faster than other proposals, especially when dealing with large topologies. We also extend the SMART algorithm to obtain a mapping resilient to fiber span failures, node failures and double-link failures. Finally, we show that the scalability of the standard heuristic approaches is additionally limited (contrary to SMART) when applied to double-link failures.
基于环修整的大型IP-over-WDM网络生存映射算法
我们开发了一种快速有效的算法,可以在IP-over- wdm网络的光纤网格上找到可生存(即对单光纤故障具有鲁棒性)的IP拓扑映射;我们称之为SMART。在文献中可以找到许多解决这个问题的算法。由于ILP解非常复杂,因此提出了许多启发式方法。他们通常从一些初始映射开始,然后逐渐改进它。这涉及到在每次迭代中对整个拓扑进行评估,这对于大型拓扑来说是非常昂贵的。我们提出了一种不同的方法。SMART算法将任务分解为一组独立且非常简单的子任务。这些子任务的解决方案的组合是一个可生存的映射。这就是为什么SMART比其他方案快几个数量级的原因,尤其是在处理大型拓扑时。我们还扩展了SMART算法,以获得对光纤跨故障、节点故障和双链路故障具有弹性的映射。最后,我们表明,当应用于双链路故障时,标准启发式方法的可扩展性也受到限制(与SMART相反)。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信