WDM网状网络中带全节点保护的分段p周期设计

B. Jaumard, Honghui Li
{"title":"WDM网状网络中带全节点保护的分段p周期设计","authors":"B. Jaumard, Honghui Li","doi":"10.1109/LANMAN.2011.6076936","DOIUrl":null,"url":null,"abstract":"Segment p-cycles offer an interesting compromise between the classical (link) p-cycles and the path p-cycles (also known as FIPP p-cycles), inheriting most advantages of both p-cycle schemes. In their original form, segment p-cycles do not offer 100% node protection, i.e., do not guarantee any protection against node failure for the endpoints of the segments. Indeed, if we allow some p-cycle overlapping, it is possible to ensure 100% node protection: this is the focus of the present study. We propose a new efficient design approach for segment p-cycles, called segment Np-cycles, which ensure 100% protection against any single failure, either link or node (endpoints of requests are excluded). In order to evaluate the performances of segment Np-cycles, we develop a new optimization model based on column generation (CG) techniques. The use of such techniques eliminates the need to explicitly enumerate all segment Np-cycle configurations, but instead leads to a process where only improving segment Np-cycle configurations are generated. Numerical results demonstrate that segment Np-cycles are comparable, sometimes even more efficient, than path p-cycles with respect to their capacity requirement. In addition, in order to ensure 100% node protection, they only require a marginal extra spare capacity than the regular segment p-cycles.","PeriodicalId":340032,"journal":{"name":"2011 18th IEEE Workshop on Local & Metropolitan Area Networks (LANMAN)","volume":"66 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Segment p-cycle design with full node protection in WDM mesh networks\",\"authors\":\"B. Jaumard, Honghui Li\",\"doi\":\"10.1109/LANMAN.2011.6076936\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Segment p-cycles offer an interesting compromise between the classical (link) p-cycles and the path p-cycles (also known as FIPP p-cycles), inheriting most advantages of both p-cycle schemes. In their original form, segment p-cycles do not offer 100% node protection, i.e., do not guarantee any protection against node failure for the endpoints of the segments. Indeed, if we allow some p-cycle overlapping, it is possible to ensure 100% node protection: this is the focus of the present study. We propose a new efficient design approach for segment p-cycles, called segment Np-cycles, which ensure 100% protection against any single failure, either link or node (endpoints of requests are excluded). In order to evaluate the performances of segment Np-cycles, we develop a new optimization model based on column generation (CG) techniques. The use of such techniques eliminates the need to explicitly enumerate all segment Np-cycle configurations, but instead leads to a process where only improving segment Np-cycle configurations are generated. Numerical results demonstrate that segment Np-cycles are comparable, sometimes even more efficient, than path p-cycles with respect to their capacity requirement. In addition, in order to ensure 100% node protection, they only require a marginal extra spare capacity than the regular segment p-cycles.\",\"PeriodicalId\":340032,\"journal\":{\"name\":\"2011 18th IEEE Workshop on Local & Metropolitan Area Networks (LANMAN)\",\"volume\":\"66 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-11-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 18th IEEE Workshop on Local & Metropolitan Area Networks (LANMAN)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/LANMAN.2011.6076936\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 18th IEEE Workshop on Local & Metropolitan Area Networks (LANMAN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LANMAN.2011.6076936","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

摘要

段p环在经典(链接)p环和路径p环(也称为FIPP p环)之间提供了一个有趣的折衷方案,继承了这两种p环方案的大多数优点。在其原始形式中,段p环不提供100%的节点保护,即不保证对段端点的节点故障进行任何保护。事实上,如果我们允许一些p-cycle重叠,就有可能确保100%的节点保护:这是本研究的重点。我们提出了一种新的有效的分段p-循环设计方法,称为分段np -循环,它可以确保100%防止任何单一故障,无论是链路还是节点(请求的端点除外)。为了评价分段np循环的性能,我们建立了一种新的基于列生成(CG)技术的优化模型。这种技术的使用消除了显式枚举所有段np -循环配置的需要,但相反导致了一个只生成改进段np -循环配置的过程。数值结果表明,在容量要求方面,段p-循环与路径p-循环相当,有时甚至更有效。此外,为了确保100%的节点保护,它们只需要比常规段p周期多一点边际备用容量。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Segment p-cycle design with full node protection in WDM mesh networks
Segment p-cycles offer an interesting compromise between the classical (link) p-cycles and the path p-cycles (also known as FIPP p-cycles), inheriting most advantages of both p-cycle schemes. In their original form, segment p-cycles do not offer 100% node protection, i.e., do not guarantee any protection against node failure for the endpoints of the segments. Indeed, if we allow some p-cycle overlapping, it is possible to ensure 100% node protection: this is the focus of the present study. We propose a new efficient design approach for segment p-cycles, called segment Np-cycles, which ensure 100% protection against any single failure, either link or node (endpoints of requests are excluded). In order to evaluate the performances of segment Np-cycles, we develop a new optimization model based on column generation (CG) techniques. The use of such techniques eliminates the need to explicitly enumerate all segment Np-cycle configurations, but instead leads to a process where only improving segment Np-cycle configurations are generated. Numerical results demonstrate that segment Np-cycles are comparable, sometimes even more efficient, than path p-cycles with respect to their capacity requirement. In addition, in order to ensure 100% node protection, they only require a marginal extra spare capacity than the regular segment p-cycles.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Characterizing fairness for 3G wireless networks Experimental performance evaluation of a virtual software router Available bandwidth probing in hybrid home networks Combined subcarrier switch off and power loading for 80 MHz bandwidth WLANs A routing approach to jamming mitigation in wireless multihop networks
×
引用
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