Heuristic search approach to optimal routing in a distributed architecture
Recently it has been shown that the general class of De Bruijn graphs can be used to develop a fault-tolerant communication architecture for distributed processing. The present paper describes a heuristic search approach to compute the optimal path between any pair of nodes in such a distributed network.
KeywordsDestination Node Optimal Path Network Graph Minimal Path Start Node
Unable to display preview. Download preview PDF.
- D.K. Pradhan and S.M. Reddy, ‘A fault-tolerant communication architecture for distributed systems', IEEETC, Vol. C-31, pp. 863–870, Sept. 1982.Google Scholar
- D.K. Pradhan, ‘Interconnection topologies for fault-tolerant parallel and distributed architectures', Proc. 1981 Int. Conf. on Parallel Processing, Aug. 1981, pp. 238–242.Google Scholar
- N.G. De Bruijn, ‘A combinatorial problem', Proc. Akademe Van Wetenschappen, Vol. 49, part 2, 1946, pp. 758–764.Google Scholar
- W.E. Leland and M.H. Solomon, ‘Dense trivalent graphs for processor interconnection', IEEETC, Vol. C-31, pp. 219–222, March 1982.Google Scholar
- B.W. Arden and H. Lee, ‘A multi-tree structured network', Proc. COMPCON, Fall 1–78, pp. 201–210.Google Scholar
- N.J. Nilsson, Principles of Artificial Intelligence, Tioga, 1980.Google Scholar
- A. Bagchi and A. Mahanti, ‘Search algorithmsunder different kinds of heuristics — a comparative study', JACM, Vol. 30, pp. 1–21, January 1983.Google Scholar
- F. Harary, Graph Theory, Addison Wesley Publishing Co., 1969.Google Scholar
- S.W. Golomb, Shift Register Sequences, Holden-Day Inc., 1967.Google Scholar