Many p2p based wide-area storage networks have been proposed to provide scalable storage services by combining the idle resources of many unreliable nodes. These storage networks can also provide highly available and reliable storage services, by replicating each data on several nodes. The popular approach is availability based replication which uses individual node availability. However, some replicas leave within a short time under high churn in p2p networks. This results in heavy and bursty data traffic, and sometimes some data are lost. This paper presents the lifetime-aware replication which uses the lifetime of each node to prevent the bursty failures and the data loss. It keeps a primary replica which has enough time to replace a lost redundancy. It also spreads replicas on the timeline to reduce the overlapped replicas as best as it can. Results from event-driven simulations show that the lifetime-aware replication keeps high data durability with less data traffic.
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
Kyungbaek KIM, "Lifetime-Aware Replication for Data Durability in P2P Storage Network" in IEICE TRANSACTIONS on Communications,
vol. E91-B, no. 12, pp. 4020-4023, December 2008, doi: 10.1093/ietcom/e91-b.12.4020.
Abstract: Many p2p based wide-area storage networks have been proposed to provide scalable storage services by combining the idle resources of many unreliable nodes. These storage networks can also provide highly available and reliable storage services, by replicating each data on several nodes. The popular approach is availability based replication which uses individual node availability. However, some replicas leave within a short time under high churn in p2p networks. This results in heavy and bursty data traffic, and sometimes some data are lost. This paper presents the lifetime-aware replication which uses the lifetime of each node to prevent the bursty failures and the data loss. It keeps a primary replica which has enough time to replace a lost redundancy. It also spreads replicas on the timeline to reduce the overlapped replicas as best as it can. Results from event-driven simulations show that the lifetime-aware replication keeps high data durability with less data traffic.
URL: https://global.ieice.org/en_transactions/communications/10.1093/ietcom/e91-b.12.4020/_p
Copy
@ARTICLE{e91-b_12_4020,
author={Kyungbaek KIM, },
journal={IEICE TRANSACTIONS on Communications},
title={Lifetime-Aware Replication for Data Durability in P2P Storage Network},
year={2008},
volume={E91-B},
number={12},
pages={4020-4023},
abstract={Many p2p based wide-area storage networks have been proposed to provide scalable storage services by combining the idle resources of many unreliable nodes. These storage networks can also provide highly available and reliable storage services, by replicating each data on several nodes. The popular approach is availability based replication which uses individual node availability. However, some replicas leave within a short time under high churn in p2p networks. This results in heavy and bursty data traffic, and sometimes some data are lost. This paper presents the lifetime-aware replication which uses the lifetime of each node to prevent the bursty failures and the data loss. It keeps a primary replica which has enough time to replace a lost redundancy. It also spreads replicas on the timeline to reduce the overlapped replicas as best as it can. Results from event-driven simulations show that the lifetime-aware replication keeps high data durability with less data traffic.},
keywords={},
doi={10.1093/ietcom/e91-b.12.4020},
ISSN={1745-1345},
month={December},}
Copy
TY - JOUR
TI - Lifetime-Aware Replication for Data Durability in P2P Storage Network
T2 - IEICE TRANSACTIONS on Communications
SP - 4020
EP - 4023
AU - Kyungbaek KIM
PY - 2008
DO - 10.1093/ietcom/e91-b.12.4020
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E91-B
IS - 12
JA - IEICE TRANSACTIONS on Communications
Y1 - December 2008
AB - Many p2p based wide-area storage networks have been proposed to provide scalable storage services by combining the idle resources of many unreliable nodes. These storage networks can also provide highly available and reliable storage services, by replicating each data on several nodes. The popular approach is availability based replication which uses individual node availability. However, some replicas leave within a short time under high churn in p2p networks. This results in heavy and bursty data traffic, and sometimes some data are lost. This paper presents the lifetime-aware replication which uses the lifetime of each node to prevent the bursty failures and the data loss. It keeps a primary replica which has enough time to replace a lost redundancy. It also spreads replicas on the timeline to reduce the overlapped replicas as best as it can. Results from event-driven simulations show that the lifetime-aware replication keeps high data durability with less data traffic.
ER -