On the communication complexity of randomized broadcasting in random-like graphs

Annual ACM Symposium on Parallelism in Algorithms and Architectures

Volumn 2006, Issue , 2006, Pages 148-157

  Elsässer, Robert ^a  

^a UNIVERSITY OF PADERBORN   (Germany)

Author keywords

Broadcasting; Random graphs

Indexed keywords

ALGORITHMS; BROADCASTING; COMPUTER NETWORKS; COMPUTER SCIENCE; GRAPH THEORY; MATHEMATICAL MODELS;

COMMUNICATION COMPLEXITY; COMMUNICATION FAILURES; MESSAGE TRANSMISSIONS; RANDOM GRAPHS;

COMPUTATIONAL COMPLEXITY;

EID: 33749567945     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1148109.1148135     Document Type: Conference Paper

References (26)

1. W. Aiello, F.R.K. Chung, and L. Lu. Random evolution in massive graphs. In Proc. of FOCS, pages 510-519, 2001.
2. A. Barabási and R. Albert. Emergence of scaling in random networks. Science, 286, 1999.
3. B. Bollobás. Random Graphs. Academic Press, 1985.
4. H. Chernoff. A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations. The Annals of Mathematical Statistics, 23:493-507, 1952.
5. F.R.K. Chung and L. Lu. Connected components in random graphs with given expected degre sequences. Annals of Combinatorics, 6:125-145, 2002.
6. F.R.K. Chung and L. Lu. The average distances in random graphs with given expected degrees. Internet Mathematics, 1:91-114, 2003.
7. F.R.K. Chung and L. Lu. Coupling on-line and off-line analyses for random power law graphs,. Internet Mathematics, 1:409-461, 2004.
8. F.R.K. Chung, L. Lu, and V. Vu. Eigenvalues of random power law graphs. Annals of Combinatorics, 7:21-33, 2003.
9. F.R.K. Chung, L. Lu, and V. Vu. The spectra of random graphs with given expected degrees. Proceedings of National Academy of Sciences, 100:6313-6318, 2003.
10. 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. of PODC'87, pages 1-12, 1987.
11. R. Elsässer. On randomized broadcasting in power law graphs. Manuscript, 2006.
12. R. Elsässer and B. Monien. Load balancing of unit size tokens and expansion properties of graphs. In Proc. of SPAA'03, pages 266-273, 2003.
13. R. Elsässer, B. Monien, and S. Schamberger. Load balancing of indivisible unit size tokens in dynamic and heterogeneous networks. In Proc. of ESA, pages 640-651, 2004.
14. P. Erdös and A. Rényi. On random graphs I. Publ. Math. Debrecen, 6:290-297, 1959.
15. P. Erdös and A. Rényi. On the evolution of random graphs. Publ. Math. Inst. Hungar. Acad. Sci., 5:17-61, 1960.
16. M. Faloutsos, P. Faloutsos, and C. Faloutsos. On power-law relationships of the Internet topology. Computer Communication Review, 29:251-263, 1999.
17. U. Feige, D. Peleg, P. Raghavan, and E. Upfal. Randomized broadcast in networks. Random Structures and Algorithms, 1(4):447-460, 1990.
18. L. Gasieniec and A. Pelc. Adaptive broadcasting with faulty nodes. Parallel Computing, 22:903-912, 1996.
19. E.N. Gilbert. Random graphs. The Annals of Mathematical Statistics, 30:1141-1144, 1959.
20. T. Hagerup and C. Rüb. A guided tour of Chernoff bounds. Information Processing Letters, 36(6):305-308, 1990.
21. R. Karp, C. Schindelhauer, S. Shenker, and B. Vöcking. Randomized rumor spreading. In Proc. of FOCS'00, pages 565-574, 2000.
22. D. Kempe, J. Kleinberg, and A. Demers. Spatial gossip and resource location protocols. In Proc. of STOC'01, pages 163-172, 2001.
23. T. Leighton, B. Maggs, and R. Sitamaran. On the fault tolerance of some popular bounded-degree networks. In Proc. of FOCS'92, pages 542-552, 1992.
24. M.D. Mitzenmacher. The Power of Two Choices in Randomized Load Balancing. PhD thesis, University of California at Berkeley, 1996.
25. M. Newman. The structure and function of complex networks. SIAM Review, 45:167-256, 2003.
26. B. Pittel. On spreading rumor. SIAM Journal on Applied Mathematics, 47(1):213-223, 1987.