Skip to main content
SpringerLink
Log in

Heuristic search approach to optimal routing in a distributed architecture

  • Session 2 Distributed Systems
  • Conference paper
  • First Online:
Foundations of Software Technology and Theoretical Computer Science (FSTTCS 1984)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 181))

  • 125 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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. 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. N.G. De Bruijn, ‘A combinatorial problem', Proc. Akademe Van Wetenschappen, Vol. 49, part 2, 1946, pp. 758–764.

    Google Scholar 

  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. B.W. Arden and H. Lee, ‘A multi-tree structured network', Proc. COMPCON, Fall 1–78, pp. 201–210.

    Google Scholar 

  6. N.J. Nilsson, Principles of Artificial Intelligence, Tioga, 1980.

    Google Scholar 

  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. F. Harary, Graph Theory, Addison Wesley Publishing Co., 1969.

    Google Scholar 

  9. S.W. Golomb, Shift Register Sequences, Holden-Day Inc., 1967.

    Google Scholar 

Download references

Author information

Author notes

  1. Pradip K Srimani

    Present address: Department of Computer Science, Southern Illinois University, 62901, Carbondale, ILL, USA

Authors and Affiliations

  1. Indian Statistical Institute, Calcutta, India

    Bhargab B Bhattacharya, Suranjan Ghose & Bhabani P Sinha

  2. Indian Institute of Management Calcutta, India

    Pradip K Srimani

Authors
  1. Bhargab B Bhattacharya
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Suranjan Ghose
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Bhabani P Sinha
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Pradip K Srimani
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Mathai Joseph Rudrapatna Shyamasundar

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation