A more efficient path-finding algorithm
作者： S. Murthy , J.J. Garcia-Luna-Aceves
DOI: 10.1109/ACSSC.1994.471450
关键词:
摘要: Presents a new routing algorithm, which the authors call path-finding algorithm (PFA). It drastically reduces possibility of temporary loops, accounts for its fast convergence properties. Like other algorithms, PFA operates by specifying second-to-last hop to each destination, in addition distance destination. A detailed proof correctness and complexity is presented elsewhere. The PFA's performance compared quantitatively simulation with DUAL (a loop-free algorithm) an ideal link-state (ILS). number parameters, including length messages steps required convergence, are used comparison. results indicate that constitutes very efficient distance-vector algorithm. provides about 50% improvement terms time updates after single link failures, comparable or better speed traffic overhead than ILS, orders magnitude fewer CPU cycles. >
sci-hub.se 参考文章(4)
Shree N. Murthy, Design and Analysis of Distributed Routing Algorithms ,(1994)
P.A. Humblet, Another adaptive distributed shortest path algorithm IEEE Transactions on Communications. ,vol. 39, pp. 995- 1003 ,(1991) , 10.1109/26.87189
C. Cheng, R. Riley, S. P. R. Kumar, J. J. Garcia-Luna-Aceves, A loop-free extended Bellman-Ford routing protocol without bouncing effect acm special interest group on data communication. ,vol. 19, pp. 224- 236 ,(1989) , 10.1145/75246.75269
M.S. Sloman, X. Andriopoulos, A routing algorithm for interconnected local area networks Computer Networks and Isdn Systems. ,vol. 9, pp. 109- 130 ,(1985) , 10.1016/0169-7552(85)90024-8