{"title":"一种新的路径保护p环启发式算法","authors":"Feng Zhang, W. Zhong","doi":"10.1109/ICTON.2006.248436","DOIUrl":null,"url":null,"abstract":"We propose a novel path-protecting p-cycle heuristic algorithm for survivable WDM network design. Numerical studies show that p-cycle based path protection for span and node failure recovery is capacity efficient and robust","PeriodicalId":208725,"journal":{"name":"2006 International Conference on Transparent Optical Networks","volume":"36 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"A Novel Path-Protecting p-Cycle Heuristic Algorithm\",\"authors\":\"Feng Zhang, W. Zhong\",\"doi\":\"10.1109/ICTON.2006.248436\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We propose a novel path-protecting p-cycle heuristic algorithm for survivable WDM network design. Numerical studies show that p-cycle based path protection for span and node failure recovery is capacity efficient and robust\",\"PeriodicalId\":208725,\"journal\":{\"name\":\"2006 International Conference on Transparent Optical Networks\",\"volume\":\"36 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-11-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 International Conference on Transparent Optical Networks\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICTON.2006.248436\",\"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 International Conference on Transparent Optical Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICTON.2006.248436","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A Novel Path-Protecting p-Cycle Heuristic Algorithm
We propose a novel path-protecting p-cycle heuristic algorithm for survivable WDM network design. Numerical studies show that p-cycle based path protection for span and node failure recovery is capacity efficient and robust
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
