WDM光网络的自适应动态波长路由

2006 IFIP International Conference on Wireless and Optical Communications Networks Pub Date : 2006-08-07 DOI:10.1109/WOCN.2006.1666649

K. Roy, M. K. Naskar, U. Biswas

{"title":"WDM光网络的自适应动态波长路由","authors":"K. Roy, M. K. Naskar, U. Biswas","doi":"10.1109/WOCN.2006.1666649","DOIUrl":null,"url":null,"abstract":"In this article, an efficient heuristic approach for routing and wavelength assignment (RWA) in WDM optical networks is proposed. The method is based on the selection of shortest path or alternate shortest path depending on the number of overlaps of a new route with the non-terminated calls. Comparative studies with the previous work demonstrate the superiority of the proposed algorithm","PeriodicalId":275012,"journal":{"name":"2006 IFIP International Conference on Wireless and Optical Communications Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":"{\"title\":\"Adaptive dynamic wavelength routing for WDM optical networks\",\"authors\":\"K. Roy, M. K. Naskar, U. Biswas\",\"doi\":\"10.1109/WOCN.2006.1666649\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this article, an efficient heuristic approach for routing and wavelength assignment (RWA) in WDM optical networks is proposed. The method is based on the selection of shortest path or alternate shortest path depending on the number of overlaps of a new route with the non-terminated calls. Comparative studies with the previous work demonstrate the superiority of the proposed algorithm\",\"PeriodicalId\":275012,\"journal\":{\"name\":\"2006 IFIP International Conference on Wireless and Optical Communications Networks\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-08-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"10\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 IFIP International Conference on Wireless and Optical Communications Networks\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WOCN.2006.1666649\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 IFIP International Conference on Wireless and Optical Communications Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WOCN.2006.1666649","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 10

摘要

本文提出了一种有效的启发式WDM光网络路由和波长分配(RWA)算法。该方法基于根据新路由与未终止呼叫的重叠次数选择最短路径或备用最短路径。通过与前人的比较研究，证明了该算法的优越性

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

查看原文本刊更多论文

Adaptive dynamic wavelength routing for WDM optical networks

In this article, an efficient heuristic approach for routing and wavelength assignment (RWA) in WDM optical networks is proposed. The method is based on the selection of shortest path or alternate shortest path depending on the number of overlaps of a new route with the non-terminated calls. Comparative studies with the previous work demonstrate the superiority of the proposed algorithm

求助全文

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

来源期刊

2006 IFIP International Conference on Wireless and Optical Communications Networks

自引率

0.00%

发文量