Bayeux: an architecture for scalable and fault-tolerant wide-area data dissemination
NOSSDAV '01 Proceedings of the 11th international workshop on Network and operating systems support for digital audio and video
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Comparing Hybrid Peer-to-Peer Systems
Proceedings of the 27th International Conference on Very Large Data Bases
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
Design Considerations for Distributed Caching on the Internet
ICDCS '99 Proceedings of the 19th IEEE International Conference on Distributed Computing Systems
Scattercast: an architecture for internet broadcast distribution as an infrastructure service
Scattercast: an architecture for internet broadcast distribution as an infrastructure service
The Client Utility as a Peer-to-Peer System
Revised Papers from the NETWORKING 2002 Workshops on Web Engineering and Peer-to-Peer Computing
Data dissemination in mobile peer-to-peer networks
Proceedings of the 6th international conference on Mobile data management
Search strategies for scientific collaboration networks
Proceedings of the 2005 ACM workshop on Information retrieval in peer-to-peer networks
Probabilistic file indexing and searching in unstructured peer-to-peer networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
User modeling for full-text federated search in peer-to-peer networks
SIGIR '06 Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval
'Dominating-set-based' searching in peer-to-peer networks
International Journal of High Performance Computing and Networking
Semantically routing queries in peer-based systems: The h-link approach
The Knowledge Engineering Review
An investigation of Zipf's Law for fraud detection (DSS#06-10-1826R(2))
Decision Support Systems
PAIS: A Proximity-Aware Interest-Clustered P2P File Sharing System
CCGRID '09 Proceedings of the 2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid
Agent-organized networks for multi-agent production and exchange
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
An interest-based P2P file sharing system
CCNC'09 Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference
Same places, same things, same people?: mining user similarity on social media
Proceedings of the 2010 ACM conference on Computer supported cooperative work
| Hi-index | 0.00 |
As computing and communication capabilities have continued to increase, more and more activity is taking place at the edges of the network, typically in homes or on workers desktops. This trend has been demonstrated by the increasing popularity and usability of "peer-to-peer" systems such as Napster and Gnutella. Unfortunately, this popularity has quickly shown the limitations of these systems, particularly in terms of scale. Because the networks form in an adhoc manner, they typically make inefficient use of resources. We propose a mechanism, using only local knowledge, to improve the overall performance of peer-to-peer networks based on interests. Peers monitor which other peers frequently respond successfully to their requests for information. When a peer is discovered to frequently provide good results, the peer attempts to move closer to it in the network by creating a new connection with that peer. This leads to clusters of peers with similar interests, and in turn allows us to limit the depth of searches required to find good results. We have implemented our algorithm in the context of a distributed encyclopedia-style information sharing application which is built on top of the gnutella network. In our testing environment, we have shown the ability to greatly reduce the amount of communication resources required to find the desired articles in the encyclopedia.