Online lightpath provisioning and critical services: New IA-RWA algorithms to assure QoT and survivability

D. Adami, S. Giordano, M. Pagano, L. G. Zuliani
{"title":"Online lightpath provisioning and critical services: New IA-RWA algorithms to assure QoT and survivability","authors":"D. Adami, S. Giordano, M. Pagano, L. G. Zuliani","doi":"10.1109/HPSR.2011.5986011","DOIUrl":null,"url":null,"abstract":"Wavelength Routed Photonic (or all-optical) Networks (WRPNs) with an intelligent control plane will play a key role in providing the proper ground for future Internet applications. However, classic Routing and Wavelength Assignment (RWA) solutions are inadequate to be adopted by WRPNs. The main issues regard physical impairments and QoT, processing time and setup delay, lightpath (LP) survivability and minimization of resource allocation. In case of critical services provisioning, LPs must have tight QoT guarantees, even in case of network instability and failures. This work presents two new impairment-aware RWA (IA-RWA) algorithms, specifically tailored for the provisioning of critical services. These algorithms guarantee absolute bandwidth and Bit Error Rate (BER) for LPs, assuring survivability in case of single network failures. A high parallelizable, combined RWA engine minimizes resource utilization without increasing setup time. The performance of the proposed algorithms are evaluated with respect to a modified version of a previously proposed IA-RWA algorithm that takes into account QoT and survivability.","PeriodicalId":269137,"journal":{"name":"2011 IEEE 12th International Conference on High Performance Switching and Routing","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2011-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 IEEE 12th International Conference on High Performance Switching and Routing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/HPSR.2011.5986011","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Wavelength Routed Photonic (or all-optical) Networks (WRPNs) with an intelligent control plane will play a key role in providing the proper ground for future Internet applications. However, classic Routing and Wavelength Assignment (RWA) solutions are inadequate to be adopted by WRPNs. The main issues regard physical impairments and QoT, processing time and setup delay, lightpath (LP) survivability and minimization of resource allocation. In case of critical services provisioning, LPs must have tight QoT guarantees, even in case of network instability and failures. This work presents two new impairment-aware RWA (IA-RWA) algorithms, specifically tailored for the provisioning of critical services. These algorithms guarantee absolute bandwidth and Bit Error Rate (BER) for LPs, assuring survivability in case of single network failures. A high parallelizable, combined RWA engine minimizes resource utilization without increasing setup time. The performance of the proposed algorithms are evaluated with respect to a modified version of a previously proposed IA-RWA algorithm that takes into account QoT and survivability.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
在线光路配置和关键服务:新的IA-RWA算法,以确保QoT和生存能力
具有智能控制平面的波长路由光子(或全光)网络(wrpn)将在为未来的互联网应用提供适当的基础方面发挥关键作用。但是,传统的路由和波长分配(RWA)解决方案不适合wrpn采用。主要问题包括物理损伤和QoT,处理时间和设置延迟,光路(LP)生存能力和资源分配最小化。在提供关键业务的情况下,lp必须有严格的QoT保证,即使在网络不稳定和故障的情况下也是如此。这项工作提出了两种新的损伤感知RWA (IA-RWA)算法,专门为关键服务的提供量身定制。这些算法保证了lp的绝对带宽和误码率,保证了单网络故障时的生存能力。高并行性的组合RWA引擎可以在不增加设置时间的情况下最大限度地减少资源利用率。根据先前提出的IA-RWA算法的修改版本评估了所提出算法的性能,该算法考虑了QoT和生存性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Assessing network vulnerability under probabilistic region failure model Group-based two-hop relay with redundancy in MANETs Evaluating the energy-awareness of future Internet devices FPGA implementation of lookup algorithms StablePlus: A practical 100% throughput scheduling for input-queued switches
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1