{"title":"CoSE:一种srlg -不相交路由算法","authors":"M. Rostami, S. Khorsandi, A. A. Khodaparast","doi":"10.1109/ECUMN.2007.15","DOIUrl":null,"url":null,"abstract":"A SRLG is a group of network links that share a common physical resource whose failure will cause the failure of all links of the group. To protect a logical connection in a network from a single SRLG failure, two different paths are usually assigned to the connection. The two paths must be disjoint to avoid synchronous failure. In this paper, we extend a high-performance link-disjoint routing algorithm called CoLE to SRLG-disjoint routing. The analysis and the simulation results demonstrate improvement over the previous algorithms","PeriodicalId":202819,"journal":{"name":"Fourth European Conference on Universal Multiservice Networks (ECUMN'07)","volume":"200 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-02-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"23","resultStr":"{\"title\":\"CoSE: A SRLG-Disjoint Routing Algorithm\",\"authors\":\"M. Rostami, S. Khorsandi, A. A. Khodaparast\",\"doi\":\"10.1109/ECUMN.2007.15\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A SRLG is a group of network links that share a common physical resource whose failure will cause the failure of all links of the group. To protect a logical connection in a network from a single SRLG failure, two different paths are usually assigned to the connection. The two paths must be disjoint to avoid synchronous failure. In this paper, we extend a high-performance link-disjoint routing algorithm called CoLE to SRLG-disjoint routing. The analysis and the simulation results demonstrate improvement over the previous algorithms\",\"PeriodicalId\":202819,\"journal\":{\"name\":\"Fourth European Conference on Universal Multiservice Networks (ECUMN'07)\",\"volume\":\"200 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-02-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"23\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Fourth European Conference on Universal Multiservice Networks (ECUMN'07)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ECUMN.2007.15\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Fourth European Conference on Universal Multiservice Networks (ECUMN'07)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ECUMN.2007.15","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A SRLG is a group of network links that share a common physical resource whose failure will cause the failure of all links of the group. To protect a logical connection in a network from a single SRLG failure, two different paths are usually assigned to the connection. The two paths must be disjoint to avoid synchronous failure. In this paper, we extend a high-performance link-disjoint routing algorithm called CoLE to SRLG-disjoint routing. The analysis and the simulation results demonstrate improvement over the previous algorithms
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
