{"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%.