This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A New Parallel and Distributed Shortest Path Algorithm for Hierarchically Clustered Data Networks
September 1998 (vol. 9 no. 9)
pp. 841-855

Abstract—This paper presents new efficient shortest path algorithms to solve single origin shortest path problems (SOSP problems) and multiple origins shortest path problems (MOSP problems) for hierarchically clustered data networks. To solve an SOSP problem for a network with n nodes, the distributed version of our algorithm reaches the time complexity of O(log(n)), which is less than the time complexity of O(log2(n)) achieved by the best existing algorithm [1]. To solve an MOSP problem, our algorithm minimizes the needed computation resources, including computation processors and communication links for the computation of each shortest path so that we can achieve massive parallelization. The time complexity of our algorithm for an MOSP problem is O(mlog(n)), which is much less than the time complexity of O(Mlog2(n)) of the best previous algorithm. Here, M is the number of the shortest paths to be computed and m is a positive number related to the network topology and the distribution of the nodes incurring communications. m is usually much smaller than M. Our experiment shows that m is almost a constant when the network size increases. Accordingly, our algorithm is significantly faster than the best previous algorithms to solve MOSP problems for large data networks.

[1] J.K. Antonio, G.M. Huang, and W.K. Tsai, "A Fast Distributed Shortest Path Algorithm for a Class of Hierarchically Clustered Data Network," IEEE Transactions on Computers, vol. 41, no. 6, pp. 710-724, June 1992.
[2] R.E. Bellman Dynamic Programming. Princeton, N.J.: Princeton Univ. Press, 1957.
[3] E.W. Dijkstra, "A Note on Two Problems in Connexion with Graphs," Numerische Mathematik, vol. 1, pp. 269-271, 1959.
[4] N. Deo, C. Pang, and R.E. Lord, "Two Parallel Algorithms for Shortest Path Problems," Proc. 1980 Int'l Conf. Parallel Processing, pp. 244-253,New York, Aug. 1980.
[5] G.B. Dantzig, "On the Shortest Route Through a Network," MAA Studies in Mathematics, vol. 11, part 1, pp. 89-93, Math. Assoc. Am., 1975.
[6] D.P. Bertsekas and J.N. Tsitsiklis, Parallel and Distributed Computation.Englewood Cliffs, N.J.: Prentice Hall International, 1989.
[7] R. Hinden, J. Haverty, and A. Sheltzer, "The DARPA Internet: Interconnecting Heterogeneous Computer Networks with Gateways," Computer, vol. 16, no. 9, pp. 38-48, Sept. 1983.
[8] N.F. Schneidewind, "Interconnecting Local Networks to Long-Distance Networks," Computer, vol. 16, no. 9, pp.15-24, Sept. 1983.
[9] A.V. Aho,J.E. Hopcroft, and J.D. Ullman,The Design and Analysis of Computer Algorithms.Reading, Mass.: Addison-Wesley, 1974.
[10] W.T. Tsai, "Control and Management of Large and Dynamic Networks," PhD dissertation, Dept. of Electrical Eng. and Computer Science, Univ. of California, Berkeley, 1985.
[11] E. Benhamou and J. Estrin, "Multilevel Internetworking Gateways: Architecture and Applications," Computer, vol. 16, no. 9, pp. 27-34, Sept. 1983.
[12] G.M. Huang and W. Hsieh, "A Parallel Textured Algorithm for Optimal Routing in Data Networks," Proc. IEEE Global COM 91,Phoenix, Ariz., Dec. 1991.
[13] G.M. Huang and S. Zhu, "A New HAD Algorithm for Optimal Routing Problem for Hierarchically Structured Data Networks," IEEE Trans Parallel and Distributed Systems, vol. 7, no. 9, pp. 939-953, Sept. 1996.
[14] G.M. Huang, S. Zhu, and W.L. Hsieh, "Parallel Implementation Issues of the Textured Algorithm for Optimal Routing in Data Networks," Proc. Int'l Parallel Processing Symp., 1993.
[15] D. Bertsekas, E.M. Gafni, and R. Gallager, "Second Derivative Algorithms for Minimum Delay Distributed Routing in Networks," IEEE Trans. Communication, vol. 32, no. 8, pp. 911-919, 1984.
[16] D. Bertsekas and E.M. Gafni, "Projected Newton Methods and Optimization of Multi-Commodity Flows," IEEE Trans. Automatic Control, vol. 28, no. 12, pp. 1,090-1,096, 1983.
[17] G.M. Huang and S. Zhu, "A Fast Distributed Optimal Routing Algorithm for Multi-Commodity Large High-Speed Data Networks," Proc. Int'l Parallel Processing Symp.,Santa Barbara, Calif., 1995.
[18] W.K. Tsai, G.M. Huang, J.K. Antonio, and W.T. Tsai, "Distributed Aggregation/Disaggregation Algorithms for Optimal Routing in Data Networks," Proc. Automatic Controls Conf.,Atlanta, Ga., June 1988.
[19] W.K. Tsai, "Convergence of Gradient Projection Routing Methods in an Asynchronous Stochastic Quasi-Static Virtual Network," IEEE Trans. Automatic Control, vol. 34, pp. 20-33, 1989.
[20] W.K. Tsai,G.M. Huang,, and J.K. Antonio,“Distributed iterative aggregation algorithms for box-constrained minimization problems and optimal routing in data networks,” IEEE Trans. on Automatic Control, vol. 34, no. 1, pp. 34-46, 1989.

Index Terms:
Shortest path, parallel processing, distributed computation, data network, hierarchical network.
Citation:
Shan Zhu, Garng M. Huang, "A New Parallel and Distributed Shortest Path Algorithm for Hierarchically Clustered Data Networks," IEEE Transactions on Parallel and Distributed Systems, vol. 9, no. 9, pp. 841-855, Sept. 1998, doi:10.1109/71.722218
Usage of this product signifies your acceptance of the Terms of Use.