{"title":"波长转换稀疏的WDM网络中一种低成本时延约束路由与波长分配算法","authors":"Qiwu Wu, Xianwei Zhou, Jianping Wang, Zhizhong Yin, Ling-zhi Jiang","doi":"10.1109/SOPO.2009.5230198","DOIUrl":null,"url":null,"abstract":"In this paper, we propose a colored multigraph model for the temporarily available wavelengths. Based on this colored multigraph model, a low-cost delay-constrained routing algorithm is proposed by applying the K-shortest-path strategy. The proposed algorithm has the following advantages: (1) finish routing and wavelength assignment in one step; (2) the total cost of lightpath is low; (3) the delay from the source node to the destination node is bounded. Simulation results show that the proposed algorithm works well and achieves satisfactory blocking probability.","PeriodicalId":6416,"journal":{"name":"2009 Symposium on Photonics and Optoelectronics","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2009-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"A Low-Cost Delay-Constrained Routing and Wavelength Assignment Algorithm in WDM Networks with Sparse Wavelength Conversions\",\"authors\":\"Qiwu Wu, Xianwei Zhou, Jianping Wang, Zhizhong Yin, Ling-zhi Jiang\",\"doi\":\"10.1109/SOPO.2009.5230198\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we propose a colored multigraph model for the temporarily available wavelengths. Based on this colored multigraph model, a low-cost delay-constrained routing algorithm is proposed by applying the K-shortest-path strategy. The proposed algorithm has the following advantages: (1) finish routing and wavelength assignment in one step; (2) the total cost of lightpath is low; (3) the delay from the source node to the destination node is bounded. Simulation results show that the proposed algorithm works well and achieves satisfactory blocking probability.\",\"PeriodicalId\":6416,\"journal\":{\"name\":\"2009 Symposium on Photonics and Optoelectronics\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 Symposium on Photonics and Optoelectronics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SOPO.2009.5230198\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 Symposium on Photonics and Optoelectronics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SOPO.2009.5230198","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A Low-Cost Delay-Constrained Routing and Wavelength Assignment Algorithm in WDM Networks with Sparse Wavelength Conversions
In this paper, we propose a colored multigraph model for the temporarily available wavelengths. Based on this colored multigraph model, a low-cost delay-constrained routing algorithm is proposed by applying the K-shortest-path strategy. The proposed algorithm has the following advantages: (1) finish routing and wavelength assignment in one step; (2) the total cost of lightpath is low; (3) the delay from the source node to the destination node is bounded. Simulation results show that the proposed algorithm works well and achieves satisfactory blocking probability.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
