{"title":"基于无环接口的快速路由技术","authors":"G. Enyedi, G. Rétvári","doi":"10.1109/NGI.2008.12","DOIUrl":null,"url":null,"abstract":"Nowadays, providing reliable network services is getting more and more important. However, traditional failure recovery methods in IP networks are typically reactive, therefore restoration often takes a long time. One of the most interesting solutions is interface-based fast rerouting, where not only the destination address but the incoming interface too is taken into consideration during forwarding packets in normal state and upon rerouting after a failure. Unfortunately, current methods are prone to form routing loops during the recovery process, which might make parts of the network unaffected by the failure unavailable. In this paper, we propose a new interface-based routing method, which always avoids loops at the price of a bit longer paths. We also present extensive simulation results to compare the traditional and our proposed algorithms.","PeriodicalId":182496,"journal":{"name":"2008 Next Generation Internet Networks","volume":"92 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-04-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"A Loop-Free Interface-Based Fast Reroute Technique\",\"authors\":\"G. Enyedi, G. Rétvári\",\"doi\":\"10.1109/NGI.2008.12\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Nowadays, providing reliable network services is getting more and more important. However, traditional failure recovery methods in IP networks are typically reactive, therefore restoration often takes a long time. One of the most interesting solutions is interface-based fast rerouting, where not only the destination address but the incoming interface too is taken into consideration during forwarding packets in normal state and upon rerouting after a failure. Unfortunately, current methods are prone to form routing loops during the recovery process, which might make parts of the network unaffected by the failure unavailable. In this paper, we propose a new interface-based routing method, which always avoids loops at the price of a bit longer paths. We also present extensive simulation results to compare the traditional and our proposed algorithms.\",\"PeriodicalId\":182496,\"journal\":{\"name\":\"2008 Next Generation Internet Networks\",\"volume\":\"92 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-04-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 Next Generation Internet Networks\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/NGI.2008.12\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 Next Generation Internet Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NGI.2008.12","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A Loop-Free Interface-Based Fast Reroute Technique
Nowadays, providing reliable network services is getting more and more important. However, traditional failure recovery methods in IP networks are typically reactive, therefore restoration often takes a long time. One of the most interesting solutions is interface-based fast rerouting, where not only the destination address but the incoming interface too is taken into consideration during forwarding packets in normal state and upon rerouting after a failure. Unfortunately, current methods are prone to form routing loops during the recovery process, which might make parts of the network unaffected by the failure unavailable. In this paper, we propose a new interface-based routing method, which always avoids loops at the price of a bit longer paths. We also present extensive simulation results to compare the traditional and our proposed algorithms.