{"title":"具有共享风险链路组的WDM网络中各种路由问题的算法","authors":"X. Pan, Gaoxi Xiao","doi":"10.1109/ICCS.2004.1359403","DOIUrl":null,"url":null,"abstract":"In this paper, we study the heuristic algorithms for finding two paths that are not passing through any same shared risk link group (SRLG) between each pair of source-destination nodes. For this NP-complete problem, we design a heuristic algorithm which steadily outperforms the best existing algorithm in the first several iterations. When larger number of iterations is allowed, we show that several different algorithms manage to perform nearly the same, which provides some helpful insight into how to further improve the algorithm in the future","PeriodicalId":333629,"journal":{"name":"The Ninth International Conference onCommunications Systems, 2004. ICCS 2004.","volume":"51 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Algorithms for the diverse routing problem in WDM networks with shared risk link groups\",\"authors\":\"X. Pan, Gaoxi Xiao\",\"doi\":\"10.1109/ICCS.2004.1359403\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we study the heuristic algorithms for finding two paths that are not passing through any same shared risk link group (SRLG) between each pair of source-destination nodes. For this NP-complete problem, we design a heuristic algorithm which steadily outperforms the best existing algorithm in the first several iterations. When larger number of iterations is allowed, we show that several different algorithms manage to perform nearly the same, which provides some helpful insight into how to further improve the algorithm in the future\",\"PeriodicalId\":333629,\"journal\":{\"name\":\"The Ninth International Conference onCommunications Systems, 2004. ICCS 2004.\",\"volume\":\"51 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-11-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"The Ninth International Conference onCommunications Systems, 2004. ICCS 2004.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCS.2004.1359403\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"The Ninth International Conference onCommunications Systems, 2004. ICCS 2004.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCS.2004.1359403","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Algorithms for the diverse routing problem in WDM networks with shared risk link groups
In this paper, we study the heuristic algorithms for finding two paths that are not passing through any same shared risk link group (SRLG) between each pair of source-destination nodes. For this NP-complete problem, we design a heuristic algorithm which steadily outperforms the best existing algorithm in the first several iterations. When larger number of iterations is allowed, we show that several different algorithms manage to perform nearly the same, which provides some helpful insight into how to further improve the algorithm in the future
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
