We present a method to find an alternate path, after a link failure, from a source node to a destination node. Since reconvergence of an Interior Gateway Protocol (IGP) (e.g., OSPF or IS-IS) can take hundreds of milliseconds, there is a need for a method that will find an alternate path in less time than this. The target application is a small (up to tens of nodes) access subnetwork 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. Consider a source node s sending data to destination . Suppose some link on the shortest path fails the link. An IGP will find an alternate path from avoids (assume such a path exists). IGP re-convergence may take hundreds of milliseconds or even seconds, and the packet loss during this time period may be unacceptable. Fast Re-Route (FRR) methods establish a new path from much less time than required for IGP re-convergence. The Recursive Loop-Free Alternative (RLFA) method calculates alternate paths that are maximally edge disjoint from the shortest path. The sum of all arc costs in the network, and let be the shortest path. The method adds to each link and then calculates a new shortest path for each pair of nodes. These local alternative next hops are used to route packets through a failure-free branch of the shortest path tree rooted at s. While this method is guaranteed to provide an alternate path (if one exists) for any single link failure, it does require a large number of shortest path computations to compute the local alternative next hops.