Username   Password       Forgot your password?  Forgot your username? 


Volume 14 - 2018

No.1 January 2018
No.1 January 2018

Volume 13 - 2017

No.4 July 2017
No.4 July 2017
No.5 September 2017
No.5 September 2017
No.7 November 2017
No.7 November 2017
No.8 December 2017
No.8 December 2017

Volume 12 - 2016

Volume 11 - 2015

Volume 10 - 2014

Volume 9 - 2013

Volume 8 - 2012

Volume 7 - 2011

Volume 6 - 2010

Volume 5 - 2009

Volume 4 - 2008

Volume 3 - 2007

Volume 2 - 2006




Models of Network Reliability: Analysis, Combinatorics and Monte Carlo





CRC Press, Boca Raton




Ilya B. Gertsbakh and Yoseph Shpungin




Models of Network Reliability: Analysis, Combinatorics and Monte Carlo


Year of Publication














Krishna B. Misra




Review published in IJPE, Vol. 7, No. 3, May 2011, p.262


The book consists of the following 13 chapters followed by Authors’ Preface and Notation and Abbreviations:



04 Pages

Notation and Abbreviations

02 Pages

Chapter 1

What is Monte Carlo Method?

20 Pages

Chapter 2

What is Network Reliability?

28 Pages


Exponentially Distributed Lifetme

10 Pages

Chapter 4

Static and Dynamic Reliability

16 Pages

Chapter 5

Reliability Gradient

06 Pages

Chapter 6

Order Statistics and D-spectrum

09 Pages

Chapter 7

Monte Carlo of Convolutions

09 Pages

Chapter 8

Network Destruction

17 Pages

Chapter 9

Lomonosov’s “Turnip”

19 Pages

Chapter 10

Importance Measures and Spectrum

13 Pages

Chapter 11

Optimal Network Synthesis

12 Pages

Chapter 12

Dynamic Networks

06 Pages

Chapter 13

Examples of Network Reliability

14 Pages

Appendix A: O(.) and 0(.) Symbols

02 Pages

Appendix B: Convolution of exponentials

02 Pages

Appendix C: Glossary of D-spectra

06 Pages


04 Pages


05 Pages


It is concise and compact book on the subject of how to compute k-terminal reliability (probability that k-terminals remain connected) of a given communication network, where the edges or links can fail. This is a combinatorial problem and using standard analytical techniques, even a small well-connected (where each node 9781439817414 - Models of Network Reliability: Analysis, Combinatorics and Monte Carlois connected to the other nodes of the network) a two-state network of 10 nodes may require 245 number of states to reckon with. The reliability computation with such a large number of states is computationally unwieldy if not impossible. So the authors suggest the most practical approach of computing system reliability using Monte Carlo simulation. Another reason for using Monte Carlo approach appears in the fact that the availability of repairable system elements can be used in place of reliability (of non-repairable elements) without much hassle.  This assumed interchangeability of approach is reflected in all the chapters of the book. To make a beginner understand the subject matter, the treatment in a chapter starts with examples and leads a reader to the definitions and theorems that are incidental to the explanation of an approach. This helps in understanding the intricacies involved in the problem of computing network reliability. The concept of spanning trees is used to ensure connectivity of nodes of interest. Other measures of interest in reliability of networks such as component criticality and Birnbaum Importance are also discussed in the book. Approximate approaches, wherever essential, have been dealt with necessary explanation. In another generalization, the authors have considered that network nodes can fail, in addition to allowing edges to be unreliable. An indication to multi mode failure analysis is also indicated.

The students and teachers pursuing reliability of communication reliability will find this book of interest. In general, the book would be very useful for reliability engineers and those dealing with design of communication networks would find it highly indispensable.

 Krishna B. Misra

Review published in the International Journal of Performability Engineering, Vol. 7, No. 3, May 2011, p. 262.




This site uses encryption for transmitting your passwords.