On the Runtime and Robustness of Randomized Broadcasting

  • Robert Elsässer
  • Thomas Sauerwald
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4288)


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 randomized broadcasting protocol. At some time t an information r is placed at one of the nodes of a graph. In the succeeding steps, each informed node chooses one neighbor, independently and uniformly at random, and informs this neighbor by sending a copy of r to it.

In this work, we develop tight bounds on the runtime of the algorithm described above, and analyze its robustness. First, it is shown that on Δ-regular graphs this algorithm requires at least \(\log_{2-\frac{1}{\Delta}} N + \log_{ (\frac{\Delta}{\Delta-1})^{\Delta}} N -- o(\log N)\) rounds to inform all N nodes. For general graphs, we prove a slightly weaker lower bound and improve the upper bound of Feige et. al. [8] to (1+o(1)) N ln N which implies that K 1,N − − 1 is the worst-case graph. Furthermore, we determine the worst-case-ratio between the runtime of a fastest deterministic algorithm and the randomized one.

This paper also contains an investigation of the robustness of this broadcasting algorithm against random node failures. We show that if the informed nodes are allowed to fail in some step with probability 1–p, then the broadcasting time increases by a factor of at most 6/p. Finally, the previous result is applied to state some asymptotically optimal upper bounds for the runtime of randomized broadcasting in Cartesian products of graphs and to determine the performance of agent based broadcasting [6] in graphs with good expansion properties.


Random Graph Regular Graph General Graph Failure Model Graph Class 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Akers, S.B., Harel, D., Krishnamurthy, B.: The star graph: An attractive alternative to the n-cube. In: Proc. of ICPP, pp. 393–400 (1987)Google Scholar
  2. 2.
    Bollobás, B.: Random Graphs. Academic Press, London (1985)MATHGoogle Scholar
  3. 3.
    Capocelli, M., Gargano, L., Vaccaro, U.: Time bounds for broadcasting in bounded degree graphs. In: Nagl, M. (ed.) WG 1989. LNCS, vol. 411, pp. 19–33. Springer, Heidelberg (1990)Google Scholar
  4. 4.
    Chernoff, H.: A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations. Ann. Math. Stat. 23, 493–507 (1952)MATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Demers, A., Greene, D., Hauser, C., Irish, W., Larson, J., Shenker, S., Sturgis, H., Swinehart, D., Terry, D.: Epidemic algorithms for replicated database maintenance. In: Proc. of PODC 1987, pp. 1–12 (1987)Google Scholar
  6. 6.
    Elsässer, R., Lorenz, U., Sauerwald, T.: Agent based information handling in large networks. In: Fiala, J., Koubek, V., Kratochvíl, J. (eds.) MFCS 2004. LNCS, vol. 3153, pp. 686–698. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  7. 7.
    Elsässer, R., Sauerwald, T.: On randomized broadcasting in star graphs. In: Kratsch, D. (ed.) WG 2005. LNCS, vol. 3787, pp. 307–318. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  8. 8.
    Feige, U., Peleg, D., Raghavan, P., Upfal, E.: Randomized broadcast in networks. Random Structures and Algorithm 1(4), 447–460 (1990)MATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    Gasieniec, L., Pelc, A.: Adaptive broadcasting with faulty nodes. Parallel Computing 22, 903–912 (1996)MATHCrossRefGoogle Scholar
  10. 10.
    Gross, J.L., Yellen, J. (eds.): Handbook of Graph Theory. CRC Press, Boca Raton (2004)MATHGoogle Scholar
  11. 11.
    Hagerup, T., Rüb, C.: A guided tour of Chernoff bounds. Information Processing Letters 36(6), 305–308 (1990)CrossRefGoogle Scholar
  12. 12.
    Harper, L.H.: Optimal assignment of numbers to vertices. J. Soc. Ind. Appl. Math. 12, 131–135 (1964)MATHCrossRefMathSciNetGoogle Scholar
  13. 13.
    Hromkovic̆, J., Klasing, R., Pelc, A., Ruz̆ic̆ka, P., Unger, W.: Dissemination of Information in Communication Networks. Springer, Heidelberg (2005)MATHGoogle Scholar
  14. 14.
    Karp, R., Schindelhauer, C., Shenker, S., Vöcking, B.: Randomized rumor spreading. In: Proc. of FOCS 2000, pp. 565–574 (2000)Google Scholar
  15. 15.
    Leighton, F., Maggs, B., Sitamaran, R.: On the fault tolerance of some popular bounded-degree networks. In: Proc. of FOCS 1992, pp. 542–552 (1992)Google Scholar
  16. 16.
    Lovász, L.: Random walks on graphs: A survey. Combinatorics, Paul Erdös is Eighty 2, 1–46 (1993)Google Scholar
  17. 17.
    Malkhi, D., Mansour, Y., Reiter, M.K.: On diffusion updates in a byzantine environment. In: Proc. of 18th IEEE Symp. on Reliable Distributed Systems, pp. 134–143 (1999)Google Scholar
  18. 18.
    Mitzenmacher, M., Upfal, E.: Probability and Computing. Cambridge University Press, Cambridge (2005)MATHGoogle Scholar
  19. 19.
    Pittel, B.: On spreading rumor. SIAM Journal on Applied Mathematics 47(1), 213–223 (1987)MATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Robert Elsässer
    • 1
  • Thomas Sauerwald
    • 1
  1. 1.Institute for Computer ScienceUniversity of PaderbornPaderbornGermany

Personalised recommendations