Skip to main content

Parallel Calculation of Diameter Constrained Network Reliability

  • Conference paper
  • First Online:
Parallel Computing Technologies (PaCT 2017)

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

Included in the following conference series:

Abstract

The problem of network reliability calculation in case of the diameter constraint is studied. The problem of computing this characteristic is known to be NP-hard. We introduce the parallel methods, which are based on the well-known factoring method and on the factoring method modification proposed by H. Cancela and L. Petingi. The analysis of the numerical experiments has allowed us to set some important parameters of the parallel algorithm for speeding up calculations.

Supported by Russian Foundation for Basic Research under grants 16-37-00345, 16-07-00434.

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 EPUB and 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

References

  1. Won, J.-M., Karray, F.: Cumulative update of all-terminal reliability for faster feasibility decision. IEEE Trans. Reliabil. 59(3), 551–562 (2010)

    Article  Google Scholar 

  2. Page, L.B., Perry, J.E.: A practical implementation of the factoring theorem for network reliability. IEEE Trans. Reliabil. 37(3), 259–267 (1998)

    Article  Google Scholar 

  3. Cancela, H., Petingi, L.: Diameter constrained network reliability: exact evaluation by factorization and bounds. In: International Conference on Industrial Logistics, Okinawa, Japan, pp. 359–356 (2001)

    Google Scholar 

  4. Canale, E., Cancela, H., Robledo, F., Romero, P., Sartor, P.: Full complexity analysis of the diameter-constrained reliability. Int. Trans. Oper. Res. 22(5), 811–821 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  5. Migov, D.A., Nesterov, S.N.: Methods of speeding up of diameter constrained network reliability calculation. In: Gervasi, O., Murgante, B., Misra, S., Gavrilova, M.L., Rocha, A.M.A.C., Torre, C., Taniar, D., Apduhan, B.O. (eds.) ICCSA 2015. LNCS, vol. 9156, pp. 121–133. Springer, Cham (2015). doi:10.1007/978-3-319-21407-8_9

    Chapter  Google Scholar 

  6. Martnez, S.P., Calvino, B.O., Rocco, S.C.M.: All-terminal reliability evaluation through a Monte Carlo simulation based on an MPI Implementation. In: European Safety and Reliability Conference: Advances in Safety, Reliability and Risk Management (PSAM 2011/ESREL 2012), Helsinki, pp. 1–6 (2012)

    Google Scholar 

  7. Migov, D.A., Rodionov, A.S.: Parallel Implementation of the factoring method for network reliability calculation. In: Murgante, B., et al. (eds.) ICCSA 2014. LNCS, vol. 8584, pp. 654–664. Springer, Cham (2014). doi:10.1007/978-3-319-09153-2_49

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Denis A. Migov .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Nesterov, S.N., Migov, D.A. (2017). Parallel Calculation of Diameter Constrained Network Reliability. In: Malyshkin, V. (eds) Parallel Computing Technologies. PaCT 2017. Lecture Notes in Computer Science(), vol 10421. Springer, Cham. https://doi.org/10.1007/978-3-319-62932-2_45

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-62932-2_45

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-62931-5

  • Online ISBN: 978-3-319-62932-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics