Loop-Free Convergence With Unordered Updates

被引:3
作者
Robertson, Glenn [1 ]
Roy, Nirupam [2 ]
Penumarthi, Phani Krishna [3 ]
Nelakuditi, Srihari [3 ]
O'Kane, Jason M. [3 ]
机构
[1] US Mil Acad, Dept Elect Engn & Comp Sci, West Point, NY 10996 USA
[2] Univ Illinois, Dept Elect & Comp Engn, 1406 W Green St, Urbana, IL 61801 USA
[3] Univ South Carolina, Dept Comp Sci & Engn, Columbia, SC 29208 USA
来源
IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT | 2017年 / 14卷 / 02期
基金
美国国家科学基金会;
关键词
Network failures; resilient routing; convergence delay; fast reroute; routing loops; order of updates; TRANSIENT LOOPS;
D O I
10.1109/TNSM.2017.2675921
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This paper studies the feasibility of minimizing convergence delay and forwarding disruption without carrying any additional bits in the IP header, to provide high availability despite link failures in traditional IP networks. Previously proposed mechanisms achieve two of these three objectives by trading off the other objective. For instance, the ordered forwarding information base updates approach may prolong the convergence delay, whereas the SafeGuard scheme requires carrying the path cost in the IP header. As a better alternative, we propose a scheme called fast convergence with fast reroute (FCFR), which combines the features of IP fast rerouting and interface-specific forwarding. We show that FCFR can achieve minimal convergence delay, while ensuring loop-free delivery during convergence, after a single non-partitioning failure in an IP network, without altering the IP header format, making it amenable for immediate deployment.
引用
收藏
页码:373 / 385
页数:13
相关论文
共 22 条
[1]  
[Anonymous], 2013, Queue, DOI [10.1145/2559899.2560327, DOI 10.1145/2559899.2560327]
[2]  
[Anonymous], 2007, P 2007 SIGCOMM WORKS
[3]  
Bryant S., 2015, 7490 RFC INT ENG TAS
[4]  
Bryant S., 2013, 6981 RFC INT ENG TAS
[5]   Computing Minimal Update Sequences for Graceful Router-Wide Reconfigurations [J].
Clad, Francois ;
Vissicchio, Stefano ;
Merindol, Pascal ;
Francois, Pierre ;
Pansiot, Jean-Jacques .
IEEE-ACM TRANSACTIONS ON NETWORKING, 2015, 23 (05) :1373-1386
[6]   Graceful Convergence in Link-State IP Networks: A Lightweight Algorithm Ensuring Minimal Operational Impact [J].
Clad, Francois ;
Merindol, Pascal ;
Pansiot, Jean-Jacques ;
Francois, Pierre ;
Bonaventure, Olivier .
IEEE-ACM TRANSACTIONS ON NETWORKING, 2014, 22 (01) :300-312
[7]  
Elhourani T, 2014, IEEE INFOCOM SER, P2148, DOI 10.1109/INFOCOM.2014.6848157
[8]   Avoiding transient loops during the convergence of link-state routing protocols [J].
Francois, Pierre ;
Bonaventure, Olivier .
IEEE-ACM TRANSACTIONS ON NETWORKING, 2007, 15 (06) :1280-1292
[9]  
Hengartner U, 2002, IMW 2002: PROCEEDINGS OF THE SECOND INTERNET MEASUREMENT WORKSHOP, P107, DOI 10.1145/637201.637217
[10]  
Kvalbein A., 2006, INFOCOM 2006. 25th IEEE International Conference on Computer Communications. Proceedings, P1