A Fast Distributed Shortest Path Algorithm for a Class of Hierarchically Clustered Data Networks

IEEE Transactions on Computers

Volumn 41, Issue 6, 1992, Pages 710-724

  Antonio, John K ^a   Huang, Garng M ^b   Tsai, Wei K ^c  

^a PURDUE UNIVERSITY   (United States)

^b TEXAS A AND M UNIVERSITY   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Asynchronous computation; data networks; distributed computation; dynamic programming; hierarchical network topologies; hierarchical routing algorithms; optimal routing; parallel computation; shortest path algorithms; time complexity

Indexed keywords

COMPUTER METATHEORY--COMPUTATIONAL COMPLEXITY;

DISTRIBUTED ALGORITHMS; INTERCONNECTION NETWORKS;

COMPUTER NETWORKS;

EID: 0026880674     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/12.144623     Document Type: Article

References (23)

1. A. V. Aho, J. E. Hoptcroft, and J. D. Ullman, The Design and Analysis of Computer Algorithms. Reading, MA: Addison-Wesley, 1974.
2. E. Benhamou and J. Estrin, “Multilevel internetworking gateways: Architecture and applications,” IEEE Comput Mag., vol. 16, no. 9, pp. 27–34, Sept. 1983.
3. D. Bertsekas, “Distributed dynamic programming,” IEEE Trans. Automat. Contr., vol. AC-26, pp. 610–616, 1982.
4. D. Bertsekas, “Distributed asynchronous computation of fixed points,” Math Prog., vol. 27, pp. 107–120, 1983.
5. N. Deo, C. Pang, and R. E. Lord, “Two parallel algorithms for shortest path problems,” in Proc. 1980 Int. Conf. Parallel Processing, IEEE, New York, Aug. 1980, pp. 244–253.
6. E. Dijkstra, “A note on two problems in connexion with graphs,” Numerische Mathematik, vol. 1, pp. 269–271, 1959.
7. L. R. Ford, Jr. and D. R. Fulkerson, Flows in Networks. Princeton, NJ: Princeton University Press, 1962.
8. R. Hinden, J. Haverty, and A. Sheltzer, “The DARPA Internet: Interconnecting heterogeneous computer networks with gateways,” IEEE Comput. Mag., vol. 16, no. 9, pp. 38–48, Sept. 1983.
9. J. M. McQuillan, G. Falk, and I. Richer, “A review of the development and performance of the ARPANET routing algorithm,” IEEE Trans. Commun., vol. COM-26, no. 12, pp. 1802–1811, Dec. 1978.
10. N. F. Schneidewind, “Interconnecting local networks to long-distance networks,” IEEE Comput. Mag., vol. 16, no. 9, pp. 15–24, Sept. 1983.
11. M. Schwartz and T. E. Stern, “Routing techniques used in computer communication networks,” IEEE Trans. Commun., vol. COM-28, no. 4, pp. 539–552, Apr. 1980.
12. M. Schwartz, “Analysis of congestion control techniques in computer routing and flow control in data networks,” NATO Advanced Study Inst.: New Concepts in Multi-User Communications, Norwich, U.K., Aug. 4–16, 1980; Sijthoof and Nordhoof, The Netherlands.
13. W. D. Tajibnapis, “A correctness proof of a topology information maintenance protocol for distributed computer networks,” Commun. ACM, vol. 10, pp. 477–485, July 1977.
14. W. K. Tsai, G. M. Huang, J. K. Antonio, and W. T. Tsai, “Distributed iterative aggregation algorithms for box-constrained minimization problems and optimal routing in data networks,” IEEE Trans. Automat. Contr., Jan. 1989.
15. W. K. Tsai, G. M. Huang, J. K. Antonio, and W. T. Tsai, “Distributed aggregation/disaggregation algorithms for optimal routing in data networks,” in Proc. Automat. Contr. Conf., Atlanta, GA, June 1988.
16. W. K. Tsai, J. K. Antonio, and G. M. Huang, “Fast parallel hierarchical aggregation and disaggregation algorithms for multistage optimization problems and the shortest path problems,” under preparation.
17. W. T. Tsai, “Control and management of large and dynamic networks,” Ph.D. dissertation, Dep. EECS, UC Berkeley, 1985.
18. W. T. Tsai, C. V. Ramamoorthy, W. K. Tsai, and O. Nishiguchi, “An adaptive hierarchical routing protocol,” IEEE Trans. Comput., vol. 38, no. 8, pp. 1059–1075, Aug. 1989.
19. L. G. Valiant, “Universality considerations in VLSI circuits,” IEEE Trans. Comput., vol. 30, no. 2, pp. 135–140, 1981.
20. C. E. Leiserson, “Area efficient graph algorithms (for VLSI),” in Proc. Twenty-First Annu. IEEE Symp. Foundations Comput. Sci., 1980, pp. 270–281.
21. R. W. Floyd and J. D. Ullman, “The compilation of regular expressions into integrated circuits,” J. ACM, vol. 29, no. 2, pp. 603–622, 1982.
22. J. D. Ullman, Computational Aspects of VLSI. Rockville, MD: Computer Science Press, 1984.
23. F. T. Leighton, “A layout strategy for VLSI which is provably good,” in Proc. Fourteenth Annu. ACM Symp. Theory of Comput., 1982, pp. 1–12.