An Interested-based Architecture for Peer-to-Peer Network Systems

Improving search performance is an important issue in peer-to-peer (P2P) network systems. Although distributed hash tables (DHTs) route queries more efficiently than flooding does, it´s complicated for DHTs to support keyword-based searches. Emerging large-scale P2P systems employ clustering to reduce message overheads and provide system scalability. In this paper, we propose an architecture based on interest groups to improve search performance in P2P networks. Query messages are first sent to interested peers that have high probability to hit the queries. Simulation results show that the proposed architecture outperforms related works in terms of message overheads, search latency, and query hit ratio