Associative search in peer to peer networks: Harnessing latent semantics
Computer Networks: The International Journal of Computer and Telecommunications Networking
Indexing through Querying in Unstructured Peer-to-Peer Overlay Networks
APNOMS '08 Proceedings of the 11th Asia-Pacific Symposium on Network Operations and Management: Challenges for Next Generation Network Operations and Service Management
A path-traceable query routing mechanism for search in unstructured peer-to-peer networks
Journal of Network and Computer Applications
Realization of topology awareness in peer-to-peer wireless network
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
BF-chord: an improved lookup protocol to chord based on Bloom Filter for wireless P2P
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
A proposal of P2P content retrieval system using access-based grouping technique
KES'10 Proceedings of the 14th international conference on Knowledge-based and intelligent information and engineering systems: Part III
A scalable multi-attribute range query approach on cluster-based hybrid overlays
MTPP'10 Proceedings of the Second Russia-Taiwan conference on Methods and tools of parallel programming multicomputers
Fuzzy-based load self-configuration in mobile P2P services
Computer Networks: The International Journal of Computer and Telecommunications Networking
Review: A survey on content-centric technologies for the current Internet: CDN and P2P solutions
Computer Communications
Proactive replication for rare objects in unstructured peer-to-peer networks
Journal of Network and Computer Applications
SMBSRP: a search mechanism based on interest similarity, query relevance and distance prediction
IWANN'13 Proceedings of the 12th international conference on Artificial Neural Networks: advances in computational intelligence - Volume Part I
An efficient resource discovery framework for pure unstructured peer-to-peer systems
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
In the past few years, peer-to-peer (P2P) networks have become a promising paradigm for building a wide variety of distributed systems and applications. The most popular P2P application till today is file sharing, e.g., Gnutella, Kazza, etc. These systems are usually referred to as unstructured, and search in unstructured P2P networks usually involves flooding or random walking. On the other hand, in structured P2P networks (DHTs), search is usually performed by looking up a distributed inverted index. The efficiency of the search mechanism is the key to the scalability of a P2P content sharing system. So far, neither unstructured nor structured P2P networks alone can solve the search problem in a satisfactory way. In this paper, we propose to combine the strengths of both unstructured and structured P2P networks to achieve more efficient search. Specifically, we propose to enhance search in unstructured P2P overlay networks by building a partial index of shared data using a structured P2P network. The index maintains two types of information: the top interests of peers and globally unpopular data, both characterized by data properties. The proposed search protocol, assisted search with partial indexing, makes use of the index to improve search in three ways: first, the index assists peers to find other peers with similar interests and the unstructured search overlay is formed to reflect peer interests. Second, the index also provides search hints for those data difficult to locate by exploring peer interest locality, and these hints can be used for second-chance search. Third, the index helps to locate unpopular data items. Experiments based on a P2P file sharing trace show that the assisted search with a lightweight partial indexing service can significantly improve the success rate in locating data than Gnutella and a hit-rate-based protocol in unstructured P2P systems, while incurring low search latency and overheads.