IEICE TRANSACTIONS on Information
Relative MTTF-Based Incentive Scheme for Availability-Based Replication in P2P Systems
Summary :
When P2P systems are used for data sensitive systems, the data availability has become an important issue. The availability-based replication using individual node availability is the most popular method keeping high data availability efficiently. However, since the individual node availability is derived by the individual lifetime information of each node, the availability-based replication may select useless replicas. In this paper, we explore the relative MTTF (Mean Time To Failure)-based incentive scheme for the more efficient availability-based replication. The relative MTTF is used to classify the guaranteed replicas which can get the incentive node availability, and these replicas help reduce the data traffic and the number of replicas without losing the target data availability. Results from trace-driven simulations show that the replication using our relative MTTF-based incentive scheme achieves the same target data availability with 41% less data traffic and 24% less replicas.
- Publication
- IEICE TRANSACTIONS on Information Vol.E93-D No.12 pp.3403-3406
- Publication Date
- 2010/12/01
- Publicized
- Online ISSN
- 1745-1361
- DOI
- 10.1587/transinf.E93.D.3403
- Type of Manuscript
- LETTER
- Category
- Dependable Computing
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
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.
Cite this
Copy
Kyungbaek KIM, "Relative MTTF-Based Incentive Scheme for Availability-Based Replication in P2P Systems" in IEICE TRANSACTIONS on Information,
vol. E93-D, no. 12, pp. 3403-3406, December 2010, doi: 10.1587/transinf.E93.D.3403.
Abstract: When P2P systems are used for data sensitive systems, the data availability has become an important issue. The availability-based replication using individual node availability is the most popular method keeping high data availability efficiently. However, since the individual node availability is derived by the individual lifetime information of each node, the availability-based replication may select useless replicas. In this paper, we explore the relative MTTF (Mean Time To Failure)-based incentive scheme for the more efficient availability-based replication. The relative MTTF is used to classify the guaranteed replicas which can get the incentive node availability, and these replicas help reduce the data traffic and the number of replicas without losing the target data availability. Results from trace-driven simulations show that the replication using our relative MTTF-based incentive scheme achieves the same target data availability with 41% less data traffic and 24% less replicas.
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.E93.D.3403/_p
Copy
@ARTICLE{e93-d_12_3403,
author={Kyungbaek KIM, },
journal={IEICE TRANSACTIONS on Information},
title={Relative MTTF-Based Incentive Scheme for Availability-Based Replication in P2P Systems},
year={2010},
volume={E93-D},
number={12},
pages={3403-3406},
abstract={When P2P systems are used for data sensitive systems, the data availability has become an important issue. The availability-based replication using individual node availability is the most popular method keeping high data availability efficiently. However, since the individual node availability is derived by the individual lifetime information of each node, the availability-based replication may select useless replicas. In this paper, we explore the relative MTTF (Mean Time To Failure)-based incentive scheme for the more efficient availability-based replication. The relative MTTF is used to classify the guaranteed replicas which can get the incentive node availability, and these replicas help reduce the data traffic and the number of replicas without losing the target data availability. Results from trace-driven simulations show that the replication using our relative MTTF-based incentive scheme achieves the same target data availability with 41% less data traffic and 24% less replicas.},
keywords={},
doi={10.1587/transinf.E93.D.3403},
ISSN={1745-1361},
month={December},}
Copy
TY - JOUR
TI - Relative MTTF-Based Incentive Scheme for Availability-Based Replication in P2P Systems
T2 - IEICE TRANSACTIONS on Information
SP - 3403
EP - 3406
AU - Kyungbaek KIM
PY - 2010
DO - 10.1587/transinf.E93.D.3403
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E93-D
IS - 12
JA - IEICE TRANSACTIONS on Information
Y1 - December 2010
AB - When P2P systems are used for data sensitive systems, the data availability has become an important issue. The availability-based replication using individual node availability is the most popular method keeping high data availability efficiently. However, since the individual node availability is derived by the individual lifetime information of each node, the availability-based replication may select useless replicas. In this paper, we explore the relative MTTF (Mean Time To Failure)-based incentive scheme for the more efficient availability-based replication. The relative MTTF is used to classify the guaranteed replicas which can get the incentive node availability, and these replicas help reduce the data traffic and the number of replicas without losing the target data availability. Results from trace-driven simulations show that the replication using our relative MTTF-based incentive scheme achieves the same target data availability with 41% less data traffic and 24% less replicas.
ER -
English
