New algorithms for maintaining all-pairs shortest paths

This paper presents a new solution to the dynamic all-pairs shortest path routing problem, using a linear reinforcement learning scheme. It involves finding the shortest path in a stochastic network, where there are continuous probabilistically-based updates in link-costs. In this paper we present the details of the algorithm and also provide an example to illustrate how the algorithm would function. The initial experimental results of the algorithm show that the algorithm is few orders of magnitude superior to the algorithms available in the literature. It can be used to find the shortest path (between all pairs of nodes in a network) within the "statistical" average network, which converges irrespective of whether there are new changes in link-costs or not. On the other hand, the existing algorithms fails to exhibit such a behavior and would recalculate the affected shortest paths after each link-cost update.

[1]  Bruce S. Davie,et al.  Computer Networks: A Systems Approach , 1996 .

[2]  B. J. Oommen,et al.  A comparison of continuous and discretized pursuit learning schemes , 1999, IEEE SMC'99 Conference Proceedings. 1999 IEEE International Conference on Systems, Man, and Cybernetics (Cat. No.99CH37028).

[3]  V. V. Rodionov.  The parametric problem of shortest distances , 1968 .

[4]  B. John Oommen,et al.  Continuous Learning Automata Solutions to the Capacity Assignment Problem , 2000, IEEE Trans. Computers.

[5]  Kai-Yeung Siu,et al.  New dynamic algorithms for shortest path tree computation , 2000, TNET.

[6]  Giuseppe F. Italiano,et al.  Incremental algorithms for minimal length paths , 1991, SODA '90.

[7]  Giuseppe F. Italiano,et al.  Fully dynamic all pairs shortest paths with real edge weights , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[8]  A. Pan,et al.  On Finding and Updating Spanning Trees and Shortest Paths , 1975, SIAM J. Comput..

[9]  Giuseppe F. Italiano,et al.  A new approach to dynamic all pairs shortest paths , 2004, JACM.

[10]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[11]  Mohammad S. Obaidat,et al.  Guest editorial learning automata: theory, paradigms, and applications , 2002, IEEE Trans. Syst. Man Cybern. Part B.

[12]  John Moy,et al.  OSPF Version 2 , 1998, RFC.

[13]  M. Schwartz,et al.  Routing Techniques Used in Computer Communication Networks , 1980, IEEE Trans. Commun..

[14]  B. John Oommen,et al.  Discretized pursuit learning automata , 1990, IEEE Trans. Syst. Man Cybern..

[15]  Eric C. Rosen,et al.  The New Routing Algorithm for the ARPANET , 1980, IEEE Trans. Commun..

[16]  B. John Oommen,et al.  Stochastic learning automata-based dynamic algorithms for the single source shortest path problem , 2004 .

[17]  Shimon Even,et al.  Updating distances in dynamic graphs , 1985 .

[18]  Philip N. Klein,et al.  Faster Shortest-Path Algorithms for Planar Graphs , 1997, J. Comput. Syst. Sci..

[19]  Satish Rao,et al.  Planar graphs, negative weight edges, shortest paths, and near linear time , 2006, J. Comput. Syst. Sci..

[20]  Giuseppe F. Italiano,et al.  A new approach to dynamic all pairs shortest paths , 2003, STOC '03.

[21]  T. Lindvall.  ON A ROUTING PROBLEM , 2004, Probability in the Engineering and Informational Sciences.

[22]  B. John Oommen,et al.  Graph Partitioning Using Learning Automata , 1996, IEEE Trans. Computers.

[23]  Thomas W. Reps,et al.  On the Computational Complexity of Dynamic Graph Problems , 1996, Theor. Comput. Sci..

[24]  Richard Bellman,et al.  ON A ROUTING PROBLEM , 1958 .

[25]  Valerie King,et al.  Fully dynamic algorithms for maintaining all-pairs shortest paths and transitive closure in digraphs , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[26]  Josef Stoer,et al.  Numerische Mathematik 1 , 1989 .

[27]  Hans Rohnert,et al.  A Dynamization of the All Pairs Least Cost Path Problem , 1985, STACS.

[28]  Peter S Loubai.  A NETWORK EVALUATION PROCEDURE , 1967 .

[29]  Shimon Even,et al.  How to keep a dynamic distributive directed graph acyclic and yet grant all requests of edge additions , 1990, Proceedings of the 5th Jerusalem Conference on Information Technology, 1990. 'Next Decade in Information Technology'.

[30]  Daniele Frigioni,et al.  Semi-Dynamic Shortest Paths and Breadth-First Search in Digraphs , 1997, STACS.

[31]  S. Lakshmivarahan,et al.  Learning Algorithms Theory and Applications , 1981 .