
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Garng M. Huang, Shan Zhu, "A New HAD Algorithm for Optimal Routing of Hierarchically Structured Data Networks," IEEE Transactions on Parallel and Distributed Systems, vol. 7, no. 9, pp. 939953, September, 1996.  
BibTex  x  
@article{ 10.1109/71.536938, author = {Garng M. Huang and Shan Zhu}, title = {A New HAD Algorithm for Optimal Routing of Hierarchically Structured Data Networks}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {7}, number = {9}, issn = {10459219}, year = {1996}, pages = {939953}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.536938}, 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 HAD Algorithm for Optimal Routing of Hierarchically Structured Data Networks IS  9 SN  10459219 SP939 EP953 EPD  939953 A1  Garng M. Huang, A1  Shan Zhu, PY  1996 KW  Optimal routing KW  parallel processing KW  distributed computation KW  data network KW  gradient projection method KW  hierarchically structured network. VL  7 JA  IEEE Transactions on Parallel and Distributed Systems ER   
Abstract—In this paper, a new algorithm based on hierarchical aggregation/disaggregation and decomposition/composition (HAD) scheme is proposed to solve the optimal routing problems (ORP) for hierarchically structured networks of multilayer backbones. Our algorithm has two major differences with the existing HAD algorithms for hierarchically clustered networks [1], [2]: 1) our algorithm works with more general networks than the networks with the clustered structure; 2) our algorithm parallelizes the computations for different commodities (message flows defined by a pair of origin node and destination node) so that it speeds up with a parallel time complexity of
[1] W.K. Tsai, G.M. Huang, J.K. Antonio, and W.T. Tsai, "Distributed Aggregation/Disaggregation Algorithms for Optimal Routing in Data Networks," Proc. Automat. Contr. Conf.,Atlanta, Ga., June 1988.
[2] 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.
[3] R.G. Gallager, “A Minimum Delay Routing Algorithms Using Distributed Computation,” IEEE Trans. Comm., vol. 25, no. 1, Jan. 1977.
[4] G.M. Huang and W. Hsieh, "Exact Convergence of a Parallel Textured Algorithm for Data Network Optimal Routing," IEEE Transactions on Parallel and Distributed Systems, vol. 6, no. 11, pp. 115, Nov. 1995.
[5] 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.
[6] J. Tsitsiklis and D. Bertsekas, "Distributed Asynchronous Optimal Routing in Data Networks," IEEE Trans. Automatic Control, vol. 31, no. 4, pp. 325332, 1986.
[7] D.P. Bertsekas and J.N. Tsitsiklis, Parallel and Distributed Computation.Englewood Cliffs, N.J.: Prentice Hall International, 1989.
[8] D.P. Bertsekas, "A Class of Optimal Routing Algorithms for Communication Networks," Proc. Fifth Int'l Conf. Comput. Comm., pp. 7176,Atlanta, Ga., 1980.
[9] 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.
[10] 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.
[11] M. Schwartz and C.K. Cheung, “The Gradient Projection Algorithm for Multiple Routing in MessageSwitched Networks,” IEEE Trans. Comm., vol. 24, no. 4, Apr. 1976.
[12] D. Bertsekas, "Optimal Routing and Flow Control Methods for Communication Networks," A. Bensoussan and J.L. Lions, eds., Analysis and Optimization of Systems.New York: SpringerVerlag, pp. 615643, 1982.
[13] D.P. Bertsekas, "Projected Newton Methods for Optimization Problems With Simple Constraints," SIAM J. Control and Optimization, vol. 20, pp. 221246, 1982.
[14] J.B. Rosen, "The Gradient Projection Method for Nonlinear Programming, Part I: Linear Constraints," J. Soc. Ind. Appl. Math., vol. 8, pp. 181217, 1960.
[15] 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.
[16] J.K. Antonio, W.K. Tsai, and G.M. Huang, "Time Complexity of a Path Formulated Optimal Routing Algorithm," IEEE Trans. Automatic Control, vol. 39, no. 2, 1994.
[17] S.W. Park and W.K. Tsai, "Distributed Hierarchical Optimal Routing Using Aggregation/Disaggregation and Decomposition/Composition Techniques," Proc. Int'l Parallel Processing Symp.,Anaheim, Calif., 1991.
[18] S.W. Park, "Routing Algorithm in Communications Network," PhD dissertation, Dept. of Electrical and Computer Engineering, Univ. of California, Irvine, 1991.
[19] G.M. Huang and S. Zhu, "A New Distributed Shortest Path Algorithm for Hierarchically Clustered Data Networks," Proc. IEEE Am. Control Conf.,Seattle, Wash., June, 1995.
[20] A.V. Aho,J.E. Hopcroft, and J.D. Ullman,The Design and Analysis of Computer Algorithms.Reading, Mass.: AddisonWesley, 1974.
[21] 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.
[22] E. Benhamou and J. Estrin, "Multilevel Internetworking Gateways: Architecture and Applications," Computer, vol. 16, no. 9, pp. 2734, Sept. 1983.
[23] 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.
[24] N.F. Schneidewind, "Interconnecting Local Networks to LongDistance Networks," Computer, vol. 16, no. 9, pp. 1524, Sept. 1983.
[25] 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.
[26] D. Comer, Internetworking with TCP/IP: Principle, Protocols, and Architecture.Englewood Cliffs, N.J.: Prentice Hall, 1991.
[27] 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.
[28] L. Kleinrock, Queueing Systems: Vol. II, Computer Applications.New York: John Wiley&Sons, 1976.
[29] D.P. Bertsekas, "On the GoldsteinLevitinPoljak Gradient Projection Method," IEEE Trans. Automatic Control, vol. 21, pp. 174184, 1976.
[30] J.C. Dunn, "Global and Asymptotic Convergence Rate Estimates for a Class of Projected Gradient Processes," SIAM J. Control and Optimization, vol. 19, pp. 368400, 1981.
[31] R.E. Bellman Dynamic Programming. Princeton, N.J.: Princeton Univ. Press, 1957.
[32] E.W. Dijkstra, "A Note on Two Problems in Connexion With Graphs," Numerische Mathematik, vol. 1, pp. 269271, 1959.
[33] 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.
[34] 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.
[35] G.B. Dantzig, "On the Shortest Route Through a Network," MAA Studies in Mathematics, vol. 11, part 1, pp. 8993, Mathematical Assoc. of Am., 1975.