Revisiting p-Cycles / FIPP p-Cycles vs. Shared Link / Path Protection

Caroline Rocha, B. Jaumard
{"title":"Revisiting p-Cycles / FIPP p-Cycles vs. Shared Link / Path Protection","authors":"Caroline Rocha, B. Jaumard","doi":"10.1109/ICCCN.2008.ECP.93","DOIUrl":null,"url":null,"abstract":"While the advantages of p-cycles and FIPP p-cycles are well established, there has been no systematic analysis of how much bandwidth they consume in comparison with the shared link or path protection schemes. It was also recently observed that, even enumerating a huge number of cycles is not necessarily a guarantee for obtaining good quality solutions with the classical ILP models if tools for large scale programming such as, e.g., column generation techniques, are not used. For instance, a reduction of up to 37% of the solution cost for FIPP p-cycles can be obtained when using column generation instead of classical ILP modeling. We propose to investigate the bandwidth protection costs of p-cycles and FIPP p-cycles in comparison with those of shared link and path protection, using column generation models for the four protection schemes, and therefore obtaining the optimal values for all of them, out of any doubt. Accurate quantitative comparisons show that the average excess required bandwidth is about 6.6% for p-cycles and about 13.4% for FIPP p-cycles in exchange of a much faster restoration time.","PeriodicalId":314071,"journal":{"name":"2008 Proceedings of 17th International Conference on Computer Communications and Networks","volume":"13 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"34","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 Proceedings of 17th International Conference on Computer Communications and Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCCN.2008.ECP.93","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 34

Abstract

While the advantages of p-cycles and FIPP p-cycles are well established, there has been no systematic analysis of how much bandwidth they consume in comparison with the shared link or path protection schemes. It was also recently observed that, even enumerating a huge number of cycles is not necessarily a guarantee for obtaining good quality solutions with the classical ILP models if tools for large scale programming such as, e.g., column generation techniques, are not used. For instance, a reduction of up to 37% of the solution cost for FIPP p-cycles can be obtained when using column generation instead of classical ILP modeling. We propose to investigate the bandwidth protection costs of p-cycles and FIPP p-cycles in comparison with those of shared link and path protection, using column generation models for the four protection schemes, and therefore obtaining the optimal values for all of them, out of any doubt. Accurate quantitative comparisons show that the average excess required bandwidth is about 6.6% for p-cycles and about 13.4% for FIPP p-cycles in exchange of a much faster restoration time.
重访p-Cycles / FIPP p-Cycles vs.共享链路/路径保护
虽然p-环和FIPP p-环的优势已经得到了很好的确立,但与共享链路或路径保护方案相比,它们消耗多少带宽还没有系统的分析。最近还观察到,如果不使用大规模编程的工具,例如列生成技术,即使枚举大量的循环也不一定保证用经典的ILP模型获得高质量的解。例如,当使用柱生成而不是经典的ILP建模时,FIPP p-cycles的解决方案成本最多可降低37%。我们建议研究p环和FIPP p环的带宽保护成本与共享链路和路径保护的带宽保护成本的比较,使用四种保护方案的列生成模型,从而获得所有保护方案的最优值,毫无疑问。精确的定量比较表明,p-周期的平均额外带宽约为6.6%,FIPP p-周期的平均额外带宽约为13.4%,以换取更快的恢复时间。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信