On randomized broadcasting in Star graphs

Citations of this article
Mendeley users who have this article in their library.


One of the most frequently studied problems in the context of information dissemination in communication networks is the broadcasting problem. In this paper, we study the following robust, simple, and scalable randomized broadcasting protocol: at some time t an information is placed at one of the nodes of a graph G, and in the succeeding steps, each informed node chooses one of its neighbours in G uniformly at random, and sends the information to this neighbour. We show that this algorithm spreads an information to all nodes in a Star graph Sn of dimension n within O (log N) steps, with high probability, where N denotes the number of nodes in Sn. To obtain this result, we first establish lower bounds on the edge expansion of small subsets of nodes. Then we introduce a simple but powerful technique for estimating the runtime of randomized broadcasting by analyzing the protocol described above in the reverse order. Using this technique we can also simplify the analysis of this algorithm in Hypercubes [U. Feige, D. Peleg, P. Raghavan, E. Upfal, Randomized broadcast in networks, Random Structures and Algorithms 1 (4) (1990) 447-460]. © 2008 Elsevier B.V. All rights reserved.




Elsässer, R., Lorenz, U., & Sauerwald, T. (2009). On randomized broadcasting in Star graphs. Discrete Applied Mathematics, 157(1), 126–139. https://doi.org/10.1016/j.dam.2008.05.018

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free