Making gnutella-like P2P systems scalable
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Using locality of reference to improve performance of peer-to-peer applications
WOSP '04 Proceedings of the 4th international workshop on Software and performance
A Distributed Approach to Solving Overlay Mismatching Problem
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
Modeling and performance analysis of BitTorrent-like peer-to-peer networks
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
A case study in building layered DHT applications
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
Efficient search for peer-to-peer information retrieval using semantic small world
Proceedings of the 15th international conference on World Wide Web
Rumor Riding: Anonymizing Unstructured Peer-to-Peer Systems
ICNP '06 Proceedings of the Proceedings of the 2006 IEEE International Conference on Network Protocols
State-based search strategy in unstructured P2P
Future Generation Computer Systems
| Hi-index | 0.00 |
Nowadays, most of the running P2P file sharing systems, such as Gnutella, generally adopt an unstructured topology and flooding search algorithms, which facing very serious search efficiency problem. In this paper, we proposed a novel intelligent link selection algorithm to address the search efficiency problem by exploiting the principle of interest-based locality. Specifically, peers continually build new connections with the others peers with same interests, this enables peers find its interest files in the nearby ones. In addition, in order to avoid adding too many connections in the overlay network which may lead the flooding search produce excessive redundant message as a consequence, we adopt a dynamic balance mechanism to delete the connection between peers which brings the least useful message. The simulation study shows our algorithm can significantly cut down the reply path lengths, achieve high search success rate with smaller search scope, and reduce the total communication cost in unstructured P2P systems.