[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Skip to main content
Springer Nature Link
Log in

Generalized fault tolerance properties of star graphs

  • Distributed Computing And Systems
  • Conference paper
  • First Online:
Advances in Computing and Information — ICCI '91 (ICCI 1991)

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

Included in the following conference series:

Abstract

Recently an attractive interconnection topology has been proposed which compares very favorably with the well known n-cubes in terms of degree, diameter, fault tolerance and resilience. In this paper we investigate further fault tolerance properties of star graphs using the generalized measure of fault tolerance as introduced recently to study n-cubes. Star graphs are found again to compare favorably with n-cubes even using this generalized measure of fault tolerance.

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.

Similar content being viewed by others

V. References

  1. S. B. Akers and B. Krishnamurthy, " A group theoretic model for symmetric interconnection networks", Proceedings of Intl. Conf. on Parallel Processing, pp. 216–213, 1986.

    Google Scholar 

  2. S. B. Akers, D. Harel and B. Krishnamurthy, " The star graph: an attractive alternative to the n-cube", Proceedings of Intl. Conf. on Parallel Processing, pp. 393–400, 1987.

    Google Scholar 

  3. S. B. Akers and B. Krishnamurthy, "The fault tolerance of star graphs", Proceedings of 2nd Intl. Conf. on Supercomputing, 1987.

    Google Scholar 

  4. M. S. Krishnamurthy and B. Krishnamurthy, "Fault diameter of interconnection networks", Journal of Comput. Math. Appl., Vol. 13, pp. 577–582, 1987.

    Google Scholar 

  5. A.-H. Esfahanian, "Generalized measures of fault tolerance with application of N-cube networks", IEEE Trans. Comput., Vol. 38, pp. 1586–1591, Nov. 1989.

    Google Scholar 

  6. F. Harary, Graph Theory, Addison-Wesley, Reading, MA, 1972.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Colorado State University, 80523, Ft. Collins, CO

    Pradip K Srimani

Authors
  1. Pradip K Srimani
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Frank Dehne Frantisek Fiala Waldemar W. Koczkodaj

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Srimani, P.K. (1991). Generalized fault tolerance properties of star graphs. In: Dehne, F., Fiala, F., Koczkodaj, W.W. (eds) Advances in Computing and Information — ICCI '91. ICCI 1991. Lecture Notes in Computer Science, vol 497. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54029-6_200

Download citation

  • DOI: https://doi.org/10.1007/3-540-54029-6_200

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54029-8

  • Online ISBN: 978-3-540-47359-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation