OSPF/IS-IS网络的快速重路由方案

Yong Liu, A. Reddy
{"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}
引用次数: 38

摘要

目前大多数骨干网采用链路状态协议、OSPF或IS-IS作为域内路由协议。链路状态协议执行全局路由表更新以绕过故障。通常只需要几秒钟。随着VoIP等实时应用的出现,在网络上的所有路由器更新路由表之前,需要一种快速的重路由机制来绕过故障。此外,当故障是暂时的时,快速重路由比全局路由表更新更合适。我们为链路状态协议提出了这样一个快速重路由扩展。在我们的方法中,当链路故障时,受影响的流量沿着预先计算的重路由路径重新路由。当本地无法完成重路由时,本地路由器发送信号给最小上行路由器,建立重路由路径进行重路由。我们提出了简化重路由操作和重路由路径设置的算法。通过对当前链路状态协议的简单扩展,我们的方案可以更快地绕过故障,并且需要最少数量的路由器进行重路由。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A fast rerouting scheme for OSPF/IS-IS networks
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信