article

Free access

Epidemic algorithms for replicated database maintenance

Authors:

Howard Sturgis,

Doug TerryAuthors Info & Claims

ACM SIGOPS Operating Systems Review, Volume 22, Issue 1

Pages 8 - 32

https://doi.org/10.1145/43921.43922

Published: 03 January 1988 Publication History

Abstract

When a database is replicated at many sites, maintaining mutual consistency among the sites in the face of updates is a significant problem. This paper describes several randomized algorithms for distributing updates and driving the replicas toward consistency. The algorithms are very simple and require few guarantees from the underlying communication system, yet they ensure that the effect of every update is eventually reflected in all replicas. The cost and performance of the algorithms are tuned by choosing appropriate distributions in the randomization step. The algorithms are closely analogous to epidemics, and the epidemiology literature aids in understanding their behavior. One of the algorithms has been implemented in the Clearinghouse servers of the Xerox Corporate Internet. solving long-standing problems of high traffic and database inconsistency.

References

[1]

[Ab] Karl Abrahamson, Andrew Addler, Lisa Higham, David Kirkpatrick Probabilistic Solitude Verification on a Ring. Proceedings of the Fifth Annual ACM Symposium on Principles of Distributed Computing . Calgary, Alberta, Canada. 1986, Pages 161-173.

Digital Library

[2]

[Aw] Baruch Awerbuch and Shimon Even. Efficient and Reliable Broadcast is Achievable in an Eventually Connected Network. Proceedings of the Third Annual ACM Symposium on Principles of Distributed Computing . Vancouver, B.C., Canada. 1984, Pages 278-281.

Digital Library

[3]

[Ba] Norman T. J. Bailey. The Mathematical Theory of Infectious Diseases and its Applications (second edition). Hafner Press, Second Edition, 1975.

[4]

[Be83] M. Ben-Or. Another Advantage of Free Choice. Proceedings of the Second Annual ACM Symposium on Principles of Distributed Computing. Montreal, Quebec, Canada. 1983.

Digital Library

[5]

[Be85] M. Ben-Or Fast Asynchronous Byzantine Agreement. Proceedings of the Fourth Annual ACM Symposium on Principles of Distributed Computing. Minaki, Ontario, Canada. 1985, Pages 149-151.

Digital Library

[6]

[Bi] A. D. Birrell, R. Levin, R. M. Needham, and M. D. Schroeder. Grapevine, An Exercise in Distributed Computing. Communications of the ACM 25(4):260-274, 1982.

Digital Library

[7]

[Ch] K. M. Chandy and L. Lamport. Distributed Snapshots: Determining Global States of Distributed Systems. ACM Transactions on Computing Systems 3(1):63-75 1985.

Digital Library

[8]

[Fr] J.C. Frauenthal. Mathematical Modeling in Epidemiology, Pages 12-24. Springer-Verlag, 1980.

[9]

[Gi] D.K. Gifford. "Weighted Voting for Replicated Data. Proceedings of the Seventh Symposium on Operating Systems Principles ACM SIGOPS. Pacific Grove, California. 1979, Pages 150-159.

Digital Library

[10]

[Jo] P.R. Johnson and R. H. Thomas. The Maintenance of Duplicate Databases. Bolt Beranek and Newman Inc., Arpanet Request for Comments (RFC) 677, 1975.

Digital Library

[11]

[La] Butler W. Lampson. Designing a Global Name Service. Proceedings of the Fifth Annual ACM Symposium on Principles of Distributed Computing . Calgary, Alberta, Canada. 1986, Pages 1-10.

Digital Library

[12]

[Mo] P. Mockapetris. The domain name system. Proceedings IFIP 6.5 International Symposium on Computer Messaging, Nottingham, England, May 1984. Also available as: USC Information Sciences Institute, Report ISI/RS-84-133, June 1984.

Digital Library

[13]

[Op] Derek C. Oppen and Yogen K. Dalal. The Clearinghouse: A Decentralized Agent for Locating Named Objects in a Distributed Environment. Xerox Technical Report: OPD-T8103, 1981.

[14]

[Pi] Boris Pittel. On Spreading a Rumor. SIAM Journal of Applied Mathematics 47(1):213-223, 1987.

Digital Library

[15]

[Ra] Michael O. Rabin. Randomized Byzantine Generals. 24th Annual Symposium on Foundations of Computer Science. IEEE Computer Society, 1983, Pages 403-409.

[16]

[Sa] S.K. Sarin and N. A. Lynch. Discarding Obsolete Information in a Replicated Database System. IEEE Transactions on Sohware Engineering SE-13(1):39-47 1987.

Digital Library

Cited By

Li YSun LHan PZheng SChen Y(2024)Improved Blockchain Sharding Consensus for Cross-Shard ValidationBlockchain Technology and Application10.1007/978-981-97-3203-6_6(105-122)Online publication date: 23-Jun-2024
https://doi.org/10.1007/978-981-97-3203-6_6
Hahn-Klimroth MKaaser D(2023)On Reconstructing the Patient Zero from Sensor Measurements2023 IEEE 43rd International Conference on Distributed Computing Systems (ICDCS)10.1109/ICDCS57875.2023.00065(1-11)Online publication date: Jul-2023
https://doi.org/10.1109/ICDCS57875.2023.00065
Li JShao YWei KDing MMa CShi LHan ZPoor H(2022)Blockchain Assisted Decentralized Federated Learning (BLADE-FL): Performance Analysis and Resource AllocationIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2021.313884833:10(2401-2415)Online publication date: 1-Oct-2022
https://doi.org/10.1109/TPDS.2021.3138848
Show More Cited By

Index Terms

Epidemic algorithms for replicated database maintenance

Recommendations

Causal consistency algorithms for partially replicated and fully replicated systems
Abstract
Data replication is commonly used for fault-tolerance in reliable distributed systems. In large-scale systems, it additionally provides low latency. Recently, causal consistency in such systems has received much attention. However, existing works ...
Highlights
- Causal consistency gives low latency and strong semantics in replicated systems.
- We explore partial and full replication to implement causal consistency.
- We propose causal consistency algorithms for partially and fully replicated ...
Epidemic Algorithms for Replicated Databases

We present a family of epidemic algorithms for maintaining replicated database systems. The algorithms are based on the causal delivery of log records where each record corresponds to one transaction instead of one operation. The first algorithm in this ...
Replicated data management in distributed database systems

Replication is the key factor in improving the availability of data in distributed systems. Replicated data is stored at multiple sites so that it can be accessed by the user even when some of the copies are not available due to site failures. A major ...

Comments

Information & Contributors

Information

Published In

cover image ACM SIGOPS Operating Systems Review

ACM SIGOPS Operating Systems Review Volume 22, Issue 1

Jan., 1988

71 pages

ISSN:0163-5980

DOI:10.1145/43921

Editor:
William M. Waite
University of Colorado, Boulder

Issue’s Table of Contents

Copyright © 1988 Authors.

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 03 January 1988

Published in SIGOPS Volume 22, Issue 1

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

127
Total Citations
View Citations
1,892
Total Downloads

Downloads (Last 12 months)166
Downloads (Last 6 weeks)17

Reflects downloads up to

Other Metrics

View Author Metrics

Citations

Cited By

Li YSun LHan PZheng SChen Y(2024)Improved Blockchain Sharding Consensus for Cross-Shard ValidationBlockchain Technology and Application10.1007/978-981-97-3203-6_6(105-122)Online publication date: 23-Jun-2024
https://doi.org/10.1007/978-981-97-3203-6_6
Hahn-Klimroth MKaaser D(2023)On Reconstructing the Patient Zero from Sensor Measurements2023 IEEE 43rd International Conference on Distributed Computing Systems (ICDCS)10.1109/ICDCS57875.2023.00065(1-11)Online publication date: Jul-2023
https://doi.org/10.1109/ICDCS57875.2023.00065
Li JShao YWei KDing MMa CShi LHan ZPoor H(2022)Blockchain Assisted Decentralized Federated Learning (BLADE-FL): Performance Analysis and Resource AllocationIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2021.313884833:10(2401-2415)Online publication date: 1-Oct-2022
https://doi.org/10.1109/TPDS.2021.3138848
Palliwar APinisetty S(2022)Using Gossip Enabled Distributed Circuit Breaking for Improving Resiliency of Distributed Systems2022 IEEE 19th International Conference on Software Architecture (ICSA)10.1109/ICSA53651.2022.00010(13-23)Online publication date: Mar-2022
https://doi.org/10.1109/ICSA53651.2022.00010
Huo RZeng SWang ZShang JChen WHuang TWang SYu FLiu Y(2022)A Comprehensive Survey on Blockchain in Industrial Internet of Things: Motivations, Research Progresses, and Future ChallengesIEEE Communications Surveys & Tutorials10.1109/COMST.2022.314149024:1(88-122)Online publication date: Sep-2023
https://doi.org/10.1109/COMST.2022.3141490
Braun MWiesmaier AAlnahawi N(2022)Efficient practical Byzantine consensus using random linear network codingAnnals of Telecommunications10.1007/s12243-022-00930-x78:1-2(33-51)Online publication date: 23-Dec-2022
https://doi.org/10.1007/s12243-022-00930-x
Badis LAmad MAïssani DAbbar S(2021)P2PCFJournal of High Speed Networks10.3233/JHS-21064927:1(13-31)Online publication date: 29-Mar-2021
https://dl.acm.org/doi/10.3233/JHS-210649
Kim JLee JKoo YPark SMoon SBarbalace ABhatotia PAlvisi LCadar C(2021)EthanosProceedings of the Sixteenth European Conference on Computer Systems10.1145/3447786.3456231(99-113)Online publication date: 21-Apr-2021
https://dl.acm.org/doi/10.1145/3447786.3456231
Jiangen ZShuxia Xmeng Q(2021)Research on the Application of Blockchain Technology in the Management of Financial Transfer PaymentE3S Web of Conferences10.1051/e3sconf/202125101065251(01065)Online publication date: 15-Apr-2021
https://doi.org/10.1051/e3sconf/202125101065
Li PWang GChen XLong FXu WFonseca RDelimitrou COoi B(2020)GosigProceedings of the 11th ACM Symposium on Cloud Computing10.1145/3419111.3421272(223-237)Online publication date: 12-Oct-2020
https://dl.acm.org/doi/10.1145/3419111.3421272
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

Login options

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

Full Access

Get this Publication

Media

Figures

Other

Tables

View Issue’s Table of Contents