On randomized broadcasting in power law networks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4167 LNCS, Issue , 2006, Pages 370-384

  Elsässer, Robert ^a  

^a UNIVERSITY OF PADERBORN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER NETWORKS; GRAPH THEORY; INTERNET; PROBABILITY; REAL TIME SYSTEMS;

BROADCASTING ALGORITHMS; COMMUNICATION COMPLEXITY; LARGE SCALE REAL WORLD NETWORKS; NODES;

BROADCASTING;

EID: 33845222506     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11864219_26     Document Type: Conference Paper

References (32)

1. W. Aiello, F.R.K. Chung, and L. Lu. Random evolution in massive graphs. In Proc. of FOCS'01, 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. B. Bollobás, O. Riordan, J. Spencer, and G. Tusnády. The degree sequence of a scale-free random graph process. Rand. Struct Alg., 18:279-290, 2001.
5. D. Callaway, J. Hopcroft, J. Kleinberg, M. Newman, and S. Strogatz. Are randomly grown graphs really random? Physical Review E, 64, 051902, 2001.
6. H. Chernoff. A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations. Ann. Math. Stat., 23(1):115-126, 1952.
7. F.R.K. Chung and L. Lu. Connected components in random graphs with given expected degre sequences. Annals of Combinatorics, 6:125-145, 2002.
8. F.R.K. Chung and L. Lu. The average distances in random graphs with given expected degrees. Internet Mathematics, 1:91-114, 2003.
9. F.R.K. Chung, L. Lu, and V. Vu. Eigenvalues of random power law graphs. Annals of Combinatorics, 7:21-33, 2003.
10. F.R.K. Chung, L. Lu, and V. Vu. The spectra of random graphs with given expected degrees. Proc. National Academy of Sciences, 100:6313-6318, 2003.
11. 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.
12. R. Elsässer. Bounding the communication complexity of randomized broadcasting in random-like graphs. Proc. of SPAA, 2006.
13. R. Elsässer, B. Monien, and S. Schamberger. Load balancing of indivisible unit size tokens in dynamic and heterogeneous networks. Proc. of ESA'04, pages 640-651, 2004.
14. P. Erdös and A. Rényi. On random graphs I. Publ. Math. Debrecen 6, pages 290-297, 1959.
15. M. Faloutsos, P. Faloutsos, and C. Faloutsos. On power-law relationships of the internet topology. Comput. Commun. Rev., 29:251-263, 1999.
16. U. Feige, D. Peleg, P. Raghavan, and E. Upfal. Randomized broadcast in networks. Random Structures and Algorithms, 1(4):447-460, 1990.
17. L. Gasieniec and A. Pelc. Adaptive broadcasting with faulty nodes. Parallel Computing, 22:903-912, 1996.
18. E.N. Gilbert. Random graphs. Ann. Math. Statist. 30, pages 1141-1144, 1959.
19. T. Hagerup and C. Rub. A guided tour of Chernoff bounds. Information Processing Letters, 36(6):305-308, 1990.
20. M. Henzinger. Algorithmic challenges in web search engines. Internet Mathematics, 1:493-507, 2003.
21. H.W. Hethcore. Mathematics of infectious diseases. SIAM Review 42, pages 599-653, 2000.
22. H. Jeong, B. Tomber, R. Albert, Z. Oltvai, and A.L. Barabási. The large-scale organization of metabolic networks. Nature, 407:378-382, 2000.
23. R. Karp, C. Schindelhauer, S. Shenker, and B. Vöcking. Randomized rumor spreading. Proc. of FOCS'00, pages 565-574, 2000.
24. D. Kempe, J. Kleinberg, and A. Demers. Spatial gossip and resource location protocols. Proc. of STOC'01, pages 163-172, 2001.
25. W.O. Kermack and A.G. McKendrick. Contributions to the mathematical theory of epidemics. Proc. Roy. Soc., pages 700-721, 1927.
26. J. Kleinberg, R. Kumar, P. Raghavan, S. Rajagoplan, and A. Tomkins. The Web as a graph: Measurements, models, and methods. In Proc. of COCOON'99, pages 1-17, 1999.
27. 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.
28. M.D. Mitzenmacher. The Power of Two Choices in Randomized Load Balancing. PhD thesis, University of California at Berkeley, 1996.
29. M. Newman. The structure and function of complex networks. SIAM Review, 45:167-256, 2003.
30. M. E. J. Newman. The spread of epidemic disease on networks. Phys. Rev. E 66, 016128, 2002.
31. B. Pittel. On spreading rumor. SIAM J. Appl. Math., 47(1):213-223, 1987.
32. M. Raab and A. Steger. "Balls into bins" a simple and tight analysis. In Proc. of RANDOM'98, pages 159-170, 1998.