Exploiting semantic clustering in the eDonkey P2P network
- 19 September 2004
- conference paper
- conference paper
- Published by Association for Computing Machinery (ACM)
Abstract
Peer-to-peer file sharing now represents a significant portion of the Internet traffic and has generated a lot of interest from the research community. Some recent measurements studies of peer-to-peer workloads have demonstrated the presence of semantic proximity between peers. One way to improve performance of peer-to-peer file sharing systems is to exploit this locality of interest in order to connect semantically related peers so as to improve the search both in flooding- and server-based systems. Creating these additional connections raises interesting challenges and in particular (i) how to capture the semantic relationship between peers (ii) how to exploit these relationships and (iii) how to evaluate these improvements. In this paper, we evaluate several strategies to exploit the semantic proximity between peers against a real trace collected in November 2003 in the eDonkey 2000 peer-to-peer network. We present the results of this evaluation which confirm the presence of clustering in such networks and the interest to exploit it.Keywords
This publication has 8 references indexed in Scilit:
- The Case for a Hybrid P2P Search InfrastructureLecture Notes in Computer Science, 2005
- Clustering in Peer-to-Peer File Sharing WorkloadsPublished by Springer Science and Business Media LLC ,2005
- Measurement, modeling, and analysis of a peer-to-peer file-sharing workloadPublished by Association for Computing Machinery (ACM) ,2003
- Making gnutella-like P2P systems scalablePublished by Association for Computing Machinery (ACM) ,2003
- Understanding AvailabilityLecture Notes in Computer Science, 2003
- Search and replication in unstructured peer-to-peer networksPublished by Association for Computing Machinery (ACM) ,2002
- Analyzing peer-to-peer traffic across large networksPublished by Association for Computing Machinery (ACM) ,2002
- ChordPublished by Association for Computing Machinery (ACM) ,2001