{"title":"OSPF/IS-IS网络的快速重路由方案","authors":"Yong Liu, A. Reddy","doi":"10.1109/ICCCN.2004.1401585","DOIUrl":null,"url":null,"abstract":"Most current backbone networks use link-state protocol, OSPF or IS-IS, as their intra-domain routing protocol. Link-state protocols perform global routing table update to route around the failures. It usually takes seconds. As real-time applications like VoIP emerge in recent years, there is a requirement for a fast rerouting mechanism to route around failures before all routers on the network update their routing tables. In addition, fast rerouting is more appropriate than global routing table update when failures are transient. We propose such a fast rerouting extension for link-state protocols. In our approach, when a link fails, the affected traffic is rerouted along a pre-computed rerouting path. In case rerouting cannot be done locally, the local router signals the minimal number of upstream routers to setup the rerouting path for rerouting. We propose algorithms that simplify the rerouting operation and the rerouting path setup. With a simple extension to the current link state protocols, our scheme can route around failures faster and involves minimal number of routers for rerouting.","PeriodicalId":229045,"journal":{"name":"Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"38","resultStr":"{\"title\":\"A fast rerouting scheme for OSPF/IS-IS networks\",\"authors\":\"Yong Liu, A. Reddy\",\"doi\":\"10.1109/ICCCN.2004.1401585\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Most current backbone networks use link-state protocol, OSPF or IS-IS, as their intra-domain routing protocol. Link-state protocols perform global routing table update to route around the failures. It usually takes seconds. As real-time applications like VoIP emerge in recent years, there is a requirement for a fast rerouting mechanism to route around failures before all routers on the network update their routing tables. In addition, fast rerouting is more appropriate than global routing table update when failures are transient. We propose such a fast rerouting extension for link-state protocols. In our approach, when a link fails, the affected traffic is rerouted along a pre-computed rerouting path. In case rerouting cannot be done locally, the local router signals the minimal number of upstream routers to setup the rerouting path for rerouting. We propose algorithms that simplify the rerouting operation and the rerouting path setup. With a simple extension to the current link state protocols, our scheme can route around failures faster and involves minimal number of routers for rerouting.\",\"PeriodicalId\":229045,\"journal\":{\"name\":\"Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969)\",\"volume\":\"7 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-10-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"38\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCCN.2004.1401585\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCCN.2004.1401585","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Most current backbone networks use link-state protocol, OSPF or IS-IS, as their intra-domain routing protocol. Link-state protocols perform global routing table update to route around the failures. It usually takes seconds. As real-time applications like VoIP emerge in recent years, there is a requirement for a fast rerouting mechanism to route around failures before all routers on the network update their routing tables. In addition, fast rerouting is more appropriate than global routing table update when failures are transient. We propose such a fast rerouting extension for link-state protocols. In our approach, when a link fails, the affected traffic is rerouted along a pre-computed rerouting path. In case rerouting cannot be done locally, the local router signals the minimal number of upstream routers to setup the rerouting path for rerouting. We propose algorithms that simplify the rerouting operation and the rerouting path setup. With a simple extension to the current link state protocols, our scheme can route around failures faster and involves minimal number of routers for rerouting.