An Efficient Replication Scheme in Unstructured Peer-to-Peer Networks


The KIPS Transactions:PartA, Vol. 13, No. 1, pp. 1-10, Feb. 2006
10.3745/KIPSTA.2006.13.1.1,   PDF Download:

Abstract

For efficient searching in unstructured peer-to-peer systems, random walk was proposed and several replication methods have been studied to compensate for the random walk''s low query success rate. This paper proposes an efficient replication scheme that improves the accuracy and speed of queries and reduces the cost by minimizing the number of replicas and by utilizing caches. In this scheme, hub nodes store only content''s caches, and one of their neighbors stores the replica. By determining hubs with only limited and local information, we can adaptively generate caches and replicas in dynamic peer-to-peer networks.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
W. R. Choi, S. Y. Han, S. Y. Park, "An Efficient Replication Scheme in Unstructured Peer-to-Peer Networks," The KIPS Transactions:PartA, vol. 13, no. 1, pp. 1-10, 2006. DOI: 10.3745/KIPSTA.2006.13.1.1.

[ACM Style]
Wu Rak Choi, Sae Young Han, and Sung Yong Park. 2006. An Efficient Replication Scheme in Unstructured Peer-to-Peer Networks. The KIPS Transactions:PartA, 13, 1, (2006), 1-10. DOI: 10.3745/KIPSTA.2006.13.1.1.