Abstract: Today the world is rapidly changing and technology is zooming exponentially, the number of users of internet is also increasing rapidly which cause increase in traffic and causes more no of failures in transmission of packets. The backbone process of the global internet or any internal network is Routing. Existing routing techniques includes static and dynamic routing which are implemented using routing algorithms like RIP, EIGRP, OSPF, IS-IS. These routing algorithms intelligently route the packets on the network. There are many scenarios where a packet is sent, the routing algorithm finds an appropriate path for the packet, routes it and it is delivered. There are cases where packets do not get delivered because of many reasons like link failures. A method to find an alternate path, after a link failure, from a source node to a destination node, before the Interior Gateway Protocol (e.g., OSPF or IS-IS) reroutes the packet by notifying the sender which takes about 100ms. A smarter way to deliver the packet is to reroute the packets from the last successful node. In this method an alternate route is found out instantly after a node failure, and updating the routing table of other nodes according to the new route. The target application (up to tens of nodes) accesses the sub-network of a service provider’s network, which is a typical scale, encountered in practice; a service provider typically has many such small regional access networks. The fast reroute method would establish a new path from the source to destination in a much lesser time than the existing system i.e. IGP (OSPF).
Keywords: OSPF, Re-Routing, Routing, IS-IS, reconvergence
Title: An Efficient Fast Re-Route Method
Author: Rushabh Mehta, Kartik Dhumale, Sakshi Shah, Deepa Gaikwad, Prof S.B.Ware
International Journal of Computer Science and Information Technology Research
ISSN 2348-1196 (print) ISSN 2348-120X (online)
Research Publish Journals
