Academia.eduAcademia.edu

Outline

Randomized rumor spreading in non-static networks

2011, ICTC 2011

https://doi.org/10.1109/ICTC.2011.6082571

Abstract

Rumor spreading plays an important role in social communications. Moreover, it forms the basis for an important class of communication protocols called gossip algorithms, which are used for large-scale information dissemination in networks.

References (17)

  1. S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah, "Randomized gossip algorithms," IEEE Trans. Inf. Theory, vol. 52, no. 6, pp. 2508-2530, Jun. 2006.
  2. D. Mosk-aoyama and D. Shah, "Fast gossip algorithm for computing separable function," IEEE Trans. Inf. Theory, vol. 54, no. 7, pp. 2997- 3007, Jul. 2008.
  3. U. Feige, D. Peleg, P. Raghavan, and E. Upfal, "Randomized broadcast in networks," Random Structure and Algorithms, vol. 1, no. 4, pp. 447- 460, 1990.
  4. B. Pittel, "On spreading a rumor," SIAM J. Appl. Math., vol. 47, no. 1, pp. 213-223, Feb. 1987.
  5. A. Demers, D. Greene, C. Hauser, W. Irish, J. Larson, S. Shenker, H. Sturgis, D. Swinehart, and D. Terry, "Epidemic algorithms for replicated database maintenance," in Proc. ACM Symp. on Principles of Distrib. Comput., Vancouver, BC, Canada, Aug. 1987, pp. 1-12.
  6. R. Karp, C. Schindelhauer, S. Shenker, and B. Vocking, "Randomized rumor spreading," in Proc. IEEE Symp. Found. Comput. Sci., Redondo Beach, CA, Nov. 2000, pp. 565-574.
  7. D. W. Krumme, G. Cybenko, and K. N. Venkataraman, "Gossiping in minimal time," SIAM J. Comp., vol. 21, no. 1, pp. 111-139, 1992.
  8. R. Ravi, "Rapid rumor ramification: Approximating the minimum broad- cast time," in Proc. IEEE Symp. Found. Comput. Sci., Santa Fe, NM, Nov. 1994, pp. 200-213.
  9. I. Gaber and Y. Mansour, "Broadcast in radio networks," in Proc. ACM- SIAM Symp. Discrete Algorithms, San Francisco, CA, Jan. 1995, pp. 577-585.
  10. L. Massoulie, A. Twigg, C. Gkantsidis, and P. Rodriguez, "Randomized decentralized broadcasting algorithms," in Proc. IEEE Joint Conf. of the IEEE Computer and Commun. Societies, San Francisco, CA, May. 2007, pp. 1073-1081.
  11. R. Elsasser and T. Sauerwald, "On the runtime and robustness of randomized broadcasting," Theoretical Comput. Sci., vol. 410, no. 36, pp. 3414-3427, Aug. 2009.
  12. A. M. Frieze and G. R. Grimmett, "The shortest-path problem for graphs with random arc-lengths," Discrete Appl. Math., vol. 10, no. 1, pp. 55- 77, Jan. 1985.
  13. F. Chierichetti, S. Lattanzi, and A. Panconesi, "Rumor spreading in social networks," in Proc. Int. Collogquium on Automata, Languages and Programming, Rhodes, Greece, Jul. 2009, pp. 375-386.
  14. D. Kempe, A. Dobra, and J. Gehrke, "Gossip-based computation of aggregate information," in Proc. IEEE Symp. Found. Comput. Sci., Cambridge, MA, Oct. 2003, pp. 482-491.
  15. T. Sauerwald, "On mixing and edge expansion properties in randomized broadcasting," Algorithmica, vol. 56, no. 1, pp. 51-88, Jan. 2010.
  16. D. W. Soh, T. Q. S. Quek, and W. P. Tay, "Randomized broadcast in dynamic network environments," in Proc. IEEE Workshop on Signal Processing Advances in Wireless Commun., San Francisco, CA, Jun. 2011.
  17. T. S. Rappaport, Wireless Communications: Principles and Practice, 2nd ed. Prentice Hall, 2002.