可生存透明OFDM光网格中请求阻塞最小化

Sougata Das, M. Chatterjee
{"title":"可生存透明OFDM光网格中请求阻塞最小化","authors":"Sougata Das, M. Chatterjee","doi":"10.1109/CSI54720.2022.9924109","DOIUrl":null,"url":null,"abstract":"As Orthogonal Frequency Division Multiplexing (OFDM) allows flexible spectrum allocation, OFDM based optical grids have replaced traditional Wavelength Division Multiplexed (WDM) optical grids. Since a fiber-cut is the most common failure in optical networks and grids process resource intensive tasks, survivability is a key issue in designing optical grids. In a dynamic scenario, spectral fragmentation arises due to random arrival and departure of requests, leading to blocking of new requests. In this paper, we address the problem of survivability and minimizing request blocking in a dynamic scenario in OFDM based transparent optical grids. We propose a dynamic survivable route and spectrum allocation strategy. Time complexity analysis of the proposed algorithm Blocking Minimized Survivable Routing and Spectrum Allocation (BMSRSA), shows that it runs in polynomial time. Furthermore, intensive simulation experiments and performance comparisons with a well-known strategy show that the proposed strategy can lead to appreciable reduction in request blocking probability.","PeriodicalId":221137,"journal":{"name":"2022 International Conference on Connected Systems & Intelligence (CSI)","volume":"92 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Minimizing Request Blocking in Survivable Transparent OFDM Based Optical Grids\",\"authors\":\"Sougata Das, M. Chatterjee\",\"doi\":\"10.1109/CSI54720.2022.9924109\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"As Orthogonal Frequency Division Multiplexing (OFDM) allows flexible spectrum allocation, OFDM based optical grids have replaced traditional Wavelength Division Multiplexed (WDM) optical grids. Since a fiber-cut is the most common failure in optical networks and grids process resource intensive tasks, survivability is a key issue in designing optical grids. In a dynamic scenario, spectral fragmentation arises due to random arrival and departure of requests, leading to blocking of new requests. In this paper, we address the problem of survivability and minimizing request blocking in a dynamic scenario in OFDM based transparent optical grids. We propose a dynamic survivable route and spectrum allocation strategy. Time complexity analysis of the proposed algorithm Blocking Minimized Survivable Routing and Spectrum Allocation (BMSRSA), shows that it runs in polynomial time. Furthermore, intensive simulation experiments and performance comparisons with a well-known strategy show that the proposed strategy can lead to appreciable reduction in request blocking probability.\",\"PeriodicalId\":221137,\"journal\":{\"name\":\"2022 International Conference on Connected Systems & Intelligence (CSI)\",\"volume\":\"92 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-08-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 International Conference on Connected Systems & Intelligence (CSI)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CSI54720.2022.9924109\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 International Conference on Connected Systems & Intelligence (CSI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CSI54720.2022.9924109","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

由于正交频分复用(OFDM)技术允许灵活的频谱分配,基于OFDM的光网格已经取代了传统的波分复用(WDM)光网格。由于光纤切割是光网络和网格处理资源密集型任务中最常见的故障,因此生存性是设计光网格的关键问题。在动态场景下,由于请求的随机到达和离开,会产生频谱碎片,导致新请求被阻塞。本文研究了基于OFDM的透明光网格在动态场景下的生存性和最小化请求阻塞问题。提出了一种动态生存路由和频谱分配策略。对所提出的阻塞最小化存活路由和频谱分配算法(BMSRSA)的时间复杂度分析表明,该算法在多项式时间内运行。此外,大量的仿真实验和与已知策略的性能比较表明,所提出的策略可以显著降低请求阻塞概率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Minimizing Request Blocking in Survivable Transparent OFDM Based Optical Grids
As Orthogonal Frequency Division Multiplexing (OFDM) allows flexible spectrum allocation, OFDM based optical grids have replaced traditional Wavelength Division Multiplexed (WDM) optical grids. Since a fiber-cut is the most common failure in optical networks and grids process resource intensive tasks, survivability is a key issue in designing optical grids. In a dynamic scenario, spectral fragmentation arises due to random arrival and departure of requests, leading to blocking of new requests. In this paper, we address the problem of survivability and minimizing request blocking in a dynamic scenario in OFDM based transparent optical grids. We propose a dynamic survivable route and spectrum allocation strategy. Time complexity analysis of the proposed algorithm Blocking Minimized Survivable Routing and Spectrum Allocation (BMSRSA), shows that it runs in polynomial time. Furthermore, intensive simulation experiments and performance comparisons with a well-known strategy show that the proposed strategy can lead to appreciable reduction in request blocking probability.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信