Vishwanath M Bhadrashetti, Garima Pathak, Shrikanth B Tantry, Dr. Prakash Biswagar, S. M, Sourabh P Nagesh
{"title":"Performance Analysis of Routing and Wavelength Assignment in Optical networks","authors":"Vishwanath M Bhadrashetti, Garima Pathak, Shrikanth B Tantry, Dr. Prakash Biswagar, S. M, Sourabh P Nagesh","doi":"10.1109/ICATIECE45860.2019.9063853","DOIUrl":null,"url":null,"abstract":"The routing and wavelength assignment problem is a significant problem faced in any optical network. This problem is a significant problem faced in any optical network. This problem can be solved by splitting it into two problems. First, the routing problem is tackled and an optimal routing network is obtained. After this, the wavelength assignment problem is tackled and the right wavelengths are chosen for each path. In this paper, we look into two shortest path first routing algorithms, namely Dijkstra’s algorithm and the Genetic Approach algorithm and compares the results. Two wavelength assignment algorithms, random fit algorithm and first fit algorithm are compared and the results are tabulated. All simulations and results are observed on MATLAB and Python.","PeriodicalId":106496,"journal":{"name":"2019 1st International Conference on Advanced Technologies in Intelligent Control, Environment, Computing & Communication Engineering (ICATIECE)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 1st International Conference on Advanced Technologies in Intelligent Control, Environment, Computing & Communication Engineering (ICATIECE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICATIECE45860.2019.9063853","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
Abstract
The routing and wavelength assignment problem is a significant problem faced in any optical network. This problem is a significant problem faced in any optical network. This problem can be solved by splitting it into two problems. First, the routing problem is tackled and an optimal routing network is obtained. After this, the wavelength assignment problem is tackled and the right wavelengths are chosen for each path. In this paper, we look into two shortest path first routing algorithms, namely Dijkstra’s algorithm and the Genetic Approach algorithm and compares the results. Two wavelength assignment algorithms, random fit algorithm and first fit algorithm are compared and the results are tabulated. All simulations and results are observed on MATLAB and Python.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
