光网络中路由和波长分配的性能分析

2019 1st International Conference on Advanced Technologies in Intelligent Control, Environment, Computing & Communication Engineering (ICATIECE) Pub Date : 2019-03-01 DOI:10.1109/ICATIECE45860.2019.9063853

Vishwanath M Bhadrashetti, Garima Pathak, Shrikanth B Tantry, Dr. Prakash Biswagar, S. M, Sourabh P Nagesh

{"title":"光网络中路由和波长分配的性能分析","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":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2019-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"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\":null,\"pages\":null},\"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}","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

摘要

路由和波长分配问题是任何光网络都面临的一个重要问题。这个问题是任何光网络都面临的一个重要问题。这个问题可以分成两个问题来解决。首先，解决了路由问题，得到了最优路由网络。然后，解决波长分配问题，为每条路径选择合适的波长。本文研究了两种最短路径优先路由算法，即Dijkstra算法和遗传算法，并对结果进行了比较。比较了随机拟合算法和首次拟合算法两种波长分配算法，并将结果制成表格。所有的仿真和结果都在MATLAB和Python上进行了观察。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Performance Analysis of Routing and Wavelength Assignment in Optical networks

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2019 1st International Conference on Advanced Technologies in Intelligent Control, Environment, Computing & Communication Engineering (ICATIECE)

自引率

0.00%

发文量