Advertisement

Resilient Network and Loop-Free Forwarding Using Time Synchronization

Conference paper
Part of the Lecture Notes in Electrical Engineering book series (LNEE, volume 472)

Abstract

Under any routing protocol inconsistency of router create a problem. At the time of link or node failure there is some changes occur in topology which cause some postponement in redesigning of new topology. Router has inconsistent view of network for a few instances. During convergence period, packet may be trapped in forwarding loops. TTL is not adequate when loops are more. It has been watched that even in well oversee systems, failure of connections and router are normal. So as to fulfill the interest for high accessibility if there should arise an occurrence of a failure, quick rebuilding of loop free sending along the ideal ways is significant for a steering plan. The main strength of this paper is that it is not protocol dependent, we can embedded this scheme with any protocol and purpose of this paper is to provide a desirable feature of network, i.e., resilience.

Keywords

Resilient Time-to-live (TTL) Loop-free forwarding Bidirectional forwarding (BFD) Breadth-first search (BFS) Proactive rerouting Reactive rerouting 

References

  1. 1.
    Lakshminarayanan K et al (2007) Achieving convergence-free routing using failure-carrying packets. ACM SIGCOMM Comput Commun Rev 37(4):241–252CrossRefGoogle Scholar
  2. 2.
    Zhong Z et al (2005) Failure inferencing based fast rerouting for handling transient link and node failures. In: 24th annual joint conference of the IEEE computer and communications societies, vol 4. IEEEGoogle Scholar
  3. 3.
    Filsfils C et al (2015) The segment routing architecture. In: 2015 IEEE global communications conference (GLOBECOM). IEEEGoogle Scholar
  4. 4.
    Xia J, Gao L, Fei T (2007) A measurement study of persistent forwarding loops on the Internet. Comput Netw 51(17):4780–4796CrossRefGoogle Scholar
  5. 5.
    Raj A, Ibe OC (2007) A survey of IP and multiprotocol label switching fast reroute Schemes. Comput Netw 51(8):1882–1907CrossRefGoogle Scholar
  6. 6.
    Kreutz D et al (2015) Software-defined networking: a comprehensive survey, vol 103.1. IEEE, pp 14–76CrossRefGoogle Scholar
  7. 7.
    Aldabbagh G et al (2015) Space-efficient and accurate forwarding loop detection method using bloom-filter for fast and reliable internet routing. J Theoret Appl Inf Technol 79(3):456Google Scholar
  8. 8.
    Robertson G, Bedenbaugh J, Nelakuditi S (2010) Fast convergence with fast reroute in IP networks. In: 2010 international conference on high performance switching and routing. IEEEGoogle Scholar
  9. 9.
    Nelakuditi S et al (2008) Mitigating transient loops through interface-specific forwarding. Comput Netw 52(3):593–609CrossRefGoogle Scholar
  10. 10.
    Sundarrajan A, Ramasubramanian S (2015) Fast reroute from single link and single node failures for IP multicast. Comput Netw 82:20–33CrossRefGoogle Scholar

Copyright information

© Springer Nature Singapore Pte Ltd. 2018

Authors and Affiliations

  1. 1.Department of Computer Science and EngineeringCentral University of RajasthanAjmerIndia

Personalised recommendations