abstract

Validity bound of regular registers with churn and byzantine processes

Authors:

Roberto Baldoni,

Silvia Bonomi,

Amir Soltani NezhadAuthors Info & Claims

PODC '11: Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing

Pages 225 - 226

https://doi.org/10.1145/1993806.1993845

Published: 06 June 2011 Publication History

Get Access

Abstract

This paper studies the problem of building a byzantine fault tolerant storage service in a distributed system affected by servers join and leave (i.e., servers churn). We show a bound for ensuring both validity of read operations and the persistence of a value written by a write operation. This bound correlates the churn rate, the number of faulty processes and the time taken by register operations (i.e., join, read and write operations).

References

[1]

Aguilera M. K., Keidar I., Malkhi D., Shraer A., Dynamic atomic storage without consensus, in Proceedings of 28th Annual ACM Symposium on Principles of Distributed Computing (PODC) 2009, 17--25

Digital Library

Google Scholar

[2]

Baldoni R., Bonomi S., Kermarrec A.M., Raynal M., Implementing a Registerin a Dynamic Distributed System, in Proceedings of the 29th IEEE International Conference on Distributed Computing Systems (ICDCS'09), IEEE Computer Society Press,Montreal (Canada), June 2009.

Digital Library

Google Scholar

[3]

Baldoni R., Bonomi S., Soltani Nezhad A. Regular Registers in Dynamic Distributed Systems with Byzantine Processes: Bounds and Performance Analysis,Technical report - MIDLAB 3/11 - 2011 http://www.dis.uniroma1.it/~midlab/articoli/

Google Scholar

[4]

Lamport. L.,On Interprocess Communication, Part 1: Models, Part 2: Algorirhms, Distributed Computing, 1(2):77--101, 1986.

Crossref

Google Scholar

[5]

Lamport L., Shostak R. E., Pease M. C., The Byzantine Generals Problem, ACM Transactions on Programming Languages and Systems (TOPLAS) 4(3), 382--401, 1982.

Digital Library

Google Scholar

[6]

Malkhi D., Reiter M. K. Byzantine Quorum Systems, Distributed Computing 11(4): 203--213, 1998

Digital Library

Google Scholar

[7]

Martin J., Alvisi L., Dahlin M. Minimal Byzantine Storage, in Proceedings of the 16th International Symposium on Distributed Computing (DISC 2002), pp. 311--325, 2002.

Digital Library

Google Scholar

Cited By

View all

Baldoni RBonomi SNezhad A(2013)A protocol for implementing byzantine storage in churn-prone distributed systemsTheoretical Computer Science10.1016/j.tcs.2013.04.005512(28-40)Online publication date: 1-Nov-2013
https://dl.acm.org/doi/10.1016/j.tcs.2013.04.005
Klappenecker ALee HWelch JBaldoni RShvarstman A(2011)Quorum-based dynamic regular registers in systems with churnProceedings of the 3rd International Workshop on Theoretical Aspects of Dynamic Distributed Systems10.1145/2034640.2034643(3-7)Online publication date: 19-Sep-2011
https://dl.acm.org/doi/10.1145/2034640.2034643

Index Terms

Validity bound of regular registers with churn and byzantine processes
1. Information systems
  1. Information retrieval
    1. Search engine architectures and scalability
      1. Distributed retrieval
      2. Peer-to-peer retrieval
  2. Information storage systems
    1. Storage architectures
      1. Distributed storage
2. Software and its engineering
  1. Software organization and properties
    1. Contextual software domains
      1. Operating systems
        Memory management
        Distributed memory

Recommendations

Implementing a Regular Register in an Eventually Synchronous Distributed System Prone to Continuous Churn

Due to their capability to hide the complexity generated by the messages exchanged between processes, shared objects are one of the main abstractions provided to developers of distributed applications. Implementations of such objects, in modern ...
A protocol for implementing byzantine storage in churn-prone distributed systems

Distributed storage service is one of the main abstractions provided to the developers of distributed applications due to its capability to hide the complexity generated by the messages exchanged between processes. Many protocols have been proposed to ...
Churn: A Key Effect on Real-World P2P Software
ICPP '13: Proceedings of the 2013 42nd International Conference on Parallel Processing

Churn refers to a large number of arriving and departing participants within a short time in peer-to-peer (P2P) networks. This paper studies the impact of churn on real-world unstructured P2P networks. To this end, we need collecting snapshots of P2P ...

Comments

Information & Contributors

Information

Published In

PODC '11: Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing

June 2011

406 pages

ISBN:9781450307192

DOI:10.1145/1993806

General Chair:
Cyril Gavoille
LaBRI, University of Bordeaux, France
,
Program Chair:
Pierre Fraigniaud
CNRS and University of Paris Diderot, France

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 06 June 2011

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Abstract

Conference

PODC '11

Sponsor:

PODC '11: ACM Symposium on Principles of Distributed Computing

June 6 - 8, 2011

California, San Jose, USA

Acceptance Rates

Overall Acceptance Rate 740 of 2,477 submissions, 30%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
133
Total Downloads

Downloads (Last 12 months)1
Downloads (Last 6 weeks)0

Reflects downloads up to 15 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Baldoni RBonomi SNezhad A(2013)A protocol for implementing byzantine storage in churn-prone distributed systemsTheoretical Computer Science10.1016/j.tcs.2013.04.005512(28-40)Online publication date: 1-Nov-2013
https://dl.acm.org/doi/10.1016/j.tcs.2013.04.005
Klappenecker ALee HWelch JBaldoni RShvarstman A(2011)Quorum-based dynamic regular registers in systems with churnProceedings of the 3rd International Workshop on Theoretical Aspects of Dynamic Distributed Systems10.1145/2034640.2034643(3-7)Online publication date: 19-Sep-2011
https://dl.acm.org/doi/10.1145/2034640.2034643

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Implementing a Regular Register in an Eventually Synchronous Distributed System Prone to Continuous Churn

A protocol for implementing byzantine storage in churn-prone distributed systems

Churn: A Key Effect on Real-World P2P Software

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Author Tags

Qualifiers

Conference

Acceptance Rates

Other Metrics

Article Metrics

Other Metrics

Cited By

Login options

Full Access

PDF

eReader

Abstract

References

Cited By

Index Terms

Recommendations

Implementing a Regular Register in an Eventually Synchronous Distributed System Prone to Continuous Churn

A protocol for implementing byzantine storage in churn-prone distributed systems

Churn: A Key Effect on Real-World P2P Software

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Author Tags

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

Get Access

Login options

Full Access

View options

PDF

eReader

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations