期刊名称：International Journal of Computer Science and Information Technologies
电子版ISSN：0975-9646
出版年度：2013
卷号：4
期号：2
页码：273-277
出版社：TechScience Publications
摘要：Paths with loops, even transient ones ,can pose significant stability problems in networks. Some earlier approaches like Shortest path routing (Dijkstra),Flooding, Flowbased routing, Distance vector routing(OSPF),Link state routing(Bellmen-Ford),Hierarchical routing, Broadcast routing, Multicast routing have problems maintaining the balance between node delays and link delays. We present a new algorithm, Distributed Path Computation with Intermediate Variables (DIV) that guarantees that no loops, transient or steady-state, can never downgrade network dynamics. Besides its ability to operate with existing distributed routing algorithms to guarantee that the directed graph induced by the routing decisions stays acyclic by handling multiple overlapping updates and packet losses and frequency of synchronous updates, and provably outperforms earlier approaches in several key metrics. In addition, when used with distance-vector style path computation algorithms, the main drawbacks of Distance Vector are limited scalability due to slow convergence time, bandwidth consumption and routing loops. DIV also prevents counting-to-infinity; hence further improving convergence. Simulation quantifying its performance gains is also presented.
