Adaptive-Cost Shortest Path Based Heuristic for Space Division Multiplexing Networks

Mehdi Mrad, Umar S. Suryahatmaja, Abdelrahman Ossama Elsayed, A. Gharbi, M. Esmail
{"title":"Adaptive-Cost Shortest Path Based Heuristic for Space Division Multiplexing Networks","authors":"Mehdi Mrad, Umar S. Suryahatmaja, Abdelrahman Ossama Elsayed, A. Gharbi, M. Esmail","doi":"10.1109/IC_ASET53395.2022.9765912","DOIUrl":null,"url":null,"abstract":"The total Internet traffic is rapidly rising as a result of the growing popularity of various network services. One of the network types is mesh network where space division multiplexing (SDM) has become an interesting approach to deal with the upcoming capacity crisis issue. SDM's key concept is to take advantage of the spatial dimension to significantly increase transmission system power. In this paper, we present an adaptive cost shortest path based heuristic for flexgrid SDM optical networks. The preliminary experimental results show a promising performance in terms of minimizing the highest used number of slices over all the links/cores of the network.","PeriodicalId":6874,"journal":{"name":"2022 5th International Conference on Advanced Systems and Emergent Technologies (IC_ASET)","volume":"141 1","pages":"132-137"},"PeriodicalIF":0.0000,"publicationDate":"2022-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 5th International Conference on Advanced Systems and Emergent Technologies (IC_ASET)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IC_ASET53395.2022.9765912","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

The total Internet traffic is rapidly rising as a result of the growing popularity of various network services. One of the network types is mesh network where space division multiplexing (SDM) has become an interesting approach to deal with the upcoming capacity crisis issue. SDM's key concept is to take advantage of the spatial dimension to significantly increase transmission system power. In this paper, we present an adaptive cost shortest path based heuristic for flexgrid SDM optical networks. The preliminary experimental results show a promising performance in terms of minimizing the highest used number of slices over all the links/cores of the network.
基于自适应代价最短路径的空分复用网络启发式算法
由于各种网络服务的日益普及,互联网的总流量正在迅速上升。其中一种网络类型是网状网络,其中空分复用(SDM)已成为解决即将到来的容量危机问题的一种有趣的方法。SDM的关键概念是利用空间维度来显著提高传输系统功率。本文提出了一种基于自适应代价最短路径的柔性网格SDM光网络启发式算法。初步实验结果表明,在最小化网络所有链路/核心上的最高使用切片数量方面,该算法具有良好的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信