Efficient cooperative backup with decentralized trust management

Nguyen Tran, Frank Chiang, Jinyang Li

Research output: Contribution to journalArticle

Abstract

Existing backup systems are unsatisfactory: commercial backup services are reliable but expensive while peer-to-peer systems are cheap but offer limited assurance of data reliability. This article introduces Friendstore, a system that provides inexpensive and reliable backup by giving users the choice to store backup data only on nodes they trust (typically those owned by friends and colleagues). Because it is built on trusted nodes, Friendstore is not burdened by the complexity required to cope with potentially malicious participants. Friendstore only needs to detect and repair accidental data loss and to ensure balanced storage exchange. The disadvantage of using only trusted nodes is that Friendstore cannot achieve perfect storage utilization. Friendstore is designed for a heterogeneous environment where nodes have very different access link speeds and available disk spaces. To ensure long-term data reliability, a node with limited upload bandwidth refrains from storing more data than its calculated maintainable capacity. A high bandwidth node might be limited by its available disk space. We introduce a simple coding scheme, called XOR(1,2), which doubles a node's ability to store backup information in the same amount of disk space at the cost of doubling the amount of data transferred during restore. Analysis and simulations using long-term node activity traces show that a node can reliably back up tens of gigabytes of data even with low upload bandwidth.

Original languageEnglish (US)
Article number2339119
JournalACM Transactions on Storage
Volume8
Issue number3
DOIs
StatePublished - Sep 2012

Fingerprint

Bandwidth
Repair

Keywords

  • Cooperative backup
  • Erasure code
  • Social network

ASJC Scopus subject areas

  • Hardware and Architecture

Cite this

Efficient cooperative backup with decentralized trust management. / Tran, Nguyen; Chiang, Frank; Li, Jinyang.

In: ACM Transactions on Storage, Vol. 8, No. 3, 2339119, 09.2012.

Research output: Contribution to journalArticle

@article{d4c26ba18d704117869a52ae1ef0309e,
title = "Efficient cooperative backup with decentralized trust management",
abstract = "Existing backup systems are unsatisfactory: commercial backup services are reliable but expensive while peer-to-peer systems are cheap but offer limited assurance of data reliability. This article introduces Friendstore, a system that provides inexpensive and reliable backup by giving users the choice to store backup data only on nodes they trust (typically those owned by friends and colleagues). Because it is built on trusted nodes, Friendstore is not burdened by the complexity required to cope with potentially malicious participants. Friendstore only needs to detect and repair accidental data loss and to ensure balanced storage exchange. The disadvantage of using only trusted nodes is that Friendstore cannot achieve perfect storage utilization. Friendstore is designed for a heterogeneous environment where nodes have very different access link speeds and available disk spaces. To ensure long-term data reliability, a node with limited upload bandwidth refrains from storing more data than its calculated maintainable capacity. A high bandwidth node might be limited by its available disk space. We introduce a simple coding scheme, called XOR(1,2), which doubles a node's ability to store backup information in the same amount of disk space at the cost of doubling the amount of data transferred during restore. Analysis and simulations using long-term node activity traces show that a node can reliably back up tens of gigabytes of data even with low upload bandwidth.",
keywords = "Cooperative backup, Erasure code, Social network",
author = "Nguyen Tran and Frank Chiang and Jinyang Li",
year = "2012",
month = "9",
doi = "10.1145/2339118.2339119",
language = "English (US)",
volume = "8",
journal = "ACM Transactions on Storage",
issn = "1553-3077",
publisher = "Association for Computing Machinery (ACM)",
number = "3",

}

TY - JOUR

T1 - Efficient cooperative backup with decentralized trust management

AU - Tran, Nguyen

AU - Chiang, Frank

AU - Li, Jinyang

PY - 2012/9

Y1 - 2012/9

N2 - Existing backup systems are unsatisfactory: commercial backup services are reliable but expensive while peer-to-peer systems are cheap but offer limited assurance of data reliability. This article introduces Friendstore, a system that provides inexpensive and reliable backup by giving users the choice to store backup data only on nodes they trust (typically those owned by friends and colleagues). Because it is built on trusted nodes, Friendstore is not burdened by the complexity required to cope with potentially malicious participants. Friendstore only needs to detect and repair accidental data loss and to ensure balanced storage exchange. The disadvantage of using only trusted nodes is that Friendstore cannot achieve perfect storage utilization. Friendstore is designed for a heterogeneous environment where nodes have very different access link speeds and available disk spaces. To ensure long-term data reliability, a node with limited upload bandwidth refrains from storing more data than its calculated maintainable capacity. A high bandwidth node might be limited by its available disk space. We introduce a simple coding scheme, called XOR(1,2), which doubles a node's ability to store backup information in the same amount of disk space at the cost of doubling the amount of data transferred during restore. Analysis and simulations using long-term node activity traces show that a node can reliably back up tens of gigabytes of data even with low upload bandwidth.

AB - Existing backup systems are unsatisfactory: commercial backup services are reliable but expensive while peer-to-peer systems are cheap but offer limited assurance of data reliability. This article introduces Friendstore, a system that provides inexpensive and reliable backup by giving users the choice to store backup data only on nodes they trust (typically those owned by friends and colleagues). Because it is built on trusted nodes, Friendstore is not burdened by the complexity required to cope with potentially malicious participants. Friendstore only needs to detect and repair accidental data loss and to ensure balanced storage exchange. The disadvantage of using only trusted nodes is that Friendstore cannot achieve perfect storage utilization. Friendstore is designed for a heterogeneous environment where nodes have very different access link speeds and available disk spaces. To ensure long-term data reliability, a node with limited upload bandwidth refrains from storing more data than its calculated maintainable capacity. A high bandwidth node might be limited by its available disk space. We introduce a simple coding scheme, called XOR(1,2), which doubles a node's ability to store backup information in the same amount of disk space at the cost of doubling the amount of data transferred during restore. Analysis and simulations using long-term node activity traces show that a node can reliably back up tens of gigabytes of data even with low upload bandwidth.

KW - Cooperative backup

KW - Erasure code

KW - Social network

UR - http://www.scopus.com/inward/record.url?scp=84870179309&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84870179309&partnerID=8YFLogxK

U2 - 10.1145/2339118.2339119

DO - 10.1145/2339118.2339119

M3 - Article

AN - SCOPUS:84870179309

VL - 8

JO - ACM Transactions on Storage

JF - ACM Transactions on Storage

SN - 1553-3077

IS - 3

M1 - 2339119

ER -