Average-Case "Messy" Broadcasting

Abstract

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 averagecase 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.

HUB-GA: A heuristic for universal lists broadcasting using genetic algorithm

“…Moreover, the idea of degree-based heuristics is claimed to be efficient under the classical model, such as the AM algorithm provided in [24]. Besides, not only the worst behavior of random broadcasting in a network, a.k.a messy broadcasting, has received a lot of attention from researchers [8], [9], [109], but also the average-case random broadcasting time of various networks are studied in [110].…”

Messy broadcasting — Decentralized broadcast schemes with limited knowledge

“…Messy broadcasting is a concept introduced by Ahlswede et al [1] and further examined by various authors [4,15,16,21]. (A more descriptive phrase might be synchronous anonymous broadcasting, but for historical reasons we will continue to use the term ''messy''.)…”