On provision of availability guarantees using shared protection

A. Mykkeltveit, B. Helvik
{"title":"On provision of availability guarantees using shared protection","authors":"A. Mykkeltveit, B. Helvik","doi":"10.1109/ONDM.2008.4578406","DOIUrl":null,"url":null,"abstract":"The Internet has traditionally provided an undefined level of availability based on a best-effort restoration scheme, while the telecommunication networks have provided a somewhat higher level, primarily achieved by dedicated protection. In the coming next generation network, the introduction of new services that have different quality of service (QoS) requirements combined with cost conscious customers who make cost/utility trade-offs, yields a need for the network operators to be able to offer different levels of guaranteed availability. The challenge is to find schemes that can provide the guaranteed availability level requested by each connection while at the same time use bandwidth efficiently. Path protection is a well-known technique to improve the availability of connections in optical networks. When availability guarantees are to be offered, dedicated path protection is easily applicable since the availability of the connections can easily be predicted. Shared path protection, however, is more difficult to apply since the computations usually are more involved. In this paper, two schemes for on-line bandwidth-efficient connection-establishment exploiting shared protection are proposed. The schemes are compared through simulation studies on two realistic network topologies.","PeriodicalId":155835,"journal":{"name":"2008 International Conference on Optical Network Design and Modeling","volume":"46 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-03-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"14","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 International Conference on Optical Network Design and Modeling","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ONDM.2008.4578406","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 14

Abstract

The Internet has traditionally provided an undefined level of availability based on a best-effort restoration scheme, while the telecommunication networks have provided a somewhat higher level, primarily achieved by dedicated protection. In the coming next generation network, the introduction of new services that have different quality of service (QoS) requirements combined with cost conscious customers who make cost/utility trade-offs, yields a need for the network operators to be able to offer different levels of guaranteed availability. The challenge is to find schemes that can provide the guaranteed availability level requested by each connection while at the same time use bandwidth efficiently. Path protection is a well-known technique to improve the availability of connections in optical networks. When availability guarantees are to be offered, dedicated path protection is easily applicable since the availability of the connections can easily be predicted. Shared path protection, however, is more difficult to apply since the computations usually are more involved. In this paper, two schemes for on-line bandwidth-efficient connection-establishment exploiting shared protection are proposed. The schemes are compared through simulation studies on two realistic network topologies.
关于使用共享保护提供可用性保证
Internet传统上基于尽力而为的恢复方案提供了一个未定义的可用性级别,而电信网络提供了一个更高的级别,主要是通过专用保护实现的。在即将到来的下一代网络中,引入具有不同服务质量(QoS)要求的新服务,再加上注重成本/效用权衡的客户,需要网络运营商能够提供不同级别的保证可用性。面临的挑战是找到能够提供每个连接所要求的保证可用性级别的方案,同时有效地使用带宽。路径保护是一种众所周知的提高光网络连接可用性的技术。当要提供可用性保证时,专用路径保护很容易适用,因为可以很容易地预测连接的可用性。然而,共享路径保护更难应用,因为通常涉及更多的计算。本文提出了两种利用共享保护的在线带宽高效连接建立方案。通过对两种实际网络拓扑的仿真研究,对两种方案进行了比较。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信