{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,11]],"date-time":"2025-07-11T10:34:53Z","timestamp":1752230093003},"reference-count":12,"publisher":"World Scientific Pub Co Pte Lt","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Inter. Net."],"published-print":{"date-parts":[[2008,12]]},"abstract":"<jats:p> Current studies of \"messy\" broadcasting have so far concentrated on finding worst-case times. However, such worst-case scenarios are extremely unlikely to occur in general. Hence, determining average-case times or tight upper bounds for completing \"messy\" broadcasting in various network topologies is both necessary and meaningful in practice. In this paper, we focus on seeking the average-case \"messy\" broadcast times of stars, paths, cycles, and d-ary trees, and finding good upper bounds for hypercubes. Finally, we derive a recursive formula to express the average-case time for a specific \"messy\" broadcast model on a complete graph using a classical occupancy problem in probability theory, and provide a nice simulation result which indicates that this model behaves like classical broadcasting. <\/jats:p>","DOI":"10.1142\/s0219265908002400","type":"journal-article","created":{"date-parts":[[2009,1,21]],"date-time":"2009-01-21T04:42:38Z","timestamp":1232512958000},"page":"487-505","source":"Crossref","is-referenced-by-count":4,"title":["AVERAGE-CASE \"MESSY\" BROADCASTING"],"prefix":"10.1142","volume":"09","author":[{"given":"CHENKUAN","family":"LI","sequence":"first","affiliation":[{"name":"Department of Mathematics and Computer Science, Brandon University, Brandon, MB, Canada, R7A 6A9, Canada"}]},{"given":"THOMAS E.","family":"HART","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Toronto, Toronto, ON, Canada, M5S 3G4, Canada"}]},{"given":"KEVIN J.","family":"HENRY","sequence":"additional","affiliation":[{"name":"Department of Mathematics and Computer Science, Brandon University, Brandon, MB, Canada, R7A 6A9, Canada"}]},{"given":"IAN A.","family":"NEUFELD","sequence":"additional","affiliation":[{"name":"Department of Mathematics and Computer Science, Brandon University, Brandon, MB, Canada, R7A 6A9, Canada"}]}],"member":"219","published-online":{"date-parts":[[2011,11,21]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-2694-0_2"},{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1142\/S0219265903000726"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(79)90022-0"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.3240010406"},{"key":"rf5","volume-title":"An Introduction to Probability Theory and its Applications","author":"Feller W.","year":"1950"},{"key":"rf6","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(94)90180-5"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(85)90059-9"},{"key":"rf8","first-page":"181","volume":"156","author":"Hart T. E.","journal-title":"Congressus Numerantium"},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1142\/S0129626498000171"},{"key":"rf10","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230180406"},{"key":"rf11","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2491-2_5"},{"key":"rf12","doi-asserted-by":"publisher","DOI":"10.1137\/0147013"}],"container-title":["Journal of Interconnection Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0219265908002400","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T23:33:25Z","timestamp":1565134405000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0219265908002400"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,12]]},"references-count":12,"journal-issue":{"issue":"04","published-online":{"date-parts":[[2011,11,21]]},"published-print":{"date-parts":[[2008,12]]}},"alternative-id":["10.1142\/S0219265908002400"],"URL":"https:\/\/doi.org\/10.1142\/s0219265908002400","relation":{},"ISSN":["0219-2659","1793-6713"],"issn-type":[{"value":"0219-2659","type":"print"},{"value":"1793-6713","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,12]]}}}