{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T08:55:41Z","timestamp":1775638541421,"version":"3.50.1"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2018,8,21]],"date-time":"2018-08-21T00:00:00Z","timestamp":1534809600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["DI 2097\/1-2"],"award-info":[{"award-number":["DI 2097\/1-2"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[2019,2]]},"DOI":"10.1007\/s00607-018-0652-3","type":"journal-article","created":{"date-parts":[[2018,8,21]],"date-time":"2018-08-21T09:39:05Z","timestamp":1534844345000},"page":"97-118","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["Scalable Byzantine fault-tolerant state-machine replication on heterogeneous servers"],"prefix":"10.1007","volume":"101","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2781-5333","authenticated-orcid":false,"given":"Michael","family":"Eischer","sequence":"first","affiliation":[]},{"given":"Tobias","family":"Distler","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,8,21]]},"reference":[{"key":"652_CR1","unstructured":"Aguilera MK, Strom RE (2000) Efficient atomic broadcast using deterministic merge. In: Proceedings of the 19th symposium on principles of distributed computing, pp 209\u2013218"},{"key":"652_CR2","unstructured":"Amir Y, Coan B, Kirsch J, Lane J (2007) Customizable fault tolerance for wide-area replication. In: Proceedings of the 26th international symposium on reliable distributed systems, pp 65\u201382"},{"key":"652_CR3","doi-asserted-by":"crossref","unstructured":"Amir Y, Coan B, Kirsch J, Lane J (2011) Prime: Byzantine replication under attack. In: IEEE transactions on dependable and secure computing, vol 8, no 4, pp 564\u2013577","DOI":"10.1109\/TDSC.2010.70"},{"key":"652_CR4","doi-asserted-by":"crossref","unstructured":"Aublin PL, Mokhtar SB, Qu\u00e9ma V (2013) RBFT: Redundant Byzantine fault tolerance. In: Proceedings of the 33rd international conference on distributed computing systems, pp 297\u2013306","DOI":"10.1109\/ICDCS.2013.53"},{"key":"652_CR5","doi-asserted-by":"crossref","unstructured":"Babay A, Amir Y (2016) Fast total ordering for modern data centers. In: Proceedings of the 36th international conference on distributed computing systems, pp 669\u2013679","DOI":"10.1109\/ICDCS.2016.20"},{"key":"652_CR6","doi-asserted-by":"crossref","unstructured":"Behl J, Distler T, Kapitza R (2015) Consensus-oriented parallelization: how to earn your first million. In: Proceedings of the 16th middleware conference, pp 173\u2013184","DOI":"10.1145\/2814576.2814800"},{"key":"652_CR7","doi-asserted-by":"crossref","unstructured":"Bessani A, Sousa J, Alchieri EEP (2014) State machine replication for the masses with BFT-SMaRt. In: Proceedings of the 44th international conference on dependable systems networks, pp 355\u2013362","DOI":"10.1109\/DSN.2014.43"},{"key":"652_CR8","unstructured":"Castro M, Liskov B (1999) Practical Byzantine fault tolerance. In: Proceedings of the 3rd symposium on operating systems design and implementation, pp 173\u2013186"},{"key":"652_CR9","doi-asserted-by":"crossref","unstructured":"Castro M, Rodrigues R, Liskov B (2003) BASE: using abstraction to improve fault tolerance. In: ACM transactions on computer systems, vol 21, no 3, pp 236\u2013269","DOI":"10.1145\/859716.859718"},{"key":"652_CR10","doi-asserted-by":"crossref","unstructured":"Clement A, Kapritsos M, Lee S, Wang Y, Alvisi L, Dahlin M, Riche T (2009) UpRight cluster services. In: Proceedings of the 22nd symposium on operating systems principles, pp 277\u2013290","DOI":"10.1145\/1629575.1629602"},{"key":"652_CR11","unstructured":"Distler T, Kapitza R, Reiser HP (2010) State transfer for hypervisor-based proactive recovery of heterogeneous replicated services. In: Proceedings of the 5th \u201cSicherheit, Schutz und Zuverl\u00e4ssigkeit\u201d conference, pp 61\u201372"},{"key":"652_CR12","doi-asserted-by":"crossref","unstructured":"Distler T, Cachin C, Kapitza R (2016) Resource-efficient Byzantine fault tolerance. In: IEEE transactions on computers, vol 65, no 9, pp 2807\u20132819","DOI":"10.1109\/TC.2015.2495213"},{"key":"652_CR13","doi-asserted-by":"crossref","unstructured":"Garcia M, Bessani A, Gashi I, Neves N, Obelheiro R (2014) Analysis of operating system diversity for intrusion tolerance. In: Software\u2014practice & experience, vol 44, no 6, pp 735\u2013770","DOI":"10.1002\/spe.2180"},{"key":"652_CR14","unstructured":"Hunt P, Konar M, Junqueira F, Reed B (2010) ZooKeeper: wait-free coordination for Internet-scale systems. In: Proceedings of the 2010 USENIX annual technical conference, pp 145\u2013158"},{"key":"652_CR15","unstructured":"Junqueira F, Bhagwan R, Hevia A, Marzullo K, Voelker GM (2005) Surviving Internet catastrophes. In: Proceedings of the 2005 USENIX annual technical conference, pp 45\u201360"},{"key":"652_CR16","doi-asserted-by":"crossref","unstructured":"Kapitza R, Behl J, Cachin C, Distler T, Kuhnle S, Mohammadi SV, Schr\u00f6der-Preikschat W, Stengel K (2012) CheapBFT: resource-efficient Byzantine fault tolerance. In: Proceedings of the 7th European conference on computer systems, pp 295\u2013308","DOI":"10.1145\/2168836.2168866"},{"key":"652_CR17","unstructured":"Kapritsos M, Junqueira FP (2010) Scalable agreement: toward ordering as a service. In: Proceedings of the 6th workshop on hot topics in system dependability, pp 7\u201312"},{"key":"652_CR18","doi-asserted-by":"crossref","unstructured":"Li B, Xu W, Abid MZ, Distler T, Kapitza R (2016) SAREK: optimistic parallel ordering in Byzantine fault tolerance. In: Proceedings of the 12th European dependable computing conference, pp 77\u201388","DOI":"10.1109\/EDCC.2016.36"},{"key":"652_CR19","unstructured":"Mao Y, Junqueira FP, Marzullo K (2008) Mencius: building efficient replicated state machines for WANs. In: Proceedings of the 8th conference on operating systems design and implementation, pp 369\u2013384"},{"key":"652_CR20","doi-asserted-by":"crossref","unstructured":"Ou Z, Zhuang H, Lukyanenko A, Nurminen JK, Hui P, Mazalov V, Yl\u00e4-J\u00e4\u00e4ski A (2013) Is the same instance type created equal? Exploiting heterogeneity of public clouds. In: IEEE transactions on cloud computing, vol 1, no 2, pp 201\u2013214","DOI":"10.1109\/TCC.2013.12"},{"key":"652_CR21","volume-title":"Combinatorial optimization: algorithms and complexity","author":"CH Papadimitriou","year":"1998","unstructured":"Papadimitriou CH, Steiglitz K (1998) Combinatorial optimization: algorithms and complexity. Dover Publications, New York"},{"issue":"2","key":"652_CR22","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1145\/322186.322188","volume":"27","author":"M Pease","year":"1980","unstructured":"Pease M, Shostak R, Lamport L (1980) Reaching agreement in the presence of faults. J ACM 27(2):228\u2013234","journal-title":"J ACM"},{"key":"652_CR23","doi-asserted-by":"crossref","unstructured":"Veronese GS, Correia M, Bessani AN, Lung LC (2009) Spin one\u2019s wheels? Byzantine fault tolerance with a spinning primary. In: Proceedings of the 28th international symposium on reliable distributed systems, pp 135\u2013144","DOI":"10.1109\/SRDS.2009.36"},{"key":"652_CR24","doi-asserted-by":"crossref","unstructured":"Veronese GS, Correia M, Bessani AN, Lung LC (2010) EBAWA: efficient Byzantine agreement for wide-area networks. In: Proceedings of the 12th symposium on high-assurance systems engineering, pp 10\u201319","DOI":"10.1109\/HASE.2010.19"},{"key":"652_CR25","doi-asserted-by":"crossref","unstructured":"Yin J, Martin JP, Venkataramani A, Alvisi L, Dahlin M (2003) Separating agreement from execution for Byzantine fault tolerant services. In: Proceedings of the 19th symposium on operating systems principles, pp 253\u2013267","DOI":"10.1145\/945445.945470"}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00607-018-0652-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-018-0652-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-018-0652-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,24]],"date-time":"2019-09-24T15:25:39Z","timestamp":1569338739000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00607-018-0652-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8,21]]},"references-count":25,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,2]]}},"alternative-id":["652"],"URL":"https:\/\/doi.org\/10.1007\/s00607-018-0652-3","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,8,21]]},"assertion":[{"value":"21 September 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 August 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 August 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}