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 will, fail to exhibit such a behavior and would recalculate the affected shortest paths after each link-cost update.
|Conference||10th IEEE Symposium on Computers and Communications, ISCC 2005|
Misra, S. (Sudip), & Oommen, J. (2005). New algorithms for maintaining All-Pairs Shortest Paths. In Proceedings - IEEE Symposium on Computers and Communications (pp. 116–121). doi:10.1109/ISCC.2005.107