Tree-Based Consistency Maintenance Scheme for Peer-to-Peer File Sharing of Editable Contents

Taishi NAKASHIMA  Satoshi FUJITA  

IEICE TRANSACTIONS on Information and Systems   Vol.E97-D   No.12   pp.3033-3040
Publication Date: 2014/12/01
Online ISSN: 1745-1361
DOI: 10.1587/transinf.2014PAP0007
Type of Manuscript: Special Section PAPER (Special Section on Parallel and Distributed Computing and Networking)
Category: Network
Peer-to-Peer,  file sharing,  consistency maintenance,  distributed hash table,  

Full Text: PDF>>
Buy this Article

This paper proposes a consistency maintenance scheme for P2P file sharing systems. The basic idea of the proposed scheme is to construct a static tree for each shared file to efficiently propagate the update information to all replica peers. The link to the root of the trees is acquired by referring to a Chord ring which stores the mapping from the set of shared files to the set of tree roots. The performance of the scheme is evaluated by simulation. The simulation result indicates that: 1) it reduces the number of messages in the Li's scheme by 54%, 2) it reduces the propagation delay of the scheme by more than 10%, 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%.