@article{(Open Science Index):https://publications.waset.org/pdf/15266,
	  title     = {Combinatorial Approach to Reliability Evaluation of Network with Unreliable Nodes and Unreliable Edges},
	  author    = {Y. Shpungin},
	  country	= {},
	  institution	= {},
	  abstract     = {Estimating the reliability of a computer network has been a subject of great interest. It is a well known fact that this problem is NP-hard. In this paper we present a very efficient combinatorial approach for Monte Carlo reliability estimation of a network with unreliable nodes and unreliable edges. Its core is the computation of some network combinatorial invariants. These invariants, once computed, directly provide pure and simple framework for computation of network reliability. As a specific case of this approach we obtain tight lower and upper bounds for distributed network reliability (the so called residual connectedness reliability). We also present some simulation results.
},
	    journal   = {International Journal of Electrical and Computer Engineering},
	  volume    = {1},
	  number    = {12},
	  year      = {2007},
	  pages     = {4095 - 4099},
	  ee        = {https://publications.waset.org/pdf/15266},
	  url   	= {https://publications.waset.org/vol/12},
	  bibsource = {https://publications.waset.org/},
	  issn  	= {eISSN: 1307-6892},
	  publisher = {World Academy of Science, Engineering and Technology},
	  index 	= {Open Science Index 12, 2007},
	}