Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Efficient identification of Web communities
Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Search and replication in unstructured peer-to-peer networks
ICS '02 Proceedings of the 16th international conference on Supercomputing
Mapping the Gnutella Network: Macroscopic Properties of Large-Scale Peer-to-Peer Systems
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
Experimenting with Gnutella Communities
DCW '02 Revised Papers from the 4th International Workshop on Distributed Communities on the Web
Tracing a Large-Scale Peer to Peer System: An Hour in the Life of Gnutella
CCGRID '02 Proceedings of the 2nd IEEE/ACM International Symposium on Cluster Computing and the Grid
Building Peer-to-Peer Systems with Chord, a Distributed Lookup Service
HOTOS '01 Proceedings of the Eighth Workshop on Hot Topics in Operating Systems
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
SDQE: towards automatic semantic query optimization in P2P systems
Information Processing and Management: an International Journal - Special issue: Formal methods for information retrieval
Eliminating clustering in the propagation tree of semantic peer-to-peer networks
PDCN'06 Proceedings of the 24th IASTED international conference on Parallel and distributed computing and networks
Improving Gnutella network performance using synthetic coordinates
QShine '06 Proceedings of the 3rd international conference on Quality of service in heterogeneous wired/wireless networks
A reputation-based system model for P2P networks
ACST'07 Proceedings of the third conference on IASTED International Conference: Advances in Computer Science and Technology
Neighbor selection in peer-to-peer networks using semantic relations
SEPADS'05 Proceedings of the 4th WSEAS International Conference on Software Engineering, Parallel & Distributed Systems
SDQE: towards automatic semantic query optimization in P2P systems
Information Processing and Management: an International Journal - Special issue: Formal methods for information retrieval
An interest-based intelligent link selection algorithm in unstructured P2P environment
ICA3PP'07 Proceedings of the 7th international conference on Algorithms and architectures for parallel processing
An effective approach based on rough set and topic cluster to build peer communities
ISPA'07 Proceedings of the 5th international conference on Parallel and Distributed Processing and Applications
| Hi-index | 0.00 |
Peer-to-peer, or simply P2P, systems have recently emerged as a popular paradigm for building distributed applications. One key aspect of the P2P system design is the mechanism used for content location. A number of different approaches are currently in use. In particular, the location algorithm used in Gnutella, a popular and extensively analyzed P2P file sharing application, is based on flooding of messages in the network, which results in significant processing overhead on the participant nodes and thus, poor performance.In this paper, we provide an extensive performance evaluation of alternative algorithms for content location and retrieval in P2P systems, in particular, the Freenet and Gnutella systems. We compare the original Freenet and Gnutella algorithms, a previously proposed interest-based algorithm and two new algorithms which also explore locality of interest among peers to efficiently allow content location. Unlike previous proposals, the new algorithms organize the peers into communities that share interests. Two peers are said to have common interest if they share some of the locally stored files.In order to evaluate the performance of these algorithms, we use a previously developed Freenet simulator and build a new Gnutella simulator, which includes several realistic system characteristics. We show that the new community-based algorithms improve the original Gnutella content location latency (and thus the system QoS) and system load by up to 31% and 30%, respectively. Our algorithms also reduce the average Freenet request and response path lengths by up to 39% and 31%, respectively. Furthermore, we show that, compared to the previously proposed interest-based algorithm, our new algorithms improve query latency by up to 27% without a significant increase in the load.