{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T06:09:46Z","timestamp":1777615786256,"version":"3.51.4"},"reference-count":13,"publisher":"Wiley","issue":"5","license":[{"start":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T00:00:00Z","timestamp":1160524800000},"content-version":"vor","delay-in-days":5184,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1992,8]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We consider the problem of communication between nodes of a network whose links are subject to arbitrary failures: A failed link may not only stop transmitting messages but may corrupt them in any possible way. We characterize networks allowing communication in spite of at most <jats:italic>t<\/jats:italic> failures. Also, for every fixed link failure probability <jats:italic>p<\/jats:italic> \u2264 .29, we construct a class of networks for which the probability of successful communication converges to 1 as the number of nodes grows. It is shown that the number of links in these networks is asymptotically smallest possible to assure reliable communication. Moreover, in these networks, communication can be completed in just two information exchange rounds. Finally, we give a protocol assuring reliable communication in the hypercube if link failure probability is <jats:italic>p<\/jats:italic> \u2264 .02 and show that no such protocol exists if <jats:italic>p<\/jats:italic> \u2265 .15.<\/jats:p>","DOI":"10.1002\/net.3230220503","type":"journal-article","created":{"date-parts":[[2007,5,12]],"date-time":"2007-05-12T12:49:01Z","timestamp":1178974141000},"page":"441-459","source":"Crossref","is-referenced-by-count":21,"title":["Reliable communication in networks with Byzantine link failures"],"prefix":"10.1002","volume":"22","author":[{"given":"Andrzej","family":"Pelc","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1137\/0607002"},{"key":"e_1_2_1_3_2","first-page":"62","article-title":"Fault diagnosis for sparsely interconnected multiprocessor systems","volume":"19","author":"Blough D. M.","year":"1989","journal-title":"Digest Pap."},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(82)90004-9"},{"key":"e_1_2_1_5_2","volume-title":"Probabilistic methods in combinatorics","author":"Erd\u00f6s P.","year":"1974"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230110304"},{"key":"e_1_2_1_7_2","unstructured":"A.Farley Reliable minimum\u2010time broadcast networks.Proceedings of the 18th SE Conference on Combinatorics Graph Theory and Computing Utilitas Mathematica Winnipeg (1987)."},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230120404"},{"key":"e_1_2_1_9_2","volume-title":"A guide to the theory of NP\u2010Completeness","author":"Garey M. R.","year":"1979"},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1145\/357172.357176"},{"key":"e_1_2_1_11_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230150203"},{"key":"e_1_2_1_12_2","doi-asserted-by":"publisher","DOI":"10.4064\/fm-10-1-96-115"},{"key":"e_1_2_1_13_2","doi-asserted-by":"publisher","DOI":"10.1145\/322186.322188"},{"key":"e_1_2_1_14_2","doi-asserted-by":"publisher","DOI":"10.1109\/PGEC.1967.264748"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230220503","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230220503","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,24]],"date-time":"2023-10-24T01:34:00Z","timestamp":1698111240000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230220503"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,8]]},"references-count":13,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1992,8]]}},"alternative-id":["10.1002\/net.3230220503"],"URL":"https:\/\/doi.org\/10.1002\/net.3230220503","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992,8]]}}}