{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T08:09:26Z","timestamp":1759133366257},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,10,20]],"date-time":"2013-10-20T00:00:00Z","timestamp":1382227200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Inf Syst Front"],"published-print":{"date-parts":[[2014,3]]},"DOI":"10.1007\/s10796-013-9460-7","type":"journal-article","created":{"date-parts":[[2013,10,18]],"date-time":"2013-10-18T21:23:24Z","timestamp":1382131404000},"page":"19-34","source":"Crossref","is-referenced-by-count":15,"title":["Scalable and leaderless Byzantine consensus in cloud computing environments"],"prefix":"10.1007","volume":"16","author":[{"given":"JongBeom","family":"Lim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Taeweon","family":"Suh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"JoonMin","family":"Gil","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Heonchang","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,10,20]]},"reference":[{"key":"9460_CR1","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1145\/1073814.1073871","volume-title":"In Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing, PODC \u201905","author":"A Allavena","year":"2005","unstructured":"Allavena, A., Demers, A., Hopcroft, J.E. (2005). Correctness of a gossip based membership protocol. In Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing, PODC \u201905, (pp. 292\u2013301). New York: ACM. doi: 10.1145\/1.0738141073871 ."},{"issue":"4","key":"9460_CR2","doi-asserted-by":"crossref","first-page":"564","DOI":"10.1109\/TDSC.2010.70","volume":"8","author":"Y Amir","year":"2011","unstructured":"Amir, Y., Coan, B., Kirsch, J., Lane, J. (2011). Prime: Byzantine replication under attack. IEEE Transactions on Dependable and Secure Computing, 8(4), 564\u2013577. doi: 10.1109\/TDSC.2010.70 .","journal-title":"IEEE Transactions on Dependable and Secure Computing"},{"issue":"8","key":"9460_CR3","doi-asserted-by":"crossref","first-page":"1080","DOI":"10.1109\/TC.2009.71","volume":"58","author":"A Bessani","year":"2009","unstructured":"Bessani, A., Correia, M., da Silva Fraga, J., Lung, L.C. (2009). An efficient byzantine-resilient tuple space. IEEE Transactions on Computers, 58(8), 1080\u20131094. doi: 10.1109\/TC.2009.71 .","journal-title":"IEEE Transactions on Computers"},{"issue":"6","key":"9460_CR4","doi-asserted-by":"crossref","first-page":"599","DOI":"10.1016\/j.future.2008.12.001","volume":"25","author":"R Buyya","year":"2009","unstructured":"Buyya, R., Yeo, C.S., Venugopal, S., Broberg, J., Brandic, I. (2009). Cloud computing and emerging IT platforms: Vision, hype, and reality for delivering computing as the 5th utility. Future Generation Computer Systems, 25(6), 599\u2013616. doi: 10.1016\/j.future.2008.12.001 . http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0167739X08001957 .","journal-title":"Future Generation Computer Systems"},{"issue":"4","key":"9460_CR5","doi-asserted-by":"crossref","first-page":"398","DOI":"10.1145\/571637.571640","volume":"20","author":"M Castro","year":"2002","unstructured":"Castro, M., & Liskov, B. (2002). Practical byzantine fault tolerance and proactive recovery. ACM Transactions on Computer Systems, 20(4), 398\u2013461. doi: 10.1145\/571637.571640 .","journal-title":"ACM Transactions on Computer Systems"},{"issue":"4","key":"9460_CR6","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1109\/TSC.2011.39","volume":"5","author":"K Chard","year":"2012","unstructured":"Chard, K., Bubendorfer, K., Caton, S., Rana, O. (2012). Social cloud computing: a vision for socially motivated resource sharing. IEEE Transactions on Services Computing, 5(4), 551\u2013563. doi: 10.1109\/TSC.2011.39 .","journal-title":"IEEE Transactions on Services Computing"},{"key":"9460_CR7","unstructured":"Chun, B.G., Maniatis, P., Shenker, S., Kubiatowicz, J. (2007). Attested append-only memory: making adversaries stick to their word. In Proceedings of twenty-first ACM SIGOPS symposium on operating systems principles, SOSP \u201907 (pp. 189\u2013204). New York: ACM. doi: 10.1145\/1.2942611294280 ."},{"key":"9460_CR8","doi-asserted-by":"crossref","unstructured":"Correia, M., Neves, N., Verissimo, P. (2004). How to tolerate half less one byzantine nodes in practical distributed systems. In Proceedings of the 23rd IEEE international symposium on reliable distributed systems, 2004 (pp. 174\u2013183). doi: 10.1109\/RELDIS.2004.1353018 .","DOI":"10.1109\/RELDIS.2004.1353018"},{"issue":"2","key":"9460_CR9","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1109\/TC.2003.1176982","volume":"52","author":"A Ganesh","year":"2003","unstructured":"Ganesh, A., Kermarrec, A. M., Massoulie, L. (2003). Peer-to-peer membership management for gossip-based protocols. IEEE Transactions on Computers, 52(2), 139\u2013149. doi: 10.1109\/TC.2003.1176982 .","journal-title":"IEEE Transactions on Computers"},{"key":"9460_CR10","unstructured":"Gurevich, M., & Keidar, I. (2009). Correctness of gossip-based membership under message loss. In Proceedings of the 28th ACM symposium on principles of distributed computing, PODC \u201909 (pp. 151\u2013160). New York: ACM. doi: 10.1145\/1.5827161582743 ."},{"issue":"6","key":"9460_CR11","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1109\/MM.1984.291277","volume":"4","author":"B Johnson","year":"1984","unstructured":"Johnson, B. (1984). Fault-tolerant microprocessor-based systems. IEEE Micro, 4(6), 6\u201321. doi: 10.1109\/MM.1984.291277 .","journal-title":"IEEE Micro"},{"key":"9460_CR12","unstructured":"Kapitza, R., Behl, J., Cachin, C., Distler, T., Kuhnle, S., Mohammadi, S. V., Schr\u00f6der-Preikschat, W., Stengel, K. (2012). Cheapbft: resource-efficient byzantine fault tolerance. In Proceedings of the 7th ACM european conference on computer Systems, EuroSys \u201912 (pp. 295\u2013308). New York: ACM. doi: 10.1145\/2.1688362168866 ."},{"issue":"3","key":"9460_CR13","doi-asserted-by":"crossref","first-page":"379","DOI":"10.3745\/JIPS.2013.9.3.379","volume":"9","author":"M Komal","year":"2013","unstructured":"Komal, M., Ansuyia, M., Deepak, D. (2013). Round robin with server affinity: A VM load balancing algorithm for cloud based infrastructure. Journal of Information Processing Systems, 9(3), 379\u2013394. doi: 10.3745\/JIPS.2013.9.3.379 . ISSN 1976-913X.","journal-title":"Journal of Information Processing Systems"},{"issue":"2","key":"9460_CR14","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1145\/279227.279229","volume":"16","author":"L Lamport","year":"1998","unstructured":"Lamport, L. (1998). The part-time parliament. ACM Transactions on Computer Systems, 16(2), 133\u2013169. doi: 10.1145\/279227.279229 .","journal-title":"ACM Transactions on Computer Systems"},{"issue":"3","key":"9460_CR15","doi-asserted-by":"crossref","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 Transactions on Programming Languages and Systems, 4(3), 382\u2013401. doi: 10.1145\/357172.357176 .","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"9460_CR16","doi-asserted-by":"crossref","unstructured":"Malkhi, D., & Reiter, M. (1997). Byzantine quorum systems. In Proceedings of the twenty-ninth annual ACM symposium on theory of computing, STOC \u201997 (pp. 569\u2013578). New York: ACM. doi: 10.1145\/258533.258650 .","DOI":"10.1145\/258533.258650"},{"key":"9460_CR17","doi-asserted-by":"crossref","DOI":"10.1093\/acprof:oso\/9780199206650.001.0001","volume-title":"Networks: an introduction","author":"M Newman","year":"2010","unstructured":"Newman, M. (2010). Networks: an introduction. New York: Oxford University Press, Inc."},{"issue":"2","key":"9460_CR18","doi-asserted-by":"crossref","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. Journal of the ACM, 27(2), 228\u2013234. doi: 10.1145\/322186.322188 .","journal-title":"Journal of the ACM"},{"issue":"2","key":"9460_CR19","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1145\/190.357399","volume":"2","author":"FB Schneider","year":"1984","unstructured":"Schneider, F.B. (1984). Byzantine generals in action: implementing fail-stop processors. ACM Transactions on Computer Systems, 2(2), 145\u2013154. doi: 10.1145\/190.357399 .","journal-title":"ACM Transactions on Computer Systems"},{"issue":"4","key":"9460_CR20","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1145\/98163.98167","volume":"22","author":"FB Schneider","year":"1990","unstructured":"Schneider, F.B. (1990). Implementing fault-tolerant services using the state machine approach: a tutorial. ACM Computing Surveys, 22(4), 299\u2013319. doi: 10.1145\/98163.98167 .","journal-title":"ACM Computing Surveys"},{"issue":"1","key":"9460_CR21","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1109\/TC.2011.221","volume":"62","author":"G Veronese","year":"2013","unstructured":"Veronese, G., Correia, M., Bessani, A., Lung, L.C., Verissimo, P. (2013). Efficient byzantine fault-tolerance. IEEE Transactions on Computers, 62(1), 16\u201330. doi: 10.1109\/TC.2011.221 .","journal-title":"IEEE Transactions on Computers"},{"issue":"1","key":"9460_CR22","doi-asserted-by":"crossref","first-page":"906","DOI":"10.1016\/j.eswa.2010.07.072","volume":"38","author":"SS Wang","year":"2011","unstructured":"Wang, S.S., Yan, K. Q., Wang, S.C. (2011). Achieving efficient agreement within a dual-failure cloud-computing environment. Expert Systems with Applications, 38(1), 906\u2013915. doi: 10.1016\/j.eswa.2010.07.072 .","journal-title":"Expert Systems with Applications"},{"key":"9460_CR23","doi-asserted-by":"crossref","unstructured":"Yin, J., Martin, J.P., Venkataramani, A., Alvisi, L., Dahlin, M. (2003). Separating agreement from execution for byzantine fault tolerant services. In Proceedings of the nineteenth ACM symposium on operating systems principles, SOSP \u201903 (pp. 253\u2013267). New York: ACM. doi: 10.1145\/945445.945470 .","DOI":"10.1145\/945445.945470"},{"key":"9460_CR24","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Zheng, Z., Lyu, M. (2011). Bftcloud: a byzantine fault tolerance framework for voluntary-resource cloud computing. In IEEE international conference on cloud computing (CLOUD), 2011 (pp. 444\u2013451). doi: 10.1109\/CLOUD.2011.16 .","DOI":"10.1109\/CLOUD.2011.16"}],"container-title":["Information Systems Frontiers"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10796-013-9460-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10796-013-9460-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10796-013-9460-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T20:36:23Z","timestamp":1559248583000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10796-013-9460-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,10,20]]},"references-count":24,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,3]]}},"alternative-id":["9460"],"URL":"https:\/\/doi.org\/10.1007\/s10796-013-9460-7","relation":{},"ISSN":["1387-3326","1572-9419"],"issn-type":[{"value":"1387-3326","type":"print"},{"value":"1572-9419","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,10,20]]}}}