Fiber span failure protection in mesh optical networks

Guangzhi Li, R. Doverspike, C. Kalmanek
{"title":"Fiber span failure protection in mesh optical networks","authors":"Guangzhi Li, R. Doverspike, C. Kalmanek","doi":"10.1117/12.436053","DOIUrl":null,"url":null,"abstract":"A major challenge of optical network design is deciding where spare capacity is needed and how much, so that interrupted traffic may be rerouted in the event of a failure. Given the optical network topology and traffic forecast, the network design needs to map the traffic forecast into optical connection demands. For each optical connection demand, two paths need to be computed, i.e., a service path and a restoration path. In most cases, optical network design mainly considers single failure. If two service paths do not share any single failure, their restoration paths can share the same capacity on any links that they have in common. In this way, the total spare capacity needed for restoration can be dramatically reduced. However, due to the layered architecture in optical networks, a pair of diverse paths in a particular layer won't necessarily be diverse when the lower layer topology is considered. For example, optical networks are typically built on top of a network of fiber spans. A single span cut in the fiber network can cause multiple link failures in the optical layer. In this paper, we investigate fiber span failure protection scenarios in mesh optical networks. Specifically, we provide an algorithm to find two fiber span disjoint paths for each demand, such that the total spare capacity allocated in the network is minimized. Another problem that arises in restoration path computation is the existence of a trap topology. In a trap topology, the pre- selected service path may not have a diverse restoration path even though two diverse paths exist in the network. For simple link-disjoint protection, the min-cost max-flow algorithm can be used to avoid this problem. For fiber span failure protection, the trap topology problem becomes complicated. We show that it is NP-hard problem to find the maximum number of fiber-span disjoint paths between two nodes. We provide two heuristic algorithms to solve this trap topology problem. We have implemented fiber span failure protection in our restoration capacity planning toolkit Cplan. We describe an application of fiber span failure protection at the end of the paper.","PeriodicalId":187370,"journal":{"name":"OptiComm: Optical Networking and Communications Conference","volume":"14 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-08-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"84","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"OptiComm: Optical Networking and Communications Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1117/12.436053","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 84

Abstract

A major challenge of optical network design is deciding where spare capacity is needed and how much, so that interrupted traffic may be rerouted in the event of a failure. Given the optical network topology and traffic forecast, the network design needs to map the traffic forecast into optical connection demands. For each optical connection demand, two paths need to be computed, i.e., a service path and a restoration path. In most cases, optical network design mainly considers single failure. If two service paths do not share any single failure, their restoration paths can share the same capacity on any links that they have in common. In this way, the total spare capacity needed for restoration can be dramatically reduced. However, due to the layered architecture in optical networks, a pair of diverse paths in a particular layer won't necessarily be diverse when the lower layer topology is considered. For example, optical networks are typically built on top of a network of fiber spans. A single span cut in the fiber network can cause multiple link failures in the optical layer. In this paper, we investigate fiber span failure protection scenarios in mesh optical networks. Specifically, we provide an algorithm to find two fiber span disjoint paths for each demand, such that the total spare capacity allocated in the network is minimized. Another problem that arises in restoration path computation is the existence of a trap topology. In a trap topology, the pre- selected service path may not have a diverse restoration path even though two diverse paths exist in the network. For simple link-disjoint protection, the min-cost max-flow algorithm can be used to avoid this problem. For fiber span failure protection, the trap topology problem becomes complicated. We show that it is NP-hard problem to find the maximum number of fiber-span disjoint paths between two nodes. We provide two heuristic algorithms to solve this trap topology problem. We have implemented fiber span failure protection in our restoration capacity planning toolkit Cplan. We describe an application of fiber span failure protection at the end of the paper.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
网状光网络中的光纤跨故障保护
光网络设计的一个主要挑战是决定哪些地方需要备用容量以及需要多少备用容量,以便在发生故障时中断的流量可以重新路由。考虑到光网络的拓扑结构和流量预测,网络设计需要将流量预测映射到光连接需求中。对于每个光连接需求,需要计算两条路径,即业务路径和恢复路径。在大多数情况下,光网络设计主要考虑单故障。如果两条业务路径没有共享任何单个故障,则它们的恢复路径可以在它们共有的任何链路上共享相同的容量。通过这种方式,恢复所需的总备用容量可以大大减少。然而,由于光网络的分层结构,当考虑下层拓扑结构时,特定层中的一对不同路径不一定是不同的。例如,光网络通常建立在光纤网络的顶部。光纤网络中的单跨切割会导致光层中的多条链路故障。本文研究了网状光网络中光纤跨故障保护的场景。具体而言,我们提供了一种算法,为每个需求找到两条光纤跨度不相交的路径,从而使网络中分配的总备用容量最小化。在恢复路径计算中出现的另一个问题是陷阱拓扑的存在。在trap拓扑中,即使网络中存在两条不同的恢复路径,但预先选择的业务路径也可能没有不同的恢复路径。对于简单的链路断开保护,可以使用最小代价最大流量算法来避免这一问题。对于光纤跨故障保护,trap拓扑问题变得复杂。我们证明了在两个节点之间寻找最大数目的光纤跨度不相交路径是np困难问题。我们提供了两种启发式算法来解决这个陷阱拓扑问题。我们已经在我们的恢复能力规划工具包Cplan中实现了光纤跨故障保护。最后介绍了光纤跨段失效保护的一个应用。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A hybrid protection-restoration mechanism for enhancing dual-failure restorability in optical mesh-restorable networks Overspill routing in optical networks: a new architecture for future-proof IP-over-WDM networks Grooming of multicast sessions in WDM ring networks Dynamic bandwidth allocation algorithms in EPON: a simulation study CHEETAH: circuit-switched high-speed end-to-end transport architecture
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1