This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A New HAD Algorithm for Optimal Routing of Hierarchically Structured Data Networks
September 1996 (vol. 7 no. 9)
pp. 939-953
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. 939-953, 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 = {1045-9219},
year = {1996},
pages = {939-953},
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 - 1045-9219
SP939
EP953
EPD - 939-953
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 multi-layer 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 O(mlog2(n)), which is much less than O(Mlog2(n)) needed for the existing HAD algorithms. Here, n is the number of nodes in the network; M is the number of commodities and m is a positive number usually much smaller than M and is a function of the patterns of all the commodities including the locations of all origin nodes and destination nodes, and the flow demand of each commodity. Furthermore, our algorithm can make a trade-off between the run time and the optimality, i.e., by allowing the solution to be sub-optimal, our algorithm can save great amount of computation time. The implementation of the algorithm for a 200-node network is simulated using OPNET simulation package (OPNET or Optimized Network Engineering Tools is developed by MIL3, Inc.), and the test results are consistent with our analysis.

[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. 710-724, 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. 1-15, 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. 325-332, 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. 71-76,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. 911-919, 1984.
[10] 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.
[11] M. Schwartz and C.K. Cheung, “The Gradient Projection Algorithm for Multiple Routing in Message-Switched 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: Springer-Verlag, pp. 615-643, 1982.
[13] D.P. Bertsekas, "Projected Newton Methods for Optimization Problems With Simple Constraints," SIAM J. Control and Optimization, vol. 20, pp. 221-246, 1982.
[14] J.B. Rosen, "The Gradient Projection Method for Nonlinear Programming, Part I: Linear Constraints," J. Soc. Ind. Appl. Math., vol. 8, pp. 181-217, 1960.
[15] 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.
[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.: Addison-Wesley, 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. 27-34, 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. 38-48, Sept. 1983.
[24] N.F. Schneidewind, "Interconnecting Local Networks to Long-Distance Networks," Computer, vol. 16, no. 9, pp. 15-24, 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 Quasi-Static Virtual Network," IEEE Trans. Automatic Control, vol. 34, pp. 20-33, 1989.
[28] L. Kleinrock, Queueing Systems: Vol. II, Computer Applications.New York: John Wiley&Sons, 1976.
[29] D.P. Bertsekas, "On the Goldstein-Levitin-Poljak Gradient Projection Method," IEEE Trans. Automatic Control, vol. 21, pp. 174-184, 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. 368-400, 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. 269-271, 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. 244-253,New York, Aug. 1980.
[34] 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.
[35] G.B. Dantzig, "On the Shortest Route Through a Network," MAA Studies in Mathematics, vol. 11, part 1, pp. 89-93, Mathematical Assoc. of Am., 1975.

Index Terms:
Optimal routing, parallel processing, distributed computation, data network, gradient projection method, hierarchically structured network.
Citation:
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. 939-953, Sept. 1996, doi:10.1109/71.536938
Usage of this product signifies your acceptance of the Terms of Use.