{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,24]],"date-time":"2025-03-24T06:53:34Z","timestamp":1742799214755},"reference-count":19,"publisher":"Wiley","issue":"2","license":[{"start":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T00:00:00Z","timestamp":1160524800000},"content-version":"vor","delay-in-days":11971,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1974,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In designing a distributed computer network, the reliability and availability of the communication paths between all pairs of centers is a primary consideration. Many different approaches have been taken to calculate exactly the probability of successful communication between any specified pair of centers, for a given failure probability of the individual computer systems and communication facilities. However, almost all of these methods are not computationally feasible for large networks. Consequently, approximate calculations of network reliability have been suggested. In this paper a procedure is given for the exact calculation of the probability that all paths between a pair of nodes in a given network are interrupted. The procedure generates mutually exclusive sets of cutting states and calculates the probability of the related events. Summing these values one obtains the probability of service interruption between the specified pair of nodes. If all links fail with equal probability p, the coefficients of a polynomial can be calculated, describing the service disruption probability as a function of p.<\/jats:p>","DOI":"10.1002\/net.3230040202","type":"journal-article","created":{"date-parts":[[2007,5,11]],"date-time":"2007-05-11T01:27:48Z","timestamp":1178846868000},"page":"95-112","source":"Crossref","is-referenced-by-count":57,"title":["Exact calculation of computer network reliability"],"prefix":"10.1002","volume":"4","author":[{"given":"E.","family":"H\u00e4nsler","sequence":"first","affiliation":[]},{"given":"G. K.","family":"McAuliffe","sequence":"additional","affiliation":[]},{"given":"R. S.","family":"Wilkov","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"key":"e_1_2_1_2_2","volume-title":"Communication, Transmission, and Transportation Networks","author":"Frank H.","year":"1971"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1970.1090419"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1972.1091214"},{"key":"e_1_2_1_5_2","first-page":"627","article-title":"The Analysis of Redundancy Networks","volume":"39","author":"Moskowitz F.","year":"1968","journal-title":"AIEE Trans. on Communications and Electronics"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1959.1057526"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1109\/TR.1970.5216374"},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1109\/TR.1970.5216434"},{"key":"e_1_2_1_9_2","first-page":"267","volume-title":"Proc. of the Symposium on Information Networks","author":"Okada S.","year":"1954"},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1016\/0016-0032(59)90487-9"},{"key":"e_1_2_1_11_2","first-page":"469","article-title":"A Note on the Reliability of Communication Networks","volume":"10","author":"Fu Y.","year":"1962","journal-title":"SIAM Journal"},{"key":"e_1_2_1_12_2","doi-asserted-by":"publisher","DOI":"10.1109\/TR.1971.5216111"},{"key":"e_1_2_1_13_2","doi-asserted-by":"publisher","DOI":"10.1109\/TR.1969.5216346"},{"key":"e_1_2_1_14_2","doi-asserted-by":"publisher","DOI":"10.1109\/TR.1970.5216391"},{"key":"e_1_2_1_15_2","first-page":"88","article-title":"Computer Program for Approximating System Reliability \u2010 Part II","volume":"20","author":"Batts J. R.","journal-title":"IEEE Trans. on Reliability"},{"key":"e_1_2_1_16_2","unstructured":"Wilkov R. S. \u201cReliability Considerations in Computer Network Design \u201dProc. of IFIP Congres '71 Yugoslavia August1971."},{"key":"e_1_2_1_17_2","unstructured":"Wilkov R. S. \u201cOn the Design of Maximally Reliable Communication Networks \u201dProc. of the Sixth Annual Princeton Conference on Information Sciences and Systems March1972 pp.133\u2013134."},{"key":"e_1_2_1_18_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1972.1091159"},{"key":"e_1_2_1_19_2","doi-asserted-by":"crossref","unstructured":"Frank H.et al. \u201cStore and Forward Computer Networks \u201dThird Semiannual Technical Report for ARPA Contract DAHC 15\u201370\u2013C\u20130120 June1972.","DOI":"10.21236\/AD0757090"},{"key":"e_1_2_1_20_2","volume-title":"Proc. of the International Symposium on Computer\u2010Communication Networks and Telletraffic","author":"Wilkov R. S.","year":"1972"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230040202","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230040202","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,12]],"date-time":"2023-11-12T14:19:07Z","timestamp":1699798747000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230040202"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1974,1]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1974,1]]}},"alternative-id":["10.1002\/net.3230040202"],"URL":"https:\/\/doi.org\/10.1002\/net.3230040202","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1974,1]]}}}