Skip to main content

The Reliability of Any-Hop Star Networks with Respect to Failures of Communication Nodes

  • Conference paper
Computer Networks (CN 2009)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 39))

Included in the following conference series:

  • 866 Accesses

Abstract

This paper investigated the reliability of any-hop star networks. The any-hop star topology is used in centralized computer networks. All network nodes fail independently, links are failure-free. Following measures of network reliability are assumed: the expected number of nodes which can communicate with the central node; the expected number of node pairs which are connected by a path through the central node; the expected number of node pairs communicating. Any two nodes can communicate, if links and nodes forming routes between these nodes have not failed. The values of reliability measures were counted for one-, two-, three-, and four-hop star, as well as chain networks. Obtained results compared with reliability of the networks with unreliable links.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Hansler, E.: Computational aspects of network reliability problems, Presented at the NATO Advanced Study Institute New Concept in Multi-User Communications. Norwick, U.K 4-6 (1980)

    Google Scholar 

  2. Kershenbaum, A., Van Slyke, R.M.: Recursive analysis of network reliability. Networks (3), 81–94 (1973)

    Article  MathSciNet  MATH  Google Scholar 

  3. Kozłowska, J.: Niezawodność sieci komputerowych o wielostopniowych strukturach pętlowych, gwiaździstych oraz mieszanych. In: Węgrzyn, S., et al. (eds.) Nowe technologie sieci komputerowych (in Polish), vol. 1, pp. 165–172. WKŁ, Warszawa (2006)

    Google Scholar 

  4. Kozłowska, J.: Niezawodność scentralizowanych sieci komputerowych o dwustopniowych strukturach gwiaździstych oraz mieszanych. In: Kwiecień, A., et al. (eds.) Sieci komputerowe. Aplikacje i zastosowania (in Polish), vol. 2, pp. 253–261. WKŁ, Warszawa (2007)

    Google Scholar 

  5. Kozłowska, J.: The reliability of tree and star networks. In: Kwiecień, A., et al. (eds.) Contemporary aspect of computer networks, vol. 2, pp. 147–156. WKŁ, Warszawa (2008)

    Google Scholar 

  6. Zabłudowski, A.: A recursive method for network reliability measures evaluation. Microelectron. Reliab. 24(3), 445–451 (1984)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kozłowska, J. (2009). The Reliability of Any-Hop Star Networks with Respect to Failures of Communication Nodes. In: Kwiecień, A., Gaj, P., Stera, P. (eds) Computer Networks. CN 2009. Communications in Computer and Information Science, vol 39. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02671-3_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-02671-3_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-02670-6

  • Online ISBN: 978-3-642-02671-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics