Heuristic search approach to optimal routing in a distributed architecture

  • Bhargab B Bhattacharya
  • Suranjan Ghose
  • Bhabani P Sinha
  • Pradip K Srimani
Session 2 Distributed Systems
Part of the Lecture Notes in Computer Science book series (LNCS, volume 181)


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.


Destination Node Optimal Path Network Graph Minimal Path Start Node 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    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
  2. [2]
    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
  3. [3]
    N.G. De Bruijn, ‘A combinatorial problem', Proc. Akademe Van Wetenschappen, Vol. 49, part 2, 1946, pp. 758–764.Google Scholar
  4. [4]
    W.E. Leland and M.H. Solomon, ‘Dense trivalent graphs for processor interconnection', IEEETC, Vol. C-31, pp. 219–222, March 1982.Google Scholar
  5. [5]
    B.W. Arden and H. Lee, ‘A multi-tree structured network', Proc. COMPCON, Fall 1–78, pp. 201–210.Google Scholar
  6. [6]
    N.J. Nilsson, Principles of Artificial Intelligence, Tioga, 1980.Google Scholar
  7. [7]
    A. Bagchi and A. Mahanti, ‘Search algorithmsunder different kinds of heuristics — a comparative study', JACM, Vol. 30, pp. 1–21, January 1983.Google Scholar
  8. [8]
    F. Harary, Graph Theory, Addison Wesley Publishing Co., 1969.Google Scholar
  9. [9]
    S.W. Golomb, Shift Register Sequences, Holden-Day Inc., 1967.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1984

Authors and Affiliations

  • Bhargab B Bhattacharya
    • 1
  • Suranjan Ghose
    • 1
  • Bhabani P Sinha
    • 1
  • Pradip K Srimani
    • 2
  1. 1.Indian Statistical InstituteCalcuttaIndia
  2. 2.Indian Institute of Management CalcuttaIndia

Personalised recommendations