Skip to main content
SpringerLink
Log in

Network Probabilistic Connectivity: Expectation of a Number of Disconnected Pairs of Nodes

  • Conference paper
High Performance Computing and Communications (HPCC 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4208))

Abstract

The task of calculating the expectation of a number of disconnected pairs of nodes (EDP) in unreliable network is discussed. The task is NP-hard that is it requires complete enumeration of subgraphs. The techniques for decreasing a number of enumerated subgraphs by using the branching (factoring) method and taking advantage from possible structural features are discussed. Usage of chains, bridges, cutnodes and dangling nodes is considered.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Rodionova, O.K., Rodionov, A.S., Choo, H.: Network Probabilistic Connectivity: Exact Calculation with Use of Chains. In: Laganá, A., Gavrilova, M.L., Kumar, V., Mun, Y., Tan, C.J.K., Gervasi, O. (eds.) ICCSA 2004. LNCS, vol. 3045, pp. 315–324. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  2. Krivoulets, V.G., Polesskii, V.P.: What is the Theory of Bounds for Network Reliability? Information Processes 1(2), 199–203 (2001)

    Google Scholar 

  3. Cancela, H., Petingi, L.: Diameter constrained network reliability: exact evaluation by factorization and bounds. In: Proc. of the Int. Conf. on Industrial Logistics, Japan, pp. 359–366 (2001)

    Google Scholar 

  4. Lucet, C., Manouvrier, J.-F.: Exact Methods to compute Network Reliability. In: Proc. of 1st International Conf. on Mathematical Methods in Reliability, Bucharest, Roumanie (September 1997), paper available via: http://ramp.ucsd.edu/resources.html

  5. Satyanarayana, A., Chang, M.K.: Network reliability and the factoring theorem. Networks 13, 107–120 (1983)

    Article  MATH  MathSciNet  Google Scholar 

  6. Shooman, A.M.: Algorithms for Network Reliability and Connection Availability Analysis. Electro/95 Int. Professional Program Proc., 309–333 (1995)

    Google Scholar 

  7. Moore, E.F., Shannon, C.E.: Reliable Circuits Using Less Reliable Relays. J. Franclin Inst. 262(4b), 191–208 (1956)

    Article  MathSciNet  Google Scholar 

  8. Palmer, C.R., Siganos, G., Faloutsos, M., Faloutsos, C., Gibbons, P.: The connectivity and faulttolerance of the Internet topology. In: Workshop on Network-Related Data Management (NRDM-2001) (2001), http://www.research.att.com/~divesh/papers/cjfgs98-ir.ps

  9. Rodionov, A.S., Choo, H.: On Generating Random Network Structures: Connected Graphs. In: Kahng, H.-K., Goto, S. (eds.) ICOIN 2004. LNCS, vol. 3090, pp. 483–491. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  10. Shooman, A.M., Kershenbaum, A.: Exact Graph-Reduction Algorithms for Network Reliability Analysis. In: Proc. GLOBECOM 1991, vol. 2, pp. 1412–1420 (1991)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Computational Mathematics and Mathematical Geophysics, Siberian Division of the Russian Academy of Science, Novosibirsk, Russia

    Alexey S. Rodionov & Olga K. Rodionova

Authors
  1. Alexey S. Rodionov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Olga K. Rodionova
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1.  ,  

    Michael Gerndt

  2. GUP, Institute of Graphics and Parallel Processing, Johannes Kepler University, Altenbergerstraße 69, A-4040, Linz, Austria

    Dieter Kranzlmüller

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Rodionov, A.S., Rodionova, O.K. (2006). Network Probabilistic Connectivity: Expectation of a Number of Disconnected Pairs of Nodes. In: Gerndt, M., Kranzlmüller, D. (eds) High Performance Computing and Communications. HPCC 2006. Lecture Notes in Computer Science, vol 4208. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11847366_11

Download citation

  • DOI: https://doi.org/10.1007/11847366_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-39368-9

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation