The peer sampling service: Experimental evaluation of unstructured gossip-based implementations

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

Volumn 3231, Issue , 2004, Pages 79-98

  Jelasity, Márk ^a,b   Guerraoui, Rachid ^c   Kermarrec, Anne Marie ^d   Van Steen, Maarten ^e  

^a UNIVERSITY OF BOLOGNA   (Italy)

^b RGAI   (Hungary)

^c EPFL   (Switzerland)

^d INRIA   (France)

^e VU UNIVERSITY AMSTERDAM   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; DISTRIBUTED COMPUTER SYSTEMS; INFORMATION DISSEMINATION; INFORMATION MANAGEMENT; MIDDLEWARE; TOPOLOGY;

COMMUNICATION MODELING; EXPERIMENTAL ANALYSIS; EXPERIMENTAL EVALUATION; GOSSIP-BASED PROTOCOL; LARGE-SCALE DISTRIBUTED SYSTEM; MEMBERSHIP INFORMATION; THEORETICAL APPROACH; UNSTRUCTURED OVERLAYS;

IMPORTANCE SAMPLING;

EID: 35048865013     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30229-2_5     Document Type: Article

References (30)

1. R. Albert and A.-L. Barabási. Statistical mechanics of complex networks. Reviews of Modern Physics, 74(1):47-97, January 2002.
2. R. Albert, H. Jeong, and A.-L. Barabási. Error and attack tolerance of complex networks. Nature, 406:378-382, 2000.
3. A.-L. Barabási. Linked: the new science of networks. Perseus, Cambridge, Mass., 2002.
4. K. P. Birman, M. Hayden, O. Ozkasap, Z. Xiao, M. Budiu, and Y. Minsky. Bimodal multicast. ACM Transactions on Computer Systems, 17(2):41-88, May 1999.
5. F. Dabek, B. Zhao, P. Druschel, J. Kubiatowicz, and I. Stoica. Towards a common API for structured peer-to-peer overlays. In Proc. of the 2nd International Workshop on Peer-to-Peer Systems (IPTPS'03), Berkeley, CA, USA, February 2003.
6. A. Demers, D. Greene, G. Hauser, W. Irish, J. Larson, S. Shenker, H. Sturgis, D. Swinehart, and D. Terry. Epidemic algorithms for replicated database management. In Proc. of the 6th Annual ACM Symposium on Principles of Distributed Computing (PODC'87), pages 1-12, Vancouver, August 1987. ACM.
7. S. N. Dorogovtsev and J. F. F. Mendes. Evolution of networks. Advances in Physics, 51:1079-1187, 2002.
8. P. T. Eugster, R. Guerraoui, S. B. Handurukande, A.-M. Kermarrec, and P. Kouznetsov. Lightweight probabilistic broadcast. ACM Transactions on Computer Systems, 21(4):341-374, 2003.
9. P. T. Eugster, R. Guerraoui, A.-M. Kermarrec, and L. Massoulié. Epidemic information dissemination in distributed systems. IEEE Computer, 37(5):60-67, May 2004.
10. A. J. Ganesh, A.-M. Kermarrec, and L. Massoulié. Peer-to-peer membership management for gossip-based protocols. IEEE Transactions on Computers, 52(2), February 2003.
11. I. Gupta, K. P. Birman, and R. van Renesse. Fighting fire with fire: using randomized gossip to combat stochastic scalability limits. Quality and Reliability Engineering International, 18(3):165-184, 2002.
12. M. Jelasity, W. Kowalczyk, and M. van Steen. Newscast computing. Technical Report IR-CS-006, Vrije Universiteit Amsterdam, Department of Computer Science, Amsterdam, The Netherlands, November 2003.
13. M. Jelasity, W. Kowalczyk, and M. van Steen. An approach to massively distributed aggregate computing on peer-to-peer networks. In Proc. of the 12th Euromicro Conference on Parallel, Distributed and Network-Based Processing (PDP'04), pages 200-207, A Coruna, Spain, 2004. IEEE Computer Society.
14. M. Jelasity and A. Montresor. Epidemic-style proactive aggregation in large overlay networks. In Proc. of the 24th International Conference on Distributed Computing Systems (ICDCS S004), pages 102-109, Tokyo, Japan, 2004. IEEE Computer Society.
15. M. Jelasity, A. Montresor, and O. Babaoglu. A modular paradigm for building self-organizing peer-to-peer applications. In G. Di Marzo Serugendo, A. Karageor-gos, O. F. Rana, and F. Zambonelli, editors, Engineering Self-Organising Systems, number 2977 in LNCS, pages 265-282. Springer, 2004.
16. D. Kempe, A. Dobra, and J. Gehrke. Gossip-based computation of aggregate information. In Proc. of the 44th Annual IEEE Symposium on Foundations of Computer Science (FOCS'03), pages 482-491. IEEE Computer Society, 2003.
17. A.-M. Kermarrec, L. Massoulié, and A. J. Ganesh. Probablistic reliable dissemination in large-scale systems. IEEE Transactions on Parallel and Distributed Systems, 14(3), March 2003.
18. C. Law and K.-Y. Siu. Distributed construction of random expander graphs. In Proc. of the 22nd Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM'2003), San Francisco, California, USA, April 2003.
19. D. Loguinov, A. Kumar, V. Rai, and S. Ganesh. Graph-theoretic analysis of structured peer-to-peer systems: Routing distances and fault resilience. In Proc. of ACM SIGCOMM, pages 395-406, 2003.
20. A. Montresor, M. Jelasity, and O. Babaoglu. Robust aggregation protocols for large-scale overlay networks. In Proc. of the 2004 International Conference on Dependable Systems and Networks (DSN), pages 19-28, Florence, Italy, 2004. IEEE Computer Society.
21. M. E. J. Newman. Random graphs as models of networks. In S. Bornholdt and H. G. Schuster, editors, Handbook of Graphs and Networks: From the Genome to the Internet, chapter 2. John Wiley, New York, NY, 2002.
22. G. Pandurangan, P. Raghavan, and E. Upfal. Building low-diameter peer-to-peer networks. IEEE Journal on Selected Areas in Communications (JSAC), 21(6):995-1002, August 2003.
23. R. Pastor-Satorras and A. Vespignani. Epidemic dynamics and endemic states in complex networks. Physical Review E, 63:066117, 2001.
24. B. Pittel. On spreading a rumor. SIAM Journal on Applied Mathematics, 47(1):213-223, February 1987.
25. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Schenker. A scalable content-addressable network. In Proc. of ACM SIGCOMM, pages 161-172, 2001.
26. A. Rowstron and P. Druschel. Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In R. Guerraoui, editor, Middleware 2001, volume 2218 of LNCS, pages 329-350. Springer, 2001.
27. I. Stoica, R. Morris, D. Karger, M. F. Kaashoek, and H. Balakrishnan. Chord: A scalable peer-to-peer lookup service for internet applications. In Proc. of ACM SIGCOMM, pages 149-160, 2001.
28. R. Van Renesse, K. P. Birman, and W. Vogels. Astrolabe: A robust and scalable technology for distributed system monitoring, management, and data mining. ACM Transactions on Computer Systems, 21(2), May 2003.
29. S. Voulgaris and M. van Steen. An epidemic protocol for managing routing tables in very large peer-to-peer networks. In Proc. of the 14th IFIP/IEEE International Workshop on Distributed Systems: Operations and Management, (DSOM 2003), number 2867 in LNCS. Springer, 2003.
30. D. J. Watts and S. H. Strogatz. Collective dynamics of 'small-world' networks. Nature, 393:440-442, 1998.