Cut saturation for p-cycle design

Khalid Al-Snaie, D. Thompson
{"title":"Cut saturation for p-cycle design","authors":"Khalid Al-Snaie, D. Thompson","doi":"10.1109/TPSD.2006.5507423","DOIUrl":null,"url":null,"abstract":"Preconfigured protection cycles (p-cycles) provide recovery times for mesh networks that are near the recovery times of BLSR ring networks while providing lower spare-to-working capacity ratios. However, the efficiency of p-cycles defined by the spare-to-working capacity ratio is affected by the topology of the network. An efficient method for adding links to an existing network is required to take advantage of p-cycles. In this work, a heuristic called p-cycle cut saturation (PCUT) is proposed. It extends the well-known cut saturation heuristic to strategically add links to an existing network to lower the spare-to-working capacity ratios in networks using p-cycles. PCUT is applied to a 28-node network to add spans and lowers the spare-to-working capacity ratio by 20%.","PeriodicalId":385396,"journal":{"name":"2006 IEEE Region 5 Conference","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2006-04-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 IEEE Region 5 Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TPSD.2006.5507423","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Preconfigured protection cycles (p-cycles) provide recovery times for mesh networks that are near the recovery times of BLSR ring networks while providing lower spare-to-working capacity ratios. However, the efficiency of p-cycles defined by the spare-to-working capacity ratio is affected by the topology of the network. An efficient method for adding links to an existing network is required to take advantage of p-cycles. In this work, a heuristic called p-cycle cut saturation (PCUT) is proposed. It extends the well-known cut saturation heuristic to strategically add links to an existing network to lower the spare-to-working capacity ratios in networks using p-cycles. PCUT is applied to a 28-node network to add spans and lowers the spare-to-working capacity ratio by 20%.
p循环设计的切割饱和度
预配置的保护周期(p周期)为网状网络提供了接近BLSR环网恢复时间的恢复时间,同时提供了较低的备用容量与工作容量比率。然而,由空闲与工作容量比定义的p循环效率受到网络拓扑结构的影响。需要一种有效的方法将链路添加到现有网络中,以利用p环。在这项工作中,提出了一种称为p环切割饱和(PCUT)的启发式方法。它扩展了众所周知的切断饱和启发式,策略性地向现有网络添加链路,以使用p循环降低网络中的空闲与工作容量比率。将PCUT应用于28节点的网络中,可以增加跨度,使空闲/工作容量比降低20%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信