Efficient randomised broadcasting in random regular networks with applications in peer-to-peer systems

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn , Issue , 2008, Pages 155-164

  Berenbrink, Petra ^a   Elsasser, Robert ^b   Friedetzky, Tom ^c  

^a SIMON FRASER UNIVERSITY   (Canada)

^b UNIVERSITY OF PADERBORN   (Germany)

^c DURHAM UNIVERSITY   (United Kingdom)

Author keywords

Broadcasting; Random regular graphs

Indexed keywords

BROADCASTING; COMMUNICATION CHANNELS (INFORMATION THEORY); DISTRIBUTED COMPUTER SYSTEMS; GRAPH THEORY; TELEPHONE SETS;

BROADCASTING ALGORITHM; LIMITED COMMUNICATION; MESSAGE TRANSMISSIONS; OBLIVIOUS ALGORITHMS; RANDOM D-REGULAR GRAPHS; RANDOM REGULAR GRAPH; REPLICATED DATABASE; SIMPLE MODIFICATIONS;

PEER TO PEER NETWORKS;

EID: 57549117089     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1400751.1400773     Document Type: Conference Paper

References (28)

1. B. Bollobás. Random Graphs. Academic Press, 1985.
2. S. M. Botros and S. R. Waterhause. Search in JXTA and other distributed networks. In Proc. of P2P'01, pp. 30-35, 2001.
3. S. Boyd, A. Ghosh, B. Prabhakar, and D. Shah, Randomized Gossip Algorithms. In IEEE Transactions on Information Theory and IEEE/ACM Transactions on Networking, 52:2508-2530, 2006.
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. C. Cooper, M. Dyer, and C. Greenhill. Sampling regular graphs and a peer-to-peer network. In Proc. of SODA'05, pp. 980-988, 2005.
6. 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, pp. 1-12, 1987.
7. B. Doerr, T. Friedrich, T. Sauerwald. Quasirandom Rumor Spreading In Proc. of SODA'08, pp. 773-781, 2008.
8. R. Elsässer. On the communication complexity of randomized broadcasting in random-like graphs. In Proc. of SPAA'06, pp. 148-157, 2006.
9. R. Elsässer and T. Sauerwald. Broadcasting vs. mixing and information dissemination on Cayley graphs. In Proc. of STACS'07, pp. 163-174, 2007.
10. R. Elsässer and T. Sauerwald. The power of memory in randomized broadcasting. In Proc. of SODA'08, pp. 290-227, 2008.
11. P. Erdös and A. Rényi. On random graphs I. Puhl. Math. Debrecen, 6:290-297, 1959.
12. P. Erdös and A. Rényi. On the evolution of random graphs. Puhl. Math. Inst. Hungar. Acad. Sci., 5:17-61, 1960.
13. 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, pp. 69-76, 2006.
14. U. Feige, D. Peleg, P. Raghavan, and E. Upfal. Randomized broadcast in networks. Random Structures and Algorithms, 1(4):447-460, 1990.
15. A. M. Frieze and G. R. Grimmett. The shortest-path problem for graphs with random arc-lengths. Discrete Applied Mathematics, 10:57-77, 1985.
16. Gnutella. The gnutella protocol specification v. 0.4.
17. T. Hagerup and C. Rub. A guided tour of Chernoff bounds. Information Processing Letters, 36(6):305-308, 1990.
18. S. Jaganriathan, G. Pandurangan, and S. Srinivasan. Query protocols for highly resilient peer-to-peer networks. In Proc. of ISCA PDCS'06, pp. 247-252, 2006.
19. R. Karp, C. Schindelhauer, S. Shenker, and B. Vocking. Randomized rumor spreading. In Proc. of FOCS'00, pp. 565-574, 2000.
20. D. Kempe, J. Kleinberg, and A. Demers. Spatial gossip and resource location protocols. In Proceedings of the 33rd Symposium on the Theory of Computing (STOC), pp. 163-172, 2001.
21. C. Law and K.-Y. Siu. Distributed construction of random expander networks. In Proceedings of the 22nd INFOCOM, pp. 2133-2143, 2003.
22. P. Mahlmann and C. Schindelhauer. Distributed random digraph transformations for peer-to-peer networks. In Proc. of SPAA'06, pp. 308-317, 2006.
23. B. D. McKay and N. C. Wormald. Asymptotic enumeration by degree sequence of graphs with degrees o(sqrt(n)). Combinatorica, 11:369-382, 1991.
24. M. Newman. The Structure and Function of Complex Networks. SIAM Review, 45(2): 167-256, 2003.
25. G. Pandurangan, P. Raghavan, and E. Upfal. Building low-diameter peer-to-peer networks. In Proc. of FOCS'01, pp. 492-499, 2001.
26. B. Pittel. On spreading rumor. SIAM Journal on Applied Mathematics, 47(1):213-223, 1987.
27. R. W. Robinson and N. C. Wormald. Almost all regular graphs are Hamiltonian. Random Stractures and Algorithms, 5:363-374, 1994.
28. T. Sauerwald. On Mixing and Edge Expansion Properties in Randomized Broadcasting. In Proc. of ISAAC'07, pp. 196-207, 2007.