{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,24]],"date-time":"2023-10-24T06:10:23Z","timestamp":1698127823190},"reference-count":7,"publisher":"Wiley","issue":"4","license":[{"start":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T00:00:00Z","timestamp":1160524800000},"content-version":"vor","delay-in-days":5215,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1992,7]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Consider a network consisting of units and links that connect pairs of units. Suppose each of the units possesses a unique message that is to be received by all other units. This is called gossiping. A related problem is that of census taking in which a particular unit has to receive every other unit's message. We study gossiping and census taking in a network in which the units communicate by transmitting packets of a fixed size, so that only a bounded number of messages can be sent in a single transmission. We also discuss the complexity of gossiping when the messages are of different sizes.<\/jats:p>","DOI":"10.1002\/net.3230220402","type":"journal-article","created":{"date-parts":[[2007,5,12]],"date-time":"2007-05-12T12:21:52Z","timestamp":1178972512000},"page":"317-333","source":"Crossref","is-referenced-by-count":18,"title":["Sequential information dissemination by packets"],"prefix":"10.1002","volume":"22","author":[{"given":"A.","family":"Bagchi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"E. F.","family":"Schmeichel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S. L.","family":"Hakimi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"key":"e_1_2_1_2_2","unstructured":"A.Bagchi Some additional results on gossiping with packets. Unpublished manuscript (1990)."},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(85)90008-3"},{"key":"e_1_2_1_4_2","volume-title":"Computers and Intractability: A Guide to the Theory of NP\u2010Completeness","author":"Garey M.","year":"1979"},{"key":"e_1_2_1_5_2","unstructured":"M. C.Golumbic The general gossip problem.IBM Research Report4977(1974)."},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1016\/0016-0032(74)90126-4"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230180406"},{"key":"e_1_2_1_8_2","volume-title":"Computer Networks","author":"Tanenbaum A. S.","year":"1981"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230220402","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230220402","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,23]],"date-time":"2023-10-23T11:13:38Z","timestamp":1698059618000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230220402"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,7]]},"references-count":7,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1992,7]]}},"alternative-id":["10.1002\/net.3230220402"],"URL":"https:\/\/doi.org\/10.1002\/net.3230220402","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,7]]}}}