{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T22:26:34Z","timestamp":1775255194327,"version":"3.50.1"},"reference-count":61,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2010,9,24]],"date-time":"2010-09-24T00:00:00Z","timestamp":1285286400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Distrib. Comput."],"published-print":{"date-parts":[[2010,12]]},"DOI":"10.1007\/s00446-010-0117-1","type":"journal-article","created":{"date-parts":[[2010,9,23]],"date-time":"2010-09-23T07:21:19Z","timestamp":1285226479000},"page":"225-272","source":"Crossref","is-referenced-by-count":44,"title":["Rambo: a robust, reconfigurable atomic memory service for dynamic networks"],"prefix":"10.1007","volume":"23","author":[{"given":"Seth","family":"Gilbert","sequence":"first","affiliation":[]},{"given":"Nancy A.","family":"Lynch","sequence":"additional","affiliation":[]},{"given":"Alexander A.","family":"Shvartsman","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,9,24]]},"reference":[{"issue":"2","key":"117_CR1","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/s00446-005-0139-2","volume":"18","author":"I. Abraham","year":"2005","unstructured":"Abraham I., Malkhi D.: Probabilistic quorums for dynamic systems. Distrib. Comput. 18(2), 113\u2013124 (2005)","journal-title":"Distrib. Comput."},{"key":"117_CR2","unstructured":"Agrawal, D., El Abbadi, A.: Resilient logical structures for efficient management of replicated data. In: Proceedings of the International Conference on Very Large Data Bases, pp. 151\u2013162 (1992)"},{"key":"117_CR3","doi-asserted-by":"crossref","unstructured":"Aguilera, M.K., Keidar, I., Malkhi, D., Shraer, A.: Dynamic atomic storage without consensus. In: Proceedings of the Symposium on Principles of Distributed Computing, pp. 17\u201325 (2009)","DOI":"10.1145\/1582716.1582726"},{"key":"117_CR4","unstructured":"Albrecht, J.R., Saito, Y.: Rambo for Dummies. Technical Report HPL-2005-39, Hewlett-Packard (2005)"},{"issue":"9","key":"117_CR5","doi-asserted-by":"crossref","first-page":"996","DOI":"10.1109\/71.954640","volume":"12","author":"L. Alvisi","year":"2001","unstructured":"Alvisi L., Malkhi D., Pierce E.T., Reiter M.K.: Fault detection for Byzantine quorum systems. Trans. Parallel Distrib. Syst. 12(9), 996\u20131007 (2001)","journal-title":"Trans. Parallel Distrib. Syst."},{"key":"117_CR6","unstructured":"Amir, Y., Dolev, D., Melliar-Smith, P.M., Moser, L.: Robust and Efficient Replication Using Group Communication. Technical Report 1994-20, Hebrew University (1994)"},{"key":"117_CR7","doi-asserted-by":"crossref","unstructured":"Amir, Y., Wool, A.: Evaluating quorum systems over the internet. In: Proceedings of the International Symposium on Fault-Tolerant Computing, pp. 26\u201335 (1996)","DOI":"10.1109\/FTCS.1996.534591"},{"issue":"1","key":"117_CR8","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1145\/200836.200869","volume":"42","author":"H. Attiya","year":"1995","unstructured":"Attiya H., Bar-Noy A., Dolev D.: Sharing memory robustly in message-passing systems. J. ACM 42(1), 124\u2013142 (1995)","journal-title":"J. ACM"},{"key":"117_CR9","unstructured":"Beal, J., Gilbert, S.: RamboNodes for the metropolitan ad hoc network. In: Workshop on Dependability Issues in Wireless Ad Hoc Networks and Sensor Networks (2004)"},{"key":"117_CR10","doi-asserted-by":"crossref","unstructured":"Bearden, M., Bianchini, R.P., Jr.: A fault-tolerant algorithm for decentralized on-line quorum adaptation. In: Proceedings of the International Symposium on Fault-Tolerant Computing Systems, pp. 262\u2013271 (1998)","DOI":"10.1109\/FTCS.1998.689477"},{"key":"117_CR11","volume-title":"Concurrency Control and Recovery in Database Systems","author":"P.A. Bernstein","year":"1987","unstructured":"Bernstein P.A., Hadzilacos V., Goodman N.: Concurrency Control and Recovery in Database Systems. Addison-Wesley, Reading (1987)"},{"issue":"2","key":"117_CR12","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1145\/226643.226647","volume":"43","author":"T.D. Chandra","year":"1996","unstructured":"Chandra T.D., Toueg S.: Unreliable failure detectors for reliable distributed systems. J. ACM 43(2), 225\u2013267 (1996)","journal-title":"J. ACM"},{"key":"117_CR13","doi-asserted-by":"crossref","unstructured":"Charron-Bost, B., Schiper, A.: Improving fast Paxos: being optimistic with no overhead. In: Proceedings of the Pacific Rim International Symposium on Dependable Computing, pp. 287\u2013295 (2006)","DOI":"10.1109\/PRDC.2006.39"},{"key":"117_CR14","doi-asserted-by":"crossref","unstructured":"Chockler, G., Gilbert, S., Gramoli, V., Musial, P.M., Shvartsman, A.A.: Reconfigurable distributed storage for dynamic networks. In: Proceedings of the International Conference on Principles of Distributed Systems, pp. 214\u2013219 (2005)","DOI":"10.1007\/11795490_27"},{"issue":"3","key":"117_CR15","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1145\/5505.5508","volume":"17","author":"S.B. Davidson","year":"1985","unstructured":"Davidson S.B., Garcia-Molina H., Skeen D.: Consistency in partitioned networks. ACM Comput. Surv. 17(3), 341\u2013370 (1985)","journal-title":"ACM Comput. Surv."},{"issue":"2","key":"117_CR16","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/s00446-005-0140-9","volume":"18","author":"S. Dolev","year":"2005","unstructured":"Dolev S., Gilbert S., Lynch N.A., Shvartsman A.A., Welch J.L.: Geoquorums: implementing atomic memory in mobile ad hoc networks. Distrib. Comput. 18(2), 125\u2013155 (2005)","journal-title":"Distrib. Comput."},{"key":"117_CR17","doi-asserted-by":"crossref","unstructured":"El Abbadi, A., Skeen, D., Cristian, F.: An efficient fault-tolerant protocol for replicated data management. In: Proceedings of the Symposium on Principles of Databases, pp. 215\u2013228 (1985)","DOI":"10.1145\/325405.325443"},{"issue":"2","key":"117_CR18","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1145\/63500.63501","volume":"14","author":"A. El Abbadi","year":"1989","unstructured":"El Abbadi A., Toueg S.: Maintaining availability in partitioned replicated databases. Trans. Database Syst. 14(2), 264\u2013290 (1989)","journal-title":"Trans. Database Syst."},{"key":"117_CR19","doi-asserted-by":"crossref","unstructured":"Englert, B., Shvartsman, A.A.: Graceful quorum reconfiguration in a robust emulation of shared memory. In: Proceedings of the International Conference on Distributed Computer Systems, pp. 454\u2013463 (2000)","DOI":"10.1109\/ICDCS.2000.840958"},{"issue":"2","key":"117_CR20","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1145\/377769.377776","volume":"19","author":"A. Fekete","year":"2001","unstructured":"Fekete A., Lynch N.A., Shvartsman A.A.: Specifying and using a partitionable group communication service. Trans. Comput. Syst. 19(2), 171\u2013216 (2001)","journal-title":"Trans. Comput. Syst."},{"issue":"2","key":"117_CR21","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"M.J. Fischer","year":"1985","unstructured":"Fischer M.J., Lynch N.A., Paterson M.S.: Impossibility of distributed consensus with one faulty process. J. ACM 32(2), 374\u2013382 (1985)","journal-title":"J. ACM"},{"issue":"4","key":"117_CR22","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1145\/4221.4223","volume":"32","author":"H. Garcia-Molina","year":"1985","unstructured":"Garcia-Molina H., Barbara D.: How to assign votes in a distributed system. J. ACM 32(4), 841\u2013860 (1985)","journal-title":"J. ACM"},{"key":"117_CR23","doi-asserted-by":"crossref","unstructured":"Georgiou, C., Musial, P.M., Shvartsman, A.A.: Developing a consistent domain-oriented distributed object service. In: Proceedings of the International Symposium on Network Computing and Applications, pp. 149\u2013158 (2005)","DOI":"10.1109\/NCA.2005.16"},{"issue":"1","key":"117_CR24","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/j.tcs.2007.03.052","volume":"383","author":"C. Georgiou","year":"2007","unstructured":"Georgiou C., Musial P.M., Shvartsman A.A.: Long-lived Rambo: Trading knowledge for communication. Theor. Comput. Sci. 383(1), 59\u201385 (2007)","journal-title":"Theor. Comput. Sci."},{"key":"117_CR25","doi-asserted-by":"crossref","unstructured":"Gifford, D.K.: Weighted voting for replicated data. In: Proceedings of the Symposium on Operating Systems Principles, pp. 150\u2013162 (1979)","DOI":"10.1145\/800215.806583"},{"key":"117_CR26","unstructured":"Gilbert, S.: Rambo II: Rapidly Reconfigurable Atomic Memory for Dynamic Networks. Master\u2019s thesis, MIT (2003)"},{"key":"117_CR27","doi-asserted-by":"crossref","unstructured":"Gilbert, S., Lynch, N.A., Shvartsman, A.A.: Rambo II: Rapidly reconfigurable atomic memory for dynamic networks. In: Proceedings of the International Conference on Dependable Systems and Networks, pp. 259\u2013268 (2003)","DOI":"10.1109\/DSN.2003.1209936"},{"issue":"4","key":"117_CR28","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1145\/195664.195666","volume":"19","author":"K. Goldman","year":"1994","unstructured":"Goldman K., Lynch N.A.: Quorum consensus in nested transaction systems. Trans. Database Syst. 19(4), 537\u2013585 (1994)","journal-title":"Trans. Database Syst."},{"key":"117_CR29","unstructured":"Gramoli, V.: Rambo III: Speeding-up the Reconfiguration of an Atomic Memory Service in Dynamic Distributed System. Master\u2019s thesis, Universit\u00e9 Paris Sud, Orsay (2004)"},{"key":"117_CR30","unstructured":"Gramoli, V., Musial, P.M., Shvartsman, A.A.: Operation liveness and gossip management in a dynamic distributed atomic data service. In: Proceedings of the International Conference on Parallel and Distributed Computing Systems, pp. 206\u2013211 (2005)"},{"key":"117_CR31","unstructured":"Herlihy, M.: Replication Methods for Abstract Data Types. PhD thesis, Massachusettes Institute of Technology (1984)"},{"issue":"2","key":"117_CR32","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1145\/22952.22953","volume":"12","author":"M. Herlihy","year":"1987","unstructured":"Herlihy M.: Dynamic quorum adjustment for partitioned data. Trans. Database Syst. 12(2), 170\u2013194 (1987)","journal-title":"Trans. Database Syst."},{"issue":"2","key":"117_CR33","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1145\/78922.78926","volume":"15","author":"S. Jajodia","year":"1990","unstructured":"Jajodia S., Mutchler D.: Dynamic voting algorithms for maintaining the consistency of a replicated database. Trans. Database Syst. 15(2), 230\u2013280 (1990)","journal-title":"Trans. Database Syst."},{"key":"117_CR34","unstructured":"Kaynar, D.K., Lynch, N.A., Segala, R., Vaandrager, F.: The Theory of Timed I\/O Automata. Technical Report MIT-LCS-TR-917a, MIT (2004)"},{"key":"117_CR35","unstructured":"Keidar, I.: A highly Available Paradigm for Consistent Object Replication. Master\u2019s thesis, Hebrew University, Jerusalem (1994)"},{"key":"117_CR36","doi-asserted-by":"crossref","unstructured":"Keidar, I., Dolev, D.: Efficient message ordering in dynamic networks. In: Proceedings of the Symposium on Principles of Distributed Domputing, pp. 68\u201376 (1996)","DOI":"10.1145\/248052.248062"},{"key":"117_CR37","doi-asserted-by":"crossref","unstructured":"Konwar, K.M., Musial, P.M., Nicolaou, N.C., Shvartsman, A.A.: Implementing atomic data through indirect learning in dynamic networks. In: Proceedings of the International Symposium on Network Computing and Applications, pp. 223\u2013230 (2007)","DOI":"10.1109\/NCA.2007.30"},{"issue":"7","key":"117_CR38","doi-asserted-by":"crossref","first-page":"558","DOI":"10.1145\/359545.359563","volume":"21","author":"L. Lamport","year":"1978","unstructured":"Lamport L.: Time, clocks, and the ordering of events in a distributed system. Commun. ACM 21(7), 558\u2013565 (1978)","journal-title":"Commun. ACM"},{"issue":"2","key":"117_CR39","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1145\/279227.279229","volume":"16","author":"L. Lamport","year":"1998","unstructured":"Lamport L.: The part-time parliament. Trans. Comput. Syst. 16(2), 133\u2013169 (1998)","journal-title":"Trans. Comput. Syst."},{"key":"117_CR40","unstructured":"Lamport, L.: Fast Paxos. Technical Report MSR-TR-2005-12, Microsoft (2005)"},{"issue":"2","key":"117_CR41","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/s00446-006-0005-x","volume":"19","author":"L. Lamport","year":"2006","unstructured":"Lamport L.: Fast Paxos. Distrib. Comput. 19(2), 79\u2013103 (2006)","journal-title":"Distrib. Comput."},{"key":"117_CR42","unstructured":"Liu, M., Agrawal, D., El Abaddi, A.: On the implementation of the quorum consensus protocol. In: Proceedings of the International Conference on Parallel and Distributed Computing Systems, pp. 318\u2013325 (1995)"},{"key":"117_CR43","doi-asserted-by":"crossref","unstructured":"Lotem, E.Y., Keidar, I., Dolev, D.: Dynamic voting for consistent primary components. In: Proceedings of the Symposium on Principles of Distributed Computing pp. 63\u201371 (1997)","DOI":"10.1145\/259380.259424"},{"key":"117_CR44","volume-title":"Distributed Algorithms","author":"N.A. Lynch","year":"1996","unstructured":"Lynch N.A.: Distributed Algorithms. Morgan Kaufman, San Francisco (1996)"},{"key":"117_CR45","doi-asserted-by":"crossref","unstructured":"Lynch, N.A., Shvartsman, A.A.: Robust emulation of shared memory using dynamic quorum-acknowledged broadcasts. In: Proceedings of the International Symposium on Fault-Tolerant Computing, pp. 272\u2013281 (1997)","DOI":"10.1109\/FTCS.1997.614100"},{"key":"117_CR46","doi-asserted-by":"crossref","unstructured":"Lynch, N.A., Shvartsman, A.A.: Rambo: A reconfigurable atomic memory service for dynamic networks. In: Proceedings of the International Symposium on Distributed Computing, pp. 173\u2013190 (2002)","DOI":"10.1007\/3-540-36108-1_12"},{"key":"117_CR47","doi-asserted-by":"crossref","unstructured":"Malkhi, D., Reiter, M.K.: Byzantine quorum systems. In: Proceedings of the Symposium on Theory of Computing, pp. 569\u2013578 (1997)","DOI":"10.1145\/258533.258650"},{"key":"117_CR48","unstructured":"Musial, P.M.: From High Level Specification to Executable Code: Specification, Refinement, and Implementation of a Survivable and Consistent Data Service for Dynamic Networks. PhD thesis, University of Connecticut, Storrs (2007)"},{"key":"117_CR49","doi-asserted-by":"crossref","unstructured":"Musial, P.M., Shvartsman, A.A.: Implementing a reconfigurable atomic memory service for dynamic networks. In: Proceedings of the International Parallel and Distributed Processing Symposium, p. 208b (2004)","DOI":"10.1109\/IPDPS.2004.1303237"},{"key":"117_CR50","unstructured":"Muthitacharoen, A., Gilbert, S., Morris, R.: Etna: A Fault-Tolerant Algorithm for Atomic Mutable DHT Data. Technical Report MIT-LCS-TR-993, MIT (2005)"},{"key":"117_CR51","doi-asserted-by":"crossref","unstructured":"Naor, M., Wieder, U.: Scalable and dynamic quorum systems. In: Proceedings of the Symposium on Principles of Distributed Computing, pp. 114\u2013122 (2003)","DOI":"10.1145\/872035.872052"},{"issue":"2","key":"117_CR52","first-page":"423","volume":"27","author":"M. Naor","year":"1998","unstructured":"Naor M., Wool A.: The load, capacity, and availability of quorum systems. J. Comput. 27(2), 423\u2013447 (1998)","journal-title":"J. Comput."},{"issue":"2","key":"117_CR53","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1006\/inco.1995.1169","volume":"123","author":"D. Peleg","year":"1995","unstructured":"Peleg D., Wool A.: The availability of quorum systems. Inf. Comput. 123(2), 210\u2013223 (1995)","journal-title":"Inf. Comput."},{"key":"117_CR54","doi-asserted-by":"crossref","unstructured":"Peleg, D., Wool, A.: How to be an efficient snoop, or the probe complexity of quorum systems. In: Proceedings of the Symposium on Principles of Distributed Computing, pp. 290\u2013299 (1996)","DOI":"10.1145\/248052.248112"},{"key":"117_CR55","doi-asserted-by":"crossref","unstructured":"De Prisco, R., Fekete, A., Lynch, N.A., Shvartsman, A.A.: A dynamic primary configuration group communication service. In: Proceedings of the International Symposium on Distributed Computing, pp. 64\u201378 (1999)","DOI":"10.1007\/3-540-48169-9_5"},{"issue":"1\u20132","key":"117_CR56","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/S0304-3975(00)00042-6","volume":"243","author":"R. De Priso","year":"2000","unstructured":"De Priso R., Lampson B., Lynch N.: Revisiting the Paxos algorithm. Theor. Comput. Sci. 243(1\u20132), 35\u201391 (2000)","journal-title":"Theor. Comput. Sci."},{"key":"117_CR57","doi-asserted-by":"crossref","unstructured":"Rangarajan, S., Tripathi, S.: A robust distributed mutual exclusion algorithm. In: Proceedings of the International Workshop on Distributed Algorithms, pp. 295\u2013308 (1991)","DOI":"10.1007\/BFb0022455"},{"key":"117_CR58","doi-asserted-by":"crossref","unstructured":"Saito, Y., Fr\u00f8lund, S., Veitch, A.C., Merchant, A., Spence, S.: FAB: building distributed enterprise disk arrays from commodity components. In: Proceedings of the International Conference on Architectural Support for Programming Languages and Operating Systems, pp. 48\u201358 (2004)","DOI":"10.1145\/1024393.1024400"},{"issue":"3","key":"117_CR59","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1145\/24068.28052","volume":"5","author":"B.A. Sanders","year":"1987","unstructured":"Sanders B.A.: The information structure of distributed mutual exclusion algorithms. Trans. Comput. Syst. 5(3), 284\u2013299 (1987)","journal-title":"Trans. Comput. Syst."},{"key":"117_CR60","doi-asserted-by":"crossref","unstructured":"Shraer, A., Martin, J.-P., Malkhi, D., Keidar, I.: Data-centric reconfiguration with network attached disks. In: Proceedings of LADIS (2010)","DOI":"10.1145\/1859184.1859191"},{"issue":"1","key":"117_CR61","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1145\/7531.7926","volume":"34","author":"E. Upfal","year":"1987","unstructured":"Upfal E., Wigderson A.: How to share memory in a distributed system. J. ACM 34(1), 116\u2013127 (1987)","journal-title":"J. ACM"}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-010-0117-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00446-010-0117-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-010-0117-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,26]],"date-time":"2025-02-26T00:28:47Z","timestamp":1740529727000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00446-010-0117-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,9,24]]},"references-count":61,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2010,12]]}},"alternative-id":["117"],"URL":"https:\/\/doi.org\/10.1007\/s00446-010-0117-1","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"value":"0178-2770","type":"print"},{"value":"1432-0452","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,9,24]]}}}