A new HAD algorithm for optimal routing of hierarchically structured data networks

IEEE Transactions on Parallel and Distributed Systems

Volumn 7, Issue 9, 1996, Pages 939-953

  Huang, Garng M ^a,b   Zhu, Shan ^c  

^a IEEE

^b TEXAS A AND M UNIVERSITY   (United States)

^c NORTEL NETWORKS   (United States)

Author keywords

Data network; Distributed computation; Gradient projection method; Hierarchically structured network; Optimal routing; Parallel processing

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER NETWORKS; COMPUTER SIMULATION; HIERARCHICAL SYSTEMS; OPTIMIZATION; PARALLEL PROCESSING SYSTEMS;

GRADIENT PROJECTION METHOD; HIERARCHICAL AGGREGATION DISAGGREGATION ALGORITHM; HIERARCHICALLY STRUCTURED DATA NETWORKS; OPTIMAL ROUTING;

ALGORITHMS;

EID: 0030247085     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/71.536938     Document Type: Article

References (35)

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. Gallager, "A Minimum Delay Routing Algorithm Using Distributed Computation," IEEE Trans. Communication, vol. 25, pp. 73-85, 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. Bertsekas and J. Tsitsiklis, Parallel and Distributed Computation, Numerical Methods. Englewood Cliffs, N.J.: Prentice Hall, 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. Communications, pp. 449-456, 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. Hoptcroft, 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. Corner, 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. 171-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. 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. 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.