skip to main content
article

Selecting shorter alternate paths for tunnel-based IP Fast ReRoute in linear time

Published: 01 February 2012 Publication History

Abstract

IP Fast ReRoute (IPFRR) has received increasing attention as a means to effectively shorten traffic disruption under failures. A major approach to implementing IPFRR is to pre-calculate backup paths for nodes and links. However, it may not be easy to deploy such an approach in practice due to the tremendous computational overhead. Thus, a light-weight IPFRR scheme is desired to effectively provide cost-efficient routing protection. In this paper, we propose a Fast Tunnel Selection (FTS) approach to achieve tunnel-based IPFRR. FTS approach can find an effective tunnel endpoint before complete computation of entire SPT and thus effectively reduce computation overhead. Specially, we propose two FTS algorithms to provide protection for networks with symmetric and asymmetric link weights. We simulate FTS with topologies of different sizes. The results show that FTS approach reduces more than 89% computation overhead compared to the existing approaches, and achieves more than 99% average link protection rate and more than 90% average node protection rate. Moreover, FTS approach achieves less than 15% path stretch, which is better than the existing approaches.

References

[1]
Y. Yang, M. Xu, Q. Li, A lightweight IP Fast ReRoute algorithm with tunneling, in: Proc. of IEEE ICC, 2010.
[2]
Francois, P., Filsfils, C., Evans, J. and Bonaventure, O., Achieving subsecond IGP convergence in large IP networks. ACM SIGCOMM Computer Communication Review. v35. 33-44.
[3]
Shand, M. and Bryant, S., . IP Fast Reroute Framework.
[4]
D. Katz, D. Ward, Bidirectional Forwarding Detection (BFD) for IPv4 and IPv6 (Single Hop), June 2010.
[5]
A. Li, P. Francois, X. Yang, On improving the efficiency and manageability of NotVia, in: Proc. of ACM CoNEXT, 2007.
[6]
P.S.G. Enyedi, G. Retvari, A. Csaszar, IP Fast ReRoute: lightweight not-via without additional addresses, in: Proc. of IEEE Infocom, 2009.
[7]
China Education and Research Network 2. <http://www.cernet2.edu.cn>.
[8]
A. Atlas, A. Zinin, Basic Specification for IP Fast Reroute: Loop-Free Alternates, September 2008.
[9]
A. Atlas, U-turn Alternate for IP/LDP Fast-Reroute, February 2006.
[10]
S. Bryant, C. Filsfils, S. Previdi, M. Shand, IP Fast Reroute Using Tunnels, November 2007.
[11]
S. Bryant, M. Shand, S. Previdi, IP Fast Reroute Using Notvia Addresses, July 2009.
[12]
Rai, S., Mukherjee, B. and Deshpande, O., IP resilience within an autonomous system: current approaches, challenges, and future directions. IEEE Communications Magazine. v43. 142-149.
[13]
K. Ho, N. Wang, G. Pavlou, C. Botsiaris, Optimizing post-failure network performance for IP Fast ReRoute using tunnels, in: Proc. of QShine, 2008.
[14]
Menth, M., Hartmann, M., Martin, R., Cicic, T. and Kvalbein, A., Loop-free alternates and not-via addresses: a proper combination for IP Fast Reroute?. Computer Networks. v54. 1300-1315.
[15]
D. Hock, M. Hartmann, M. Menth, C. Schwartz, Optimizing unique shortest paths for resilient routing and Fast Reroute in IP-based networks, in: Proc. of NOMS, 2010.
[16]
Kini, S., Ramasubramanian, S., Kvalbein, A. and Hansen, A., Fast recovery from dual-link or single-node failures in IP networks using tunneling. IEEE/ACM Transactions on Networking. v18 i6. 1988-1999.
[17]
Nelakuditi, S., Lee, S., Yu, Y., Zhang, Z. and Chuah, C., Fast local rerouting for handling transient link failures. IEEE/ACM Transactions on Networking. v15. 359-372.
[18]
Ray, S., Guerin, R., Kwong, K.-W. and Sofia, R., Always acyclic distributed path computation. IEEE/ACM Transactions on Networking. v18. 307-319.
[19]
P. Francois, M. Shand, O. Bonaventure, Disruption free topology reconfiguration in OSPF networks, in: Proc. of IEEE INFOCOM, 2007.
[20]
Kvalbein, T.C.S.G.A., Hansen, A.F. and Lysne, O., Multiple routing configurations for fast IP network recovery. IEEE/ACM Transactions on Networking. v17. 473-486.
[21]
K.-W. Kwong, L. Gao, R. Guerin, Z. Zhang, On the feasibility and efficacy of protection routing in IP networks, in: Proc. of IEEE INFOCOM, IEEE Press, Piscataway, NJ, USA, 2010, pp. 1235-1243.
[22]
Abilene. <http://abilene.internet2.edu/>.
[23]
Spring, N., Mahajan, R., Wetherall, D. and Anderson, T., Measuring ISP topologies with rocketfuel. IEEE/ACM Transactions on Networking. v12. 2-16.
[24]
Brite. <http://www.cs.bu.edu/brite/>.
[25]
Heckmann, O., Piringer, M., Schmitt, J. and Steinmetz, R., Generating realistic ISP-level network topologies. IEEE Communications Letters. v7. 335-336.
[26]
M. Gjoka, V. Ram, X. Yang, Evaluation of IP Fast Reroute proposals, in: Proc. of IEEE COMSWARE, 2007.
[27]
G.E.G. Retvari, J. Tapolcai, A. Csaszar, IP Fast ReRoute: loop free alternates revisited, in: Proc. of IEEE INFOCOM, 2011, pp. 2948-2956.

Cited By

View all
  • (2018)Fast Rerouting Against Multi-Link Failures Without Topology ConstraintIEEE/ACM Transactions on Networking (TON)10.1109/TNET.2017.278085226:1(384-397)Online publication date: 1-Feb-2018
  1. Selecting shorter alternate paths for tunnel-based IP Fast ReRoute in linear time

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image Computer Networks: The International Journal of Computer and Telecommunications Networking
    Computer Networks: The International Journal of Computer and Telecommunications Networking  Volume 56, Issue 2
    February, 2012
    476 pages

    Publisher

    Elsevier North-Holland, Inc.

    United States

    Publication History

    Published: 01 February 2012

    Author Tags

    1. Fast Tunnel Selection
    2. Fast rerouting
    3. IP routing
    4. Tunnel

    Qualifiers

    • Article

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)0
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 21 Oct 2024

    Other Metrics

    Citations

    Cited By

    View all
    • (2018)Fast Rerouting Against Multi-Link Failures Without Topology ConstraintIEEE/ACM Transactions on Networking (TON)10.1109/TNET.2017.278085226:1(384-397)Online publication date: 1-Feb-2018

    View Options

    View options

    Get Access

    Login options

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media