Bijal Patel, Haiyang Ji, S. Nayak, Ting Ding, Yue Pan, Michal Aibin
{"title":"On Efficient Candidate Path Selection for Dynamic Routing in Elastic Optical Networks","authors":"Bijal Patel, Haiyang Ji, S. Nayak, Ting Ding, Yue Pan, Michal Aibin","doi":"10.1109/UEMCON51285.2020.9298119","DOIUrl":null,"url":null,"abstract":"Elastic Optical Networks are based on the Orthogonal frequency-division multiplexing (OFDM), thus providing a more efficient and flexible data-transferring network than fixed-grid WDM networks. In this paper we solve the Routing, Modulation and Spectrum Assignment (RMSA) problem. For this purpose, we design a new, highly efficient Adaptive Dynamic Routing Algorithm (ADRA). Our results show that it outperforms other methods from the literature.","PeriodicalId":433609,"journal":{"name":"2020 11th IEEE Annual Ubiquitous Computing, Electronics & Mobile Communication Conference (UEMCON)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 11th IEEE Annual Ubiquitous Computing, Electronics & Mobile Communication Conference (UEMCON)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/UEMCON51285.2020.9298119","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
Abstract
Elastic Optical Networks are based on the Orthogonal frequency-division multiplexing (OFDM), thus providing a more efficient and flexible data-transferring network than fixed-grid WDM networks. In this paper we solve the Routing, Modulation and Spectrum Assignment (RMSA) problem. For this purpose, we design a new, highly efficient Adaptive Dynamic Routing Algorithm (ADRA). Our results show that it outperforms other methods from the literature.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
