Highly Available DHTs: Keeping Data Consistency After Updates

Predrag Knežević; Andreas  Wombacher; Thomas Risse

doi:10.1007/11925941_6

Highly Available DHTs: Keeping Data Consistency After Updates

Predrag Knežević, Andreas Wombacher, Thomas Risse

Databases (Former)

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

185 Downloads (Pure)

Abstract

The research in the paper is motivated by building a decentralized/P2P XML storage on top of a DHT (Distributed Hash Table). The storage must provide high data availability and support updates. High data availability in a DHT can be guaranteed by data replication. However, DHTs can not provide a centralized coordination guaranteeing data consistency upon updates. In particular, replicas may have different values due to concurrent updates or partitioning of the P2P network. An approach based on versioning of replica values is presented proposing a decentralized concurrency control system, where probabilistic guarantees can be provided for retrieving a correct replica value. This paper presents the protocol as well as a statistical analysis of the lower bound of the probabilistic guarantees.

Original language	English
Title of host publication	Agents and Peer-to-Peer Computing
Subtitle of host publication	the International Workshop, AP2PC 2005, Utrecht, The Netherlands, July 25, 2005. Revised Papers
Editors	Zoran Despotovic, Sam Joseph, Claudio Sartori
Place of Publication	London
Publisher	Springer
Pages	70-80
Number of pages	11
ISBN (Electronic)	978-3-540-68967-6
ISBN (Print)	978-3-540-49025-8
DOIs	https://doi.org/10.1007/11925941_6
Publication status	Published - 2006
Event	2nd International Workshop on Agents and Peer-to-Peer Computing, AP2PC 2003 - Melbourne, Australia Duration: 14 Jul 2003 → 14 Jul 2003 Conference number: 2

Publication series

Name	Lecture Notes in Computer Science
Publisher	Springer Verlag
Volume	4118
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	2nd International Workshop on Agents and Peer-to-Peer Computing, AP2PC 2003
Abbreviated title	AP2PC
Country/Territory	Australia
City	Melbourne
Period	14/07/03 → 14/07/03

Keywords

Peer-to-peer computing
Decentralized data management
DHT

Access to Document

10.1007/11925941_6

Highly Available DHTsAccepted author version, 141 KB

Cite this

Knežević, P., Wombacher, A., & Risse, T. (2006). Highly Available DHTs: Keeping Data Consistency After Updates. In Z. Despotovic, S. Joseph, & C. Sartori (Eds.), Agents and Peer-to-Peer Computing: the International Workshop, AP2PC 2005, Utrecht, The Netherlands, July 25, 2005. Revised Papers (pp. 70-80). (Lecture Notes in Computer Science; Vol. 4118). Springer. https://doi.org/10.1007/11925941_6

Knežević, Predrag ; Wombacher, Andreas ; Risse, Thomas. / Highly Available DHTs : Keeping Data Consistency After Updates. Agents and Peer-to-Peer Computing: the International Workshop, AP2PC 2005, Utrecht, The Netherlands, July 25, 2005. Revised Papers. editor / Zoran Despotovic ; Sam Joseph ; Claudio Sartori. London : Springer, 2006. pp. 70-80 (Lecture Notes in Computer Science).

@inproceedings{0653e1e9653542a2a0717d050f039727,

title = "Highly Available DHTs: Keeping Data Consistency After Updates",

abstract = "The research in the paper is motivated by building a decentralized/P2P XML storage on top of a DHT (Distributed Hash Table). The storage must provide high data availability and support updates. High data availability in a DHT can be guaranteed by data replication. However, DHTs can not provide a centralized coordination guaranteeing data consistency upon updates. In particular, replicas may have different values due to concurrent updates or partitioning of the P2P network. An approach based on versioning of replica values is presented proposing a decentralized concurrency control system, where probabilistic guarantees can be provided for retrieving a correct replica value. This paper presents the protocol as well as a statistical analysis of the lower bound of the probabilistic guarantees.",

keywords = "Peer-to-peer computing, Decentralized data management, DHT",

author = "Predrag Kne{\v z}evi{\'c} and Andreas Wombacher and Thomas Risse",

year = "2006",

doi = "10.1007/11925941_6",

language = "English",

isbn = "978-3-540-49025-8",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "70--80",

editor = "Zoran Despotovic and Sam Joseph and Claudio Sartori",

booktitle = "Agents and Peer-to-Peer Computing",

address = "Germany",

note = "2nd International Workshop on Agents and Peer-to-Peer Computing, AP2PC 2003, AP2PC ; Conference date: 14-07-2003 Through 14-07-2003",

}

Knežević, P, Wombacher, A & Risse, T 2006, Highly Available DHTs: Keeping Data Consistency After Updates. in Z Despotovic, S Joseph & C Sartori (eds), Agents and Peer-to-Peer Computing: the International Workshop, AP2PC 2005, Utrecht, The Netherlands, July 25, 2005. Revised Papers. Lecture Notes in Computer Science, vol. 4118, Springer, London, pp. 70-80, 2nd International Workshop on Agents and Peer-to-Peer Computing, AP2PC 2003, Melbourne, Victoria, Australia, 14/07/03. https://doi.org/10.1007/11925941_6

Highly Available DHTs: Keeping Data Consistency After Updates. / Knežević, Predrag; Wombacher, Andreas ; Risse, Thomas.
Agents and Peer-to-Peer Computing: the International Workshop, AP2PC 2005, Utrecht, The Netherlands, July 25, 2005. Revised Papers. ed. / Zoran Despotovic; Sam Joseph; Claudio Sartori. London: Springer, 2006. p. 70-80 (Lecture Notes in Computer Science; Vol. 4118).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

T1 - Highly Available DHTs

T2 - 2nd International Workshop on Agents and Peer-to-Peer Computing, AP2PC 2003

AU - Knežević, Predrag

AU - Wombacher, Andreas

AU - Risse, Thomas

N1 - Conference code: 2

PY - 2006

Y1 - 2006

N2 - The research in the paper is motivated by building a decentralized/P2P XML storage on top of a DHT (Distributed Hash Table). The storage must provide high data availability and support updates. High data availability in a DHT can be guaranteed by data replication. However, DHTs can not provide a centralized coordination guaranteeing data consistency upon updates. In particular, replicas may have different values due to concurrent updates or partitioning of the P2P network. An approach based on versioning of replica values is presented proposing a decentralized concurrency control system, where probabilistic guarantees can be provided for retrieving a correct replica value. This paper presents the protocol as well as a statistical analysis of the lower bound of the probabilistic guarantees.

AB - The research in the paper is motivated by building a decentralized/P2P XML storage on top of a DHT (Distributed Hash Table). The storage must provide high data availability and support updates. High data availability in a DHT can be guaranteed by data replication. However, DHTs can not provide a centralized coordination guaranteeing data consistency upon updates. In particular, replicas may have different values due to concurrent updates or partitioning of the P2P network. An approach based on versioning of replica values is presented proposing a decentralized concurrency control system, where probabilistic guarantees can be provided for retrieving a correct replica value. This paper presents the protocol as well as a statistical analysis of the lower bound of the probabilistic guarantees.

KW - Peer-to-peer computing

KW - Decentralized data management

KW - DHT

U2 - 10.1007/11925941_6

DO - 10.1007/11925941_6

M3 - Conference contribution

SN - 978-3-540-49025-8

T3 - Lecture Notes in Computer Science

SP - 70

EP - 80

BT - Agents and Peer-to-Peer Computing

A2 - Despotovic, Zoran

A2 - Joseph, Sam

A2 - Sartori, Claudio

PB - Springer

CY - London

Y2 - 14 July 2003 through 14 July 2003

ER -

Knežević P, Wombacher A, Risse T. Highly Available DHTs: Keeping Data Consistency After Updates. In Despotovic Z, Joseph S, Sartori C, editors, Agents and Peer-to-Peer Computing: the International Workshop, AP2PC 2005, Utrecht, The Netherlands, July 25, 2005. Revised Papers. London: Springer. 2006. p. 70-80. (Lecture Notes in Computer Science). doi: 10.1007/11925941_6

Highly Available DHTs: Keeping Data Consistency After Updates

Abstract

Publication series

Conference

Keywords

Access to Document

Fingerprint

Cite this