A new responsive distributed shortest-path rounting algorithm

Abstract

Distributed shortestpathrouting algorithms based on the Ford-Fulkerson method are simple to implement but they suffer from the cost-dependent looping problem: when link costs increase, routing table loops may form and convergence to correct paths may be too slow, depending on link costs. This problem can be eliminated if constraints are imposed on the order in which routing tables are updated at different nodes but the resdting internode protocols tend to be relatively complex. Furthermore, update constraints may restrict a node's ability to obtain alternate paths quickly in an environment where topology changes are frequent. In this paper, a new distributed shortest-path routing scheme based on the Ford-Fulkerson method is presented. Under the new scheme, each node uses partial topology information to eliminate the cost-dependent looping problem. No update constraints are imposed and no assumptions are made regarding link costs. In the worst case, the new scheme responds to link cost changes in O(D) update steps, where D is the diameter of the network after the occurrence of the changes.

A Review Paper on Ad-hoc Routing Protocols AODV FZRP and SLURP

“…FSR uses the "fisheye" technique proposed by Kleinrock and Stevens [14] to reduce the size of information needed to represent the graphical data. The eye of a fish captures the pixels near the focal point in high detail and as the distance from the focal point increases the detail decreases.…”

Comparative Study of Proactive, Reactive and Geographical MANET Routing Protocols

“…WRP is regarded as a part of the general class of path-finding algorithms [12] [18] [19], and defined as a collection of distributed shortest path algorithms that determines the paths via information on the length and secondto-last hop of the shortest path to every destination. WRP decreases the number of cases whereby a temporary routing loop might occur.…”

New dynamic algorithms for shortest path tree computation

“…Our algorithms need to be executed in a centralized processor and require a complete topology database (such as the link-state database in OSPF). There are other routing algorithms in the literature [12], [23] which use tree-like structures. However, these algorithms are distributive and operate under very different assumptions.…”

“…The problem of routing in data networks has been a subject of continual research interest for the past two decades [1], [4], [12], [13], [21], [23], [26], [28] and many routing protocols have been studied and used in practical networks [6], [18], [22], [25], [30]. The stability issues in Internet routing have attracted much attention [15], [20].…”