Proactive gossip-based management of semantic overlay networks

Concurrency and Computation: Practice and Experience

Volumn 19, Issue 17, 2007, Pages 2299-2311

  Voulgaris, Spyros ^a   Van Steen, Maarten ^b   Iwanicki, Konrad ^b  

^a ETH ZURICH   (Switzerland)

^b VU UNIVERSITY AMSTERDAM   (Netherlands)

Author keywords

Gossip based protocols; Peer to peer search networks; Semantic overlay networks

Indexed keywords

COMPUTER SIMULATION; DISTRIBUTED COMPUTER SYSTEMS; NETWORK PROTOCOLS; TELECOMMUNICATION NETWORKS; USER INTERFACES;

GOSSIP-BASED PROTOCOLS; PEER-TO-PEER SEARCH NETWORKS; SEMANTIC OVERLAY NETWORKS;

SEMANTICS;

EID: 35948954027     PISSN: 15320626     EISSN: 15320634     Source Type: Journal    
DOI: 10.1002/cpe.1225     Document Type: Article

References (16)

1. Risson J, Moors T. Survey of research towards robust peer-to-peer networks: Search methods. Technical Report UNSW-EE-P2P-I-I, University of New South Wales, Sydney, Australia, September 2004.
2. Albert R, Barabasi A-L. Statistical mechanics of complex networks. Reviews of Modern Physics 2001; 74(1):47-97.
3. Newman MEJ. Random graphs as models of networks. Handbook of Graphs and Networks: From the Genome to the Internet, ch. 2, Bomholdt S, Schuster HG (eds.). Wiley: New York, NY, 2002.
4. Jelasity M, Guerraoui R, Kermarrec A-M, van Steen M. The peer sampling service: Experimental evaluation of unstructured gossip-based implementations. Middleware 2004 (Lecture Notes in Computer Sciences, vol. 3231). ACM/IFIP/USENIX. Springer: Berlin, 2004.
5. Fessant F, Handurukande S, Kermarrec A-M, Massoulié L. Clustering in peer-to-peer file sharing workloads. Third International Workshop on Peer-to-Peer Systems (IPTPS), San Diego, U.S.A., February 2004.
6. Watts DJ. Small Worlds. The Dynamics of Networks between Order and Randomness. Princeton University Press: Princeton, NJ, 1999.
7. Voulgaris S, Gavidia D, van Steen M. Cyclon: Inexpensive membership management for unstructured p2p overlays. Journal of Network and Systems Management 2005; 13(2): 197-217.
8. PeerSim. http://peersim.sourceforge.net/ [July 2007].
9. eDonkey. http://www.edonkey2000.com/ [November 2003].
10. Handurukande S, Kermarrec A-M, Le Fessant F, Massoulié L. Exploiting semantic clustering in the edonkey p2p network. Eleventh ACM SIGOPS European Workshop (SIGOPS), Leuven, Belgium, September 2004.
11. Saroiu S, Gummadi KP, Gribble SD. Measuring and analyzing the characteristics of Napster and Gnutella hosts. ACM Multimedia Systems 2003; 9(2): 170-184.
12. Bloom BH. Space/time trade-offs in hash coding with allowable errors. Communications of ACM 1970; 13(7):422-426.
13. Sripanidkulchai K, Maggs B, Zhang H. Efficient content location using interest-based locality in peer-to-peer systems. INFOCOM Conference. San Francisco, U.S.A., 2003.
14. Voulgaris S, Kermarrec A, Massoulié L, van Steen M. Exploiting semantic proximity in peer-to-peer content searching. Tenth International Workshop on Future Trends in Distributed Computing Systems (FTDCS 2004), Suzhu, China, November 2001.
15. Adar E, Huberman BA. Free riding on gnutella. First Monday 2000. Avaiable at: http://firstmonday.org/issues/issue5_10/adar/.
16. Jelasity M, Babaoglu O. T-Man: Gossip-based overlay topology management. In Engineering Self-Organising Systems: Third International Workshop (ESOA 2005) (Lecture Notes in Computer Science, vol. 3910), Brueckner SA, Di Marzo Serugendo G, Hales D, Zambonelli F (eds.), Revised Selected Papers. Springer-Verlag, 2006; 1-15. DOI: 10.1007/11734697_1.