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%.
Taishi NAKASHIMA
Graduate School of Engineering, Hiroshima University
Satoshi FUJITA
Graduate School of Engineering, Hiroshima University
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Taishi NAKASHIMA, Satoshi FUJITA, "Tree-Based Consistency Maintenance Scheme for Peer-to-Peer File Sharing of Editable Contents" in IEICE TRANSACTIONS on Information,
vol. E97-D, no. 12, pp. 3033-3040, December 2014, doi: 10.1587/transinf.2014PAP0007.
Abstract: 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%.
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.2014PAP0007/_p
Copy
@ARTICLE{e97-d_12_3033,
author={Taishi NAKASHIMA, Satoshi FUJITA, },
journal={IEICE TRANSACTIONS on Information},
title={Tree-Based Consistency Maintenance Scheme for Peer-to-Peer File Sharing of Editable Contents},
year={2014},
volume={E97-D},
number={12},
pages={3033-3040},
abstract={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%.},
keywords={},
doi={10.1587/transinf.2014PAP0007},
ISSN={1745-1361},
month={December},}
Copy
TY - JOUR
TI - Tree-Based Consistency Maintenance Scheme for Peer-to-Peer File Sharing of Editable Contents
T2 - IEICE TRANSACTIONS on Information
SP - 3033
EP - 3040
AU - Taishi NAKASHIMA
AU - Satoshi FUJITA
PY - 2014
DO - 10.1587/transinf.2014PAP0007
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E97-D
IS - 12
JA - IEICE TRANSACTIONS on Information
Y1 - December 2014
AB - 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%.
ER -