{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T16:26:44Z","timestamp":1775838404055,"version":"3.50.1"},"reference-count":20,"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>Consider a network in which <jats:italic>n<\/jats:italic> processors are connected by unreliable lines and are allowed to communicate with at most one other processor at a time. In this paper, the problems of broadcasting and gossiping are considered. Broadcast is the task of transmitting a message, originated at one node, to all other nodes in the network. Gossiping refers to the process of information dissemination when each processor knows a unique item of information and must transmit it to all the other processors in the network. In this paper, new bounds on fault\u2010tolerant broadcasting and gossiping times are obtained. The given bounds improve on previously known results. In particular, if <jats:italic>n<\/jats:italic> is a power of two, the given broadcast and gossiping schemes require minimum time and are supported by a network having the minimum possible number of edges.<\/jats:p>","DOI":"10.1002\/net.3230220505","type":"journal-article","created":{"date-parts":[[2007,5,12]],"date-time":"2007-05-12T12:48:51Z","timestamp":1178974131000},"page":"469-486","source":"Crossref","is-referenced-by-count":30,"title":["Tighter time bounds on fault\u2010tolerant broadcasting and gossiping"],"prefix":"10.1002","volume":"22","author":[{"given":"Luisa","family":"Gargano","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","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(88)90037-6"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1137\/0602002"},{"key":"e_1_2_1_5_2","first-page":"110","article-title":"Constructing minimal broadcast networks","volume":"10","author":"Chau S. C.","year":"1985","journal-title":"J. Comb. Info. Syst. Sci."},{"key":"e_1_2_1_6_2","first-page":"1","article-title":"Construction fault\u2010tolerant minimal broadcast networks","volume":"11","author":"Chau S. C.","year":"1986","journal-title":"J. Comb. Info. Syst. Sci."},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230090404"},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(79)90022-0"},{"key":"e_1_2_1_9_2","first-page":"189","article-title":"Broadcasting in tress with multiple originators","volume":"2","author":"Farley A. M.","year":"1979","journal-title":"SIAM J. Alg. Discrete Methods"},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230190606"},{"key":"e_1_2_1_11_2","article-title":"Minimum time broadcast networks tolerating a logarithmic number of faults","author":"Gargano L.","journal-title":"SIAM J. Discrete Math."},{"key":"e_1_2_1_12_2","doi-asserted-by":"publisher","DOI":"10.1137\/0404021"},{"key":"e_1_2_1_13_2","doi-asserted-by":"publisher","DOI":"10.1137\/0608036"},{"key":"e_1_2_1_14_2","doi-asserted-by":"publisher","DOI":"10.4153\/CMB-1972-081-0"},{"key":"e_1_2_1_15_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230180406"},{"key":"e_1_2_1_16_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(75)90090-4"},{"key":"e_1_2_1_17_2","volume-title":"Introduction to Finite Fields and Their Applications","author":"Lidl R.","year":"1986"},{"key":"e_1_2_1_18_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230150203"},{"key":"e_1_2_1_19_2","unstructured":"G.Maddaluno Algorithms for the constructions of fault\u2010tolerant networks(in Italian). Thesis Universit\u00e0 di Salerno."},{"key":"e_1_2_1_20_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230190706"},{"key":"e_1_2_1_21_2","doi-asserted-by":"publisher","DOI":"10.1137\/0401013"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230220505","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230220505","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,24]],"date-time":"2023-10-24T01:34:06Z","timestamp":1698111246000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230220505"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,8]]},"references-count":20,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1992,8]]}},"alternative-id":["10.1002\/net.3230220505"],"URL":"https:\/\/doi.org\/10.1002\/net.3230220505","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]]}}}