{"title":"单点网络恢复算法的设计与分析","authors":"C. E. Chow, A. Hansmats","doi":"10.1109/PCCC.1999.749440","DOIUrl":null,"url":null,"abstract":"To improve the reliability, broadband optical networks require fast restoration from single-link failures, node failures and multiple-link failures. This paper presents two distributed network restoration algorithms based on the one prong approach. DFOP uses a depth first search approach with a time-out mechanism to collect more network topology information. BFOP uses a breadth first search approach and a time-out mechanism to explore restoration paths with shorter hop count to reduce spare usage. They can handle single-link failures, node failures, multiple link failures and area failures. Comparisons of these algorithms with an adaptive one prong algorithm are also presented.","PeriodicalId":211210,"journal":{"name":"1999 IEEE International Performance, Computing and Communications Conference (Cat. No.99CH36305)","volume":"82 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1999-02-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Design and analysis of one prong network restoration algorithms\",\"authors\":\"C. E. Chow, A. Hansmats\",\"doi\":\"10.1109/PCCC.1999.749440\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"To improve the reliability, broadband optical networks require fast restoration from single-link failures, node failures and multiple-link failures. This paper presents two distributed network restoration algorithms based on the one prong approach. DFOP uses a depth first search approach with a time-out mechanism to collect more network topology information. BFOP uses a breadth first search approach and a time-out mechanism to explore restoration paths with shorter hop count to reduce spare usage. They can handle single-link failures, node failures, multiple link failures and area failures. Comparisons of these algorithms with an adaptive one prong algorithm are also presented.\",\"PeriodicalId\":211210,\"journal\":{\"name\":\"1999 IEEE International Performance, Computing and Communications Conference (Cat. No.99CH36305)\",\"volume\":\"82 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1999-02-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"1999 IEEE International Performance, Computing and Communications Conference (Cat. No.99CH36305)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PCCC.1999.749440\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"1999 IEEE International Performance, Computing and Communications Conference (Cat. No.99CH36305)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PCCC.1999.749440","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Design and analysis of one prong network restoration algorithms
To improve the reliability, broadband optical networks require fast restoration from single-link failures, node failures and multiple-link failures. This paper presents two distributed network restoration algorithms based on the one prong approach. DFOP uses a depth first search approach with a time-out mechanism to collect more network topology information. BFOP uses a breadth first search approach and a time-out mechanism to explore restoration paths with shorter hop count to reduce spare usage. They can handle single-link failures, node failures, multiple link failures and area failures. Comparisons of these algorithms with an adaptive one prong algorithm are also presented.