Encyclopedia of Database Systems

2018 Edition
| Editors: Ling Liu, M. Tamer Özsu

Multi-data Center Replication Protocols

  • Marcos K. AguileraEmail author
Reference work entry
DOI: https://doi.org/10.1007/978-1-4614-8265-9_80641


Geo-distributed replication protocols; Geo-replication protocols


Multi-data center replication protocols serve to coordinate access to data that is replicated across data centers. The data centers are often separated by large distances, causing significant delays in communication and occasional network outages. The protocols ensure that the replicas remain identical or sufficiently close, so that data accesses satisfy a consistency guarantee suited to a particular application (Consistency Properties).

Historical Background

Multi-data center replication protocols originate from replication protocols in database systems, distributed file systems, and mobile systems ( Data Replication; Replication for High Availability). The desire to replicate data across data centers has increased in the past decade, as cloud-based Web applications have grown considerably. Applications such as Web mail, e-commerce, Web search, and social networks now include hundreds of millions of...

This is a preview of subscription content, log in to check access.

Recommended Reading

  1. 1.
    Attiya H, Bar-Noy A, Dolev D. Sharing memory robustly in message-passing systems. J ACM. 1995;42(1):124–42.zbMATHCrossRefGoogle Scholar
  2. 2.
    Baker J, et al. Megastore: providing scalable, highly available storage for interactive services. In: Proceedings of the 5th Biennial Conference on Innovative Data Systems Research; 2011. p. 223–34.Google Scholar
  3. 3.
    Castro M, Liskov B. Practical Byzantine fault tolerance and proactive recovery. ACM Trans Comput Syst. 2002;20(4):398–461.CrossRefGoogle Scholar
  4. 4.
    Chandra TD, Toueg S. Unreliable failure detectors for reliable distributed systems. J ACM. 1996;43(2): 225–67.MathSciNetzbMATHCrossRefGoogle Scholar
  5. 5.
    Cooper BF, et al. PNUTS: Yahoo!’s hosted data serving platform. Proc VLDB Endowment. 2008;1(2):1277–88.MathSciNetCrossRefGoogle Scholar
  6. 6.
    Corbett JC, et al. Spanner: Google’s globally-distributed database. In: Proceedings of the 10th USENIX Symposium on Operating System Design and Implementation; 2012. p. 251–64.Google Scholar
  7. 7.
    DeCandia G, et al. Dynamo: Amazon’s highly available key-value store. In: Proceedings of the 21st ACM Symposium on Operating System Principles; 2007. p. 205–20.Google Scholar
  8. 8.
    Hadzilacos V, Toueg S. A modular approach to fault-tolerant broadcasts and related problems. Technical report 94-1425. Department of Computer Science, Cornell University, Ithaca, NY; 1994.Google Scholar
  9. 9.
    Kraska T, Pang G, Franklin M, Madden S, Fekete A. MDCC: multi-data center consistency. In: Proceedings of the 8th ACM SIGOPS/EuroSys European Conference on Computer Systems; 2013. p. 113–26.Google Scholar
  10. 10.
    Lamport L. The part-time parliament. ACM Trans Comput Syst. 1998;16(2):133–69.CrossRefGoogle Scholar
  11. 11.
    Letia M, Preguiça N, Shapiro M. Consistency without concurrency control in large, dynamic systems. In: Proceedings of the International Workshop on Large Scale Distributed Systems and Middleware; 2009.Google Scholar
  12. 12.
    Lloyd W, Freedman M, Kaminsky M, Andersen D. Don’t settle for eventual: stronger consistency for wide-area storage with cops. In: Proceedings of the ACM Symposium on Operating Systems Principles; 2011. p. 401–16.Google Scholar
  13. 13.
    Lloyd W, Freedman M, Kaminsky M, Andersen D. Stronger semantics for low-latency geo-replicated storage. In: Proceedings of the 10th USENIX Symposium on Networked Systems Design & Implementation; 2013. p. 313–28.Google Scholar
  14. 14.
    Nawab F, Agrawal D, Abbadi AE. Message futures: fast commitment of transactions in multi-datacenter environments. In: Proceedings of the 6th Biennial Conference on Innovative Data Systems Research; 2013.Google Scholar
  15. 15.
    Oki BM, Liskov BH. Viewstamped replication: a new primary copy method to support highly-available distributed systems. In: Proceedings of the ACM Symposium on Principles of Distributed Computing; 1988. p. 8–17.Google Scholar
  16. 16.
    Patterson S, Elmore AJ, Nawab F, Agrawal D, Abbadi AE. Serializability, not serial: concurrency control and availability in multi-datacenter datastores. Proc VLDB Endowment. 2012;5(11):1459–70.CrossRefGoogle Scholar
  17. 17.
    Schneider F. Implementing fault-tolerant services using the state machine approach: a tutorial. ACM Comput Surv. 1990;22(4):299–319.CrossRefGoogle Scholar
  18. 18.
    Sovran Y, Power R, Aguilera MK, Li J. Transactional storage for geo-replicated systems. In: Proceedings of the ACM Symposium on Operating Systems Principles; 2011. p. 385–400.Google Scholar
  19. 19.
    Terry DB, et al. Managing update conflicts in Bayou, a weakly connected replicated storage system. In: Proceedings of the ACM Symposium on Operating Systems Principles; 1995. p. 172–83.Google Scholar
  20. 20.
    Thomson A, Diamond T, Weng S-C, Ren K, Shao P, Abadi DJ. Calvin: fast distributed transactions for partitioned database systems. In: Proceedings of the International Conference on Management of Data; 2012. p. 1–2.Google Scholar
  21. 21.
    Weihl W. Commutativity-based concurrency control for abstract data types. IEEE Trans Comput. 1988;37(12).MathSciNetzbMATHCrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2018

Authors and Affiliations

  1. 1.VMware ResearchPalo AltoUSA