DocumentCode
678668
Title
Tree-Based Consistency Maintenance Scheme for Peer-to-Peer File Sharing Systems
Author
Nakashima, Takayoshi ; Fujita, S.
Author_Institution
Dept. of Inf. Eng., Hiroshima Univ., Higashi-Hiroshima, Japan
fYear
2013
fDate
4-6 Dec. 2013
Firstpage
187
Lastpage
193
Abstract
In this paper, we propose a new consistency maintenance scheme for P2P file sharing systems which allow end-users to update shared files. The basic idea of the proposed scheme is to construct a static tree for each file to efficiently propagate the update information to all replica peers. The link to the root in a tree is acquired by referring to a Chord ring which registers the mapping from the set of shared files to the set of roots of the trees. The performance of the scheme is evaluated by simulation. The result of simulations indicates that: 1) the proposed scheme reduces the number of messages in a conventional scheme by 54%, 2) the propagation delay of update messages is shorter than the conventional scheme, and 3) the increase of the delay due to peer churns is effectively bounded provided that the percentage of leaving peers is less than 40%.
Keywords
peer-to-peer computing; trees (mathematics); Chord ring; P2P file sharing system; peer churn; peer-to-peer system; static tree; tree-based consistency maintenance; Delays; IP networks; Maintenance engineering; Peer-to-peer computing; Receivers; Registers; Vegetation; consistency maintenance; distributed hash table; file sharing; peer-to-peer;
fLanguage
English
Publisher
ieee
Conference_Titel
Computing and Networking (CANDAR), 2013 First International Symposium on
Conference_Location
Matsuyama
Print_ISBN
978-1-4799-2795-1
Type
conf
DOI
10.1109/CANDAR.2013.34
Filename
6726896
Link To Document