{"title":"减少WDM光网络中的恢复阻塞","authors":"Zhi Liu, L. Ruan","doi":"10.1109/ICCCN.2005.1523877","DOIUrl":null,"url":null,"abstract":"In this paper, we study the problem of reducing restoration blocking probability in WDM optical networks. First, we present two reasons for restoration blocking: primary holding and mutual competition. Next, we propose two dynamic routing and wavelength assignment algorithms to address primary holding and give three heuristics to address mutual competition. Simulation results show that our algorithms can effectively reduce the restoration blocking probability without sacrificing working blocking probability.","PeriodicalId":379037,"journal":{"name":"Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.","volume":"153 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Reducing restoration blocking in WDM optical networks\",\"authors\":\"Zhi Liu, L. Ruan\",\"doi\":\"10.1109/ICCCN.2005.1523877\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we study the problem of reducing restoration blocking probability in WDM optical networks. First, we present two reasons for restoration blocking: primary holding and mutual competition. Next, we propose two dynamic routing and wavelength assignment algorithms to address primary holding and give three heuristics to address mutual competition. Simulation results show that our algorithms can effectively reduce the restoration blocking probability without sacrificing working blocking probability.\",\"PeriodicalId\":379037,\"journal\":{\"name\":\"Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.\",\"volume\":\"153 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-10-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCCN.2005.1523877\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. 14th International Conference on Computer Communications and Networks, 2005. ICCCN 2005.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCCN.2005.1523877","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Reducing restoration blocking in WDM optical networks
In this paper, we study the problem of reducing restoration blocking probability in WDM optical networks. First, we present two reasons for restoration blocking: primary holding and mutual competition. Next, we propose two dynamic routing and wavelength assignment algorithms to address primary holding and give three heuristics to address mutual competition. Simulation results show that our algorithms can effectively reduce the restoration blocking probability without sacrificing working blocking probability.