Hash-Based Overlay Partitioning in Unstructured Peer-to-Peer Systems
DocUID: 2009-021 Full Text:
PDF Author: Harris Papadakis, Paraskevi Fragopoulou, Evangelos P. Markatos, Marios D. Dikaiakos, Alexandros Labrinidis
Abstract: Unstructured peer-to-peer (P2P) networks suffer from the increased volume of traffic produced by flooding. Methods such as random walks or dynamic querying managed to limit the traffic at the cost of reduced network coverage. In this paper, we propose a partitioning method of the unstructured overlay network into a relative small number of distinct subnetworks. The partitioning is driven by the categorization of keywords based on a uniform hash function. The method proposed in this paper is easy to implement and results in significant benefit for the blind flood method. Each search is restricted to a certain partition of the initial overlay network and as a result it is much more targeted. Last but not least, the search accuracy is not sacrificed to the least since all related content is searched. The benefit of the proposed method is demonstrated with extensive simulation results, which show that the overhead for the implementation and maintenance of this system is minimal compared to the resulted benefit in traffic reduction.
Published In: Parallel Processing Letters
Pages: pp. 57-71
Year Published: 2009
Note: DOI:10.1142/S0129626409000067
Project: Others Subject Area: Others
Publication Type: Journal Paper
Sponsor: Others