
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
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. 841855, September, 1998.  
BibTex  x  
@article{ 10.1109/71.722218, author = {Shan Zhu and Garng M. Huang}, title = {A New Parallel and Distributed Shortest Path Algorithm for Hierarchically Clustered Data Networks}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {9}, number = {9}, issn = {10459219}, year = {1998}, pages = {841855}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.722218}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  A New Parallel and Distributed Shortest Path Algorithm for Hierarchically Clustered Data Networks IS  9 SN  10459219 SP841 EP855 EPD  841855 A1  Shan Zhu, A1  Garng M. Huang, PY  1998 KW  Shortest path KW  parallel processing KW  distributed computation KW  data network KW  hierarchical network. VL  9 JA  IEEE Transactions on Parallel and Distributed Systems ER   
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
[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. 710724, 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. 269271, 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. 244253,New York, Aug. 1980.
[5] G.B. Dantzig, "On the Shortest Route Through a Network," MAA Studies in Mathematics, vol. 11, part 1, pp. 8993, 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. 3848, Sept. 1983.
[8] N.F. Schneidewind, "Interconnecting Local Networks to LongDistance Networks," Computer, vol. 16, no. 9, pp.1524, Sept. 1983.
[9] A.V. Aho,J.E. Hopcroft, and J.D. Ullman,The Design and Analysis of Computer Algorithms.Reading, Mass.: AddisonWesley, 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. 2734, 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. 939953, 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. 911919, 1984.
[16] D. Bertsekas and E.M. Gafni, "Projected Newton Methods and Optimization of MultiCommodity Flows," IEEE Trans. Automatic Control, vol. 28, no. 12, pp. 1,0901,096, 1983.
[17] G.M. Huang and S. Zhu, "A Fast Distributed Optimal Routing Algorithm for MultiCommodity Large HighSpeed 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 QuasiStatic Virtual Network," IEEE Trans. Automatic Control, vol. 34, pp. 2033, 1989.
[20] W.K. Tsai,G.M. Huang,, and J.K. Antonio,“Distributed iterative aggregation algorithms for boxconstrained minimization problems and optimal routing in data networks,” IEEE Trans. on Automatic Control, vol. 34, no. 1, pp. 3446, 1989.