GMPLS光网络中(M:N) N种故障恢复方案的备份资源池

K. Sriram, D. Griffith, Sukyoung Lee, N. Golmie
{"title":"GMPLS光网络中(M:N) N种故障恢复方案的备份资源池","authors":"K. Sriram, D. Griffith, Sukyoung Lee, N. Golmie","doi":"10.1117/12.533330","DOIUrl":null,"url":null,"abstract":"In resilient optical networks, there is a tradeoff between the amount of resources allocated for protection versus the probability that a failed working path can not be recovered, known as protection blocking probability. Often the network topology permits multiple protected groups of working paths (WPs) to share protection bandwidth and other network resources. The Common Control and Measurement Plane (CCAMP) working group in the IETF has defined an (M:N)n shared recovery scheme, in which defined n WP groups each consisting of N WPs and M backup paths (BPs) share some or all of the BP resources. In this paper, we present an analytical model that predicts protection blocking probability as a function of BP resource sharing for this shared recovery scheme. We also propose an algorithm that efficiently manages BP resources while doing protection assignments. We provide numerical results that highlight the benefits and tradeoffs involved. Our analytical model can assist in providing engineering guidelines to service providers so that they can effectively allocate resources and manage protection and restoration in their networks.","PeriodicalId":187370,"journal":{"name":"OptiComm: Optical Networking and Communications Conference","volume":"50 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":"{\"title\":\"Backup resource pooling in (M:N)n fault recovery schemes in GMPLS optical networks\",\"authors\":\"K. Sriram, D. Griffith, Sukyoung Lee, N. Golmie\",\"doi\":\"10.1117/12.533330\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In resilient optical networks, there is a tradeoff between the amount of resources allocated for protection versus the probability that a failed working path can not be recovered, known as protection blocking probability. Often the network topology permits multiple protected groups of working paths (WPs) to share protection bandwidth and other network resources. The Common Control and Measurement Plane (CCAMP) working group in the IETF has defined an (M:N)n shared recovery scheme, in which defined n WP groups each consisting of N WPs and M backup paths (BPs) share some or all of the BP resources. In this paper, we present an analytical model that predicts protection blocking probability as a function of BP resource sharing for this shared recovery scheme. We also propose an algorithm that efficiently manages BP resources while doing protection assignments. We provide numerical results that highlight the benefits and tradeoffs involved. Our analytical model can assist in providing engineering guidelines to service providers so that they can effectively allocate resources and manage protection and restoration in their networks.\",\"PeriodicalId\":187370,\"journal\":{\"name\":\"OptiComm: Optical Networking and Communications Conference\",\"volume\":\"50 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2003-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"13\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"OptiComm: Optical Networking and Communications Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1117/12.533330\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"OptiComm: Optical Networking and Communications Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1117/12.533330","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 13

摘要

在弹性光网络中,在分配用于保护的资源数量与失效工作路径无法恢复的概率(称为保护阻塞概率)之间存在权衡。通常,网络拓扑允许多个工作路径保护组共享保护带宽和其他网络资源。IETF的CCAMP (Common Control and Measurement Plane)工作组定义了(M:N) N共享恢复方案,即由N个WP和M个备份路径组成的N个WP组共享部分或全部BP资源。本文提出了一种基于BP资源共享的保护阻塞概率预测模型。我们还提出了一种在执行保护分配时有效管理BP资源的算法。我们提供了数字结果,突出了所涉及的好处和权衡。我们的分析模型可以帮助为服务提供商提供工程指导,使他们能够有效地分配资源并管理其网络中的保护和恢复。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Backup resource pooling in (M:N)n fault recovery schemes in GMPLS optical networks
In resilient optical networks, there is a tradeoff between the amount of resources allocated for protection versus the probability that a failed working path can not be recovered, known as protection blocking probability. Often the network topology permits multiple protected groups of working paths (WPs) to share protection bandwidth and other network resources. The Common Control and Measurement Plane (CCAMP) working group in the IETF has defined an (M:N)n shared recovery scheme, in which defined n WP groups each consisting of N WPs and M backup paths (BPs) share some or all of the BP resources. In this paper, we present an analytical model that predicts protection blocking probability as a function of BP resource sharing for this shared recovery scheme. We also propose an algorithm that efficiently manages BP resources while doing protection assignments. We provide numerical results that highlight the benefits and tradeoffs involved. Our analytical model can assist in providing engineering guidelines to service providers so that they can effectively allocate resources and manage protection and restoration in their networks.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信