{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,29]],"date-time":"2025-12-29T19:07:40Z","timestamp":1767035260129,"version":"3.37.3"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2019,8,22]],"date-time":"2019-08-22T00:00:00Z","timestamp":1566432000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,8,22]],"date-time":"2019-08-22T00:00:00Z","timestamp":1566432000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100004663","name":"Ministry of Science and Technology, Taiwan","doi-asserted-by":"publisher","award":["MOST107-2221-E-032-006-MY2"],"award-info":[{"award-number":["MOST107-2221-E-032-006-MY2"]}],"id":[{"id":"10.13039\/501100004663","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2019,11]]},"DOI":"10.1007\/s11227-019-02970-y","type":"journal-article","created":{"date-parts":[[2019,8,22]],"date-time":"2019-08-22T16:05:59Z","timestamp":1566489959000},"page":"7690-7722","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["The harmonized consensus protocol in distributed systems"],"prefix":"10.1007","volume":"75","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9096-8047","authenticated-orcid":false,"given":"Chien-Fu","family":"Cheng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chung-Wei","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,8,22]]},"reference":[{"issue":"9","key":"2970_CR1","doi-asserted-by":"publisher","first-page":"2807","DOI":"10.1109\/TC.2015.2495213","volume":"65","author":"T Distler","year":"2016","unstructured":"Distler T, Cachin C, Kapitza R (2016) Resource-efficient Byzantine fault tolerance. IEEE Trans Comput 65(9):2807\u20132819","journal-title":"IEEE Trans Comput"},{"issue":"11","key":"2970_CR2","doi-asserted-by":"publisher","first-page":"4172","DOI":"10.1007\/s11227-015-1512-y","volume":"71","author":"E Jim\u00e9nez","year":"2015","unstructured":"Jim\u00e9nez E, Ar\u00e9valo S, Herrera C, Tang J (2015) Fault-tolerant broadcast in anonymous systems. J Supercomput 71(11):4172\u20134191","journal-title":"J Supercomput"},{"key":"2970_CR3","volume-title":"Operating system concepts","author":"A Silberschatz","year":"2018","unstructured":"Silberschatz A, Gagne G, Galvin PB (2018) Operating system concepts, 10th edn. Wiley, New York","edition":"10"},{"issue":"3","key":"2970_CR4","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1109\/TSC.2015.2473843","volume":"10","author":"K-L Peng","year":"2017","unstructured":"Peng K-L, Huang C-Y (2017) Reliability analysis of on-demand service-based software systems considering failure dependencies. IEEE Trans Serv Comput 10(3):423\u2013435","journal-title":"IEEE Trans Serv Comput"},{"key":"2970_CR5","unstructured":"Reliability engineering, \nhttps:\/\/en.wikipedia.org\/wiki\/Reliability_engineering\n\n. Accessed July 28, 2019"},{"key":"2970_CR6","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/j.jnca.2014.10.010","volume":"48","author":"C-F Cheng","year":"2015","unstructured":"Cheng C-F, Tsai K-T (2015) A recursive Byzantine-resilient protocol. J Netw Comput Appl 48:87\u201398","journal-title":"J Netw Comput Appl"},{"issue":"4","key":"2970_CR7","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/0020-0190(94)90011-6","volume":"49","author":"G Neiger","year":"1994","unstructured":"Neiger G (1994) Distributed consensus revisited. Inform Process Lett 49(4):195\u2013201","journal-title":"Inform Process Lett"},{"issue":"3","key":"2970_CR8","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1109\/71.491575","volume":"7","author":"HS Siu","year":"1996","unstructured":"Siu HS, Chin YH, Yang WP (1996) A note on consensus on dual failure modes. IEEE Trans Parallel Distrib Syst 7(3):225\u2013230","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"10","key":"2970_CR9","doi-asserted-by":"publisher","first-page":"3726","DOI":"10.1007\/s11227-015-1460-6","volume":"71","author":"E Jim\u00e9nez","year":"2015","unstructured":"Jim\u00e9nez E, Ar\u00e9valo S, Herrera C, Tang J (2015) Eventual election of multiple leaders for solving consensus in anonymous systems. J Supercomput 71(10):3726\u20133743","journal-title":"J Supercomput"},{"issue":"5","key":"2970_CR10","doi-asserted-by":"publisher","first-page":"2239","DOI":"10.1007\/s11227-018-2258-0","volume":"74","author":"SH Park","year":"2018","unstructured":"Park SH, Yoo SC, Kim BK (2018) An election protocol based on group membership detection algorithm in mobile ad hoc distributed systems. J Supercomput 74(5):2239\u20132253","journal-title":"J Supercomput"},{"key":"2970_CR11","unstructured":"Consensus (computer science). \nhttps:\/\/en.wikipedia.org\/wiki\/Consensus_(computer_science\n\n). Accessed July 28, 2019"},{"issue":"3","key":"2970_CR12","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1145\/357172.357176","volume":"4","author":"L Lamport","year":"1982","unstructured":"Lamport L, Shostak R, Pease M (1982) The Byzantine generals problem. ACM Trans Program Lang Syst 4(3):382\u2013401","journal-title":"ACM Trans Program Lang Syst"},{"issue":"2","key":"2970_CR13","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1093\/comjnl\/bxu028","volume":"58","author":"C-F Cheng","year":"2015","unstructured":"Cheng C-F, Liao H-C (2015) A malicious-resilient protocol for consistent scheduling problem in the cloud computing environment. Comput J 58(2):315\u2013330","journal-title":"Comput J"},{"key":"2970_CR14","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/3-540-12689-9_99","volume":"158","author":"M Fischer","year":"1983","unstructured":"Fischer M (1983) The consensus problem in unreliable distributed systems (a brief survey). Lect Notes Comput Sci 158:127\u2013140","journal-title":"Lect Notes Comput Sci"},{"issue":"4","key":"2970_CR15","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0020-0190(82)90033-3","volume":"14","author":"M Fischer","year":"1982","unstructured":"Fischer M, Lynch N (1982) A lower bound for the time to assure interactive consistency. Inform Process Lett 14(4):183\u2013186","journal-title":"Inform Process Lett"},{"key":"2970_CR16","unstructured":"Abraham I, Devadas S, Dolev D, Nayak K, Ren L (2017) Efficient synchronous Byzantine consensus. arXiv preprint \narXiv:1704.02397"},{"key":"2970_CR17","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.tcs.2018.08.001","volume":"758","author":"S Bonomi","year":"2019","unstructured":"Bonomi S, Pozzo AD, Potop-Butucaru M, Tixeuil S (2019) Approximate agreement under mobile byzantine faults. Theor Comput Sci 758:17\u201329","journal-title":"Theor Comput Sci"},{"issue":"4","key":"2970_CR18","doi-asserted-by":"publisher","first-page":"1085","DOI":"10.1109\/TPDS.2015.2427797","volume":"27","author":"A Most\u00e9faoui","year":"2016","unstructured":"Most\u00e9faoui A, Raynal M (2016) Intrusion-tolerant broadcast and agreement abstractions in the presence of Byzantine process. IEEE Trans Parallel Distrib Syst 27(4):1085\u20131098","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"10","key":"2970_CR19","doi-asserted-by":"publisher","first-page":"2158","DOI":"10.1109\/JSAC.2018.2869938","volume":"36","author":"E Sakic","year":"2018","unstructured":"Sakic E, \u00d0eri\u0107 N, Kellerer W (2018) MORPH: an adaptive framework for efficient and Byzantine fault-tolerant SDN control plane. IEEE J Sel Areas Commun 36(10):2158\u20132174","journal-title":"IEEE J Sel Areas Commun"},{"key":"2970_CR20","unstructured":"Krings AW, Feyer T (1990) The Byzantine agreement problem: optimal early stopping. In: HICSS-32, 1\u201312"},{"issue":"2","key":"2970_CR21","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0890-5401(92)90035-E","volume":"97","author":"A Bar-noy","year":"1992","unstructured":"Bar-noy A, Dolev D, Dwork C, Strong HR (1992) Shifting gears: changing algorithms on the fly to expedite Byzantine agreement. Inform Comput 97(2):205\u2013233","journal-title":"Inform Comput"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-019-02970-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11227-019-02970-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-019-02970-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,20]],"date-time":"2020-08-20T23:40:17Z","timestamp":1597966817000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11227-019-02970-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8,22]]},"references-count":21,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2019,11]]}},"alternative-id":["2970"],"URL":"https:\/\/doi.org\/10.1007\/s11227-019-02970-y","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"type":"print","value":"0920-8542"},{"type":"electronic","value":"1573-0484"}],"subject":[],"published":{"date-parts":[[2019,8,22]]},"assertion":[{"value":"22 August 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}