光网络路由和波长分配算法的比较

2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552) Pub Date : 2001-05-29 DOI:10.1109/HPSR.2001.923621

S. Ohta, A. Greca

{"title":"光网络路由和波长分配算法的比较","authors":"S. Ohta, A. Greca","doi":"10.1109/HPSR.2001.923621","DOIUrl":null,"url":null,"abstract":"The routing and wavelength assignment algorithm is indispensable to operate optical networks, which consist of the wavelength division multiplexing technique and optical cross-connect systems. This paper focuses on the routing and wavelength algorithm that minimizes the number of wavelengths for the static path demand situation. The paper shows that the routing problem and the wavelength assignment problem can be solved simultaneously by employing the multicommodity flow model, which has been comprehensively studied in the literature. On the basis of this notion, a heuristic routing and wavelength assignment algorithm is proposed. Through numerical examples, the proposed algorithm is compared with conventional algorithms that run under the same criteria.","PeriodicalId":308964,"journal":{"name":"2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552)","volume":"85 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"Comparison of routing and wavelength assignment algorithms for optical networks\",\"authors\":\"S. Ohta, A. Greca\",\"doi\":\"10.1109/HPSR.2001.923621\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The routing and wavelength assignment algorithm is indispensable to operate optical networks, which consist of the wavelength division multiplexing technique and optical cross-connect systems. This paper focuses on the routing and wavelength algorithm that minimizes the number of wavelengths for the static path demand situation. The paper shows that the routing problem and the wavelength assignment problem can be solved simultaneously by employing the multicommodity flow model, which has been comprehensively studied in the literature. On the basis of this notion, a heuristic routing and wavelength assignment algorithm is proposed. Through numerical examples, the proposed algorithm is compared with conventional algorithms that run under the same criteria.\",\"PeriodicalId\":308964,\"journal\":{\"name\":\"2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552)\",\"volume\":\"85 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-05-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/HPSR.2001.923621\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/HPSR.2001.923621","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 8

摘要

光网络由波分复用技术和光交叉连接系统组成，路由和波长分配算法是运行光网络不可缺少的。针对静态路径需求情况，本文重点研究了最小化波长数的路由和波长算法。本文表明，采用多商品流模型可以同时解决路由问题和波长分配问题，该模型已得到文献的全面研究。在此基础上，提出了一种启发式路由和波长分配算法。通过数值算例，将该算法与在相同准则下运行的传统算法进行了比较。

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

查看原文本刊更多论文

Comparison of routing and wavelength assignment algorithms for optical networks

The routing and wavelength assignment algorithm is indispensable to operate optical networks, which consist of the wavelength division multiplexing technique and optical cross-connect systems. This paper focuses on the routing and wavelength algorithm that minimizes the number of wavelengths for the static path demand situation. The paper shows that the routing problem and the wavelength assignment problem can be solved simultaneously by employing the multicommodity flow model, which has been comprehensively studied in the literature. On the basis of this notion, a heuristic routing and wavelength assignment algorithm is proposed. Through numerical examples, the proposed algorithm is compared with conventional algorithms that run under the same criteria.

求助全文

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

来源期刊

2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552)

自引率

0.00%

发文量