Abstract
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.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
D.K. Pradhan and S.M. Reddy, ‘A fault-tolerant communication architecture for distributed systems', IEEETC, Vol. C-31, pp. 863–870, Sept. 1982.
D.K. Pradhan, ‘Interconnection topologies for fault-tolerant parallel and distributed architectures', Proc. 1981 Int. Conf. on Parallel Processing, Aug. 1981, pp. 238–242.
N.G. De Bruijn, ‘A combinatorial problem', Proc. Akademe Van Wetenschappen, Vol. 49, part 2, 1946, pp. 758–764.
W.E. Leland and M.H. Solomon, ‘Dense trivalent graphs for processor interconnection', IEEETC, Vol. C-31, pp. 219–222, March 1982.
B.W. Arden and H. Lee, ‘A multi-tree structured network', Proc. COMPCON, Fall 1–78, pp. 201–210.
N.J. Nilsson, Principles of Artificial Intelligence, Tioga, 1980.
A. Bagchi and A. Mahanti, ‘Search algorithmsunder different kinds of heuristics — a comparative study', JACM, Vol. 30, pp. 1–21, January 1983.
F. Harary, Graph Theory, Addison Wesley Publishing Co., 1969.
S.W. Golomb, Shift Register Sequences, Holden-Day Inc., 1967.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1984 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bhattacharya, B.B., Ghose, S., Sinha, B.P., Srimani, P.K. (1984). Heuristic search approach to optimal routing in a distributed architecture. In: Joseph, M., Shyamasundar, R. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1984. Lecture Notes in Computer Science, vol 181. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-13883-8_70
Download citation
DOI: https://doi.org/10.1007/3-540-13883-8_70
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-13883-9
Online ISBN: 978-3-540-39087-9
eBook Packages: Springer Book Archive