IP Fast Reroute: NotVia with Early Decapsulation

Qing Li, Mingwei Xu, Qi Li, Dan Wang, Yong Cui
{"title":"IP Fast Reroute: NotVia with Early Decapsulation","authors":"Qing Li, Mingwei Xu, Qi Li, Dan Wang, Yong Cui","doi":"10.1109/GLOCOM.2010.5683637","DOIUrl":null,"url":null,"abstract":"Network survivability is an important topic for the Internet. To improve the performance of the Internet during failure, IP Fast Reroute (IPFRR) mechanisms are proposed to establish backup routes for failure-affected packets. NotVia, a most prominent one, provides 100% protection coverage for single-node failures. However, it brings in nontrivial computing and memory pressure to routers with special NotVia addresses, in which only some are necessary for a specific router. Besides, the protection path of NotVia is 20% longer than the optimal path on average. In this paper, we propose early decapsulated NotVia (ED-NotVia) handling the aforementioned problems and thus making NotVia more practical. We first analyze the properties of necessary NotVia addresses to any specific node. Then we develop a heuristic Nec-NotVia Algorithm for a node to find the necessary NotVia addresses and compute routes for them, where unnecessary addresses are eliminated. Based on this elimination, early decapsulation is imported to optimize the protection path with marginal overhead. We evaluate our algorithm and demonstrate the effectiveness of ED-NotVia using topologies from Rocketfuel and Brite. The results show that 1) only 5% to 20% of SPT(Shortest Path Tree)-related NotVia addresses (1.23% to 6.41% of all the NotVia addresses) in an AS are necessary for a node; 2) by computing the routes for 15% to 40% SPT-related NotVia addresses, ED-NotVia provides 98% protection coverage; and 3) the protection path stretch ratio of ED-NotVia is only 1.03 on average as compared to 1.20 for NotVia.","PeriodicalId":6448,"journal":{"name":"2010 IEEE Global Telecommunications Conference GLOBECOM 2010","volume":"3 1","pages":"1-6"},"PeriodicalIF":0.0000,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE Global Telecommunications Conference GLOBECOM 2010","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GLOCOM.2010.5683637","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

Network survivability is an important topic for the Internet. To improve the performance of the Internet during failure, IP Fast Reroute (IPFRR) mechanisms are proposed to establish backup routes for failure-affected packets. NotVia, a most prominent one, provides 100% protection coverage for single-node failures. However, it brings in nontrivial computing and memory pressure to routers with special NotVia addresses, in which only some are necessary for a specific router. Besides, the protection path of NotVia is 20% longer than the optimal path on average. In this paper, we propose early decapsulated NotVia (ED-NotVia) handling the aforementioned problems and thus making NotVia more practical. We first analyze the properties of necessary NotVia addresses to any specific node. Then we develop a heuristic Nec-NotVia Algorithm for a node to find the necessary NotVia addresses and compute routes for them, where unnecessary addresses are eliminated. Based on this elimination, early decapsulation is imported to optimize the protection path with marginal overhead. We evaluate our algorithm and demonstrate the effectiveness of ED-NotVia using topologies from Rocketfuel and Brite. The results show that 1) only 5% to 20% of SPT(Shortest Path Tree)-related NotVia addresses (1.23% to 6.41% of all the NotVia addresses) in an AS are necessary for a node; 2) by computing the routes for 15% to 40% SPT-related NotVia addresses, ED-NotVia provides 98% protection coverage; and 3) the protection path stretch ratio of ED-NotVia is only 1.03 on average as compared to 1.20 for NotVia.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
IP快速路由:NotVia与早期解封装
网络生存性是互联网研究的一个重要课题。为了提高Internet在故障时的性能,提出了IP快速路由(IPFRR)机制,为受故障影响的报文建立备份路由。NotVia是最突出的一个,它为单节点故障提供100%的保护覆盖率。然而,它给具有特殊NotVia地址的路由器带来了不小的计算和内存压力,其中特定路由器只需要一些NotVia地址。此外,NotVia的保护路径平均比最优路径长20%。在本文中,我们提出了早期解封装的NotVia (ED-NotVia)来处理上述问题,从而使NotVia更加实用。我们首先分析到任何特定节点的必要NotVia地址的属性。然后,我们开发了一种启发式Nec-NotVia算法,用于节点查找必要的NotVia地址并计算它们的路由,其中不必要的地址被消除。在此基础上引入早期解封装,优化具有边际开销的保护路径。我们评估了我们的算法,并使用Rocketfuel和Brite的拓扑验证了ED-NotVia的有效性。结果表明:1)一个自治系统中与SPT(最短路径树)相关的NotVia地址(占所有NotVia地址的1.23% ~ 6.41%)只有5% ~ 20%是节点所必需的;2)通过计算15% - 40%与spt相关的NotVia地址的路由,ED-NotVia提供98%的保护覆盖率;3) ED-NotVia的保护路径拉伸比平均仅为1.03,而NotVia的保护路径拉伸比为1.20。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Channel Code Aided Decision-Directed Channel Estimation for MIMO OFDM/SDMA Systems Based on the "Expectation-Conditional Maximization Either" Algorithm Large File Transfers from Space Using Multiple Ground Terminals and Delay-Tolerant Networking Platforms and Software Systems for an Autonomic Internet Multiple-Description Speech Coding Using Speech-Polarity Decomposition On Fairness and Locality in P2P-TV through Large-Scale Measurement Experiment
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1