The power of memory in randomized broadcasting

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2008, Pages 218-227

  Elsässer, Robert ^a   Sauerwald, Thomas ^b  

^a UNIVERSITY OF PADERBORN   (Germany)

^b Paderborn Institute for Scientific Computation (PaSCO GK)   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BROADCASTING; COMMUNICATION; COMMUNICATION CHANNELS (INFORMATION THEORY); DECODING; GRAPH THEORY; TELEPHONE; TELEPHONE SETS;

COMMUNICATION CHANNELS; COMMUNICATION FAILURES; COMMUNICATION OVERHEADS; HIGH PROBABILITY; MESSAGE TRANSMISSIONS; OPTIMALITY; RANDOM GRAPH MODELS; RANDOM GRAPHS; RUN TIME; SIMPLE MODIFICATIONS; TIME STEPPING;

ALGORITHMS;

EID: 58449119774     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (27)

1. N. Alon and J. Spencer. The Probabilistic Method. John Wiley, 1991.
2. B. Bollobas. Random Graphs. Academic Press, 1985.
3. S.M. Botros and S.R. Waterhause. Search in jxta and other distributed networks. In Proc. of P2P'01, pages 30-35, 2001.
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. Chung and L. Lu. Concentration inequalities and martingale inequalities - a survey. Internet Mathematics (to appear).
6. F. Chung and L. Lu. Connected components in random graphs with given expected degre sequences. Annals of Combinatorics, 6:125-145, 2002.
7. C. Cooper, M. Dyer, and C. Greenhill. Sampling regular graphs and a peer-to-peer network. In Proc. of SODA '05, pages 980-988, 2005.
8. 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.
9. Ft. Elsässer. On the communication complexity of randomized broadcasting in random-like graphs. In Proc. of SPAA'06, pages 148-157, 2006.
10. P. Erdös and A. Rényi. On random graphs I. Publ. Math. Debrecen, 6:290-297, 1959.
11. P. Erdös and A. Rényi. On the evolution of random graphs. Publ. Math. Inst. Hungar. Acad. Sci., 5:17-61, 1960.
12. T. Feder, A. Guetz, M. Mihail, and A. Saberi. A local switch Markov chain on given degree graphs with application in connectivity of peer-to-peer networks. In Proc. of FOCS'06, pages 69-76, 2006.
13. U. Feige, D. Peleg, P. Raghavan, and E. Upfal. Randomized broadcast in networks. Random Structures and Algorithms, 1(4):447-460, 1990.
14. A.M. Frieze and G.R. Grimmett. The shortest-path problem for graphs with random arc-lengths. Discrete Applied Mathematics, 10:57-77, 1985.
15. L. Gasieniec and A. Pelc. Adaptive broadcasting with faulty nodes. Parallel Computing, 22:903-912, 1996.
16. E.N. Gilbert. Random graphs. The Annals of Mathematical Statistics, 30:1141-1144, 1959.
17. Gnutella. The gnutella protocol specification v. 0.4.
18. T. Hagerup and C. Rüb. A guided tour of Chernoff bounds. Information Processing Letters, 36(6):305-308, 1990.
19. S. Jagannathan, G. Pandurangan, and S. Srinivasan. Query protocols for highly resilient peer-to-peer networks. In Proc. of ISC A PDCS'06, pages 247-252, 2006.
20. R. Karp, C. Schindelhauer, S. Shenker, and B. Vöcking. Randomized rumor spreading. In Proc. of FOCS'00, pages 565-574, 2000.
21. C. Law and K.-Y. Siu. Distributed construction of random expander networks. In Proc. of INFOCOM'03, pages 2133-2143, 2003.
22. 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.
23. P. Mahlmann and C. Schindelhauer. Distributed random digraph transformations for peer-to-peer networks. In Proc. of SPAA'06, pages 308-317, 2006.
24. B.D. McKay and N.C. Wormald. Asymptotic enumeration by degree sequence of graphs with degrees o(sqrt(n)). Combinatorica, 11:369-382, 1991.
25. M. Mitzenmacher. The Power of Two Choices in Randomized Load Balancing. PhD thesis, University of California at Berkeley, 1996.
26. B. Pittel. On spreading rumor. SIAM Journal on Applied Mathematics, 47(1):213-223, 1987.
27. N.C. Wormald. Models of random regular graphs. Surveys in Combinatorics, 276:293-298, 1999.