{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,28]],"date-time":"2025-08-28T12:41:58Z","timestamp":1756384918233,"version":"3.37.3"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2017,3,21]],"date-time":"2017-03-21T00:00:00Z","timestamp":1490054400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"publisher","award":["NRF-2015R1D1A1A01061373"],"award-info":[{"award-number":["NRF-2015R1D1A1A01061373"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2018,5]]},"DOI":"10.1007\/s00500-017-2553-3","type":"journal-article","created":{"date-parts":[[2017,3,21]],"date-time":"2017-03-21T23:23:22Z","timestamp":1490138602000},"page":"3011-3022","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Byzantine-resilient dual gossip membership management in clouds"],"prefix":"10.1007","volume":"22","author":[{"given":"JongBeom","family":"Lim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kwang-Sik","family":"Chung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"HwaMin","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kangbin","family":"Yim","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":[[2017,3,21]]},"reference":[{"key":"2553_CR1","doi-asserted-by":"publisher","unstructured":"Aikebaier A, Enokido T, Takizawa M (2011) Tmpr-scheme for reliably broadcast messages among peer processes. Int J Grid Util Comput 2(3):175\u2013182. doi:\n                        10.1504\/IJGUC.2011.042040\n                        \n                    . \n                        http:\/\/www.inderscienceonline.com\/doi\/abs\/10.1504\/IJGUC.2011.042040","DOI":"10.1504\/IJGUC.2011.042040"},{"key":"2553_CR2","doi-asserted-by":"publisher","unstructured":"Allavena A, Demers A, Hopcroft JE (2005) Correctness of a gossip based membership protocol. In: Proceedings of the twenty-fourth annual ACM symposium on principles of distributed computing, PODC \u201905, ACM, New York, pp. 292\u2013301. doi:\n                        10.1145\/1073814.1073871","DOI":"10.1145\/1073814.1073871"},{"key":"2553_CR3","doi-asserted-by":"publisher","unstructured":"Andreica MI, T\n                        $$\\in $$\n                        \n                            \n                                \u2208\n                            \n                        \n                    r\u015fa ED, \u0162\u0103pu\u015f N, (2011) A modular framework for the development of peer-to-peer applications and services. Int J Grid Util Comput 2(3):215\u2013233. doi:\n                        10.1504\/IJGUC.2011.042044\n                        \n                    . \n                        http:\/\/www.inderscienceonline.com\/doi\/abs\/10.1504\/IJGUC.2011.042044","DOI":"10.1504\/IJGUC.2011.042044"},{"key":"2553_CR4","doi-asserted-by":"publisher","unstructured":"Arour K, Zammali S, Bouzeghoub A (2015) Test-bed building process for context-aware peer-to-peer information retrieval evaluation. Int J Space Based Situat Comput 5(1):23\u201338. doi:\n                        10.1504\/IJSSC.2015.067980\n                        \n                    . \n                        http:\/\/www.inderscienceonline.com\/doi\/abs\/10.1504\/IJSSC.2015.067980","DOI":"10.1504\/IJSSC.2015.067980"},{"key":"2553_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/978-3-642-16955-7_10","volume-title":"Middleware 2010","author":"M Bertier","year":"2010","unstructured":"Bertier M, Frey D, Guerraoui R, Kermarrec AM, Leroy V (2010) The gossple anonymous social network. In: Gupta I, Mascolo C (eds) Middleware 2010, vol 6452., Lecture Notes in Computer ScienceSpringer, Berlin, pp 191\u2013211. doi:\n                        10.1007\/978-3-642-16955-7_10"},{"key":"2553_CR6","doi-asserted-by":"publisher","unstructured":"Bortnikov E, Gurevich M, Keidar I, Kliot G, Shraer A (2009) Brahms: Byzantine resilient random membership sampling. Comput Netw 53(13):2340\u20132359. doi:\n                        10.1016\/j.comnet.2009.03.008\n                        \n                    . \n                        http:\/\/www.sciencedirect.com\/science\/article\/pii\/S1389128609001182","DOI":"10.1016\/j.comnet.2009.03.008"},{"key":"2553_CR7","doi-asserted-by":"publisher","unstructured":"Busnel Y, Beraldi R, Baldoni R (2011) On the uniformity of peer sampling based on view shuffling. J Parallel Distrib Comput 71(8):1165\u20131176. doi:\n                        10.1016\/j.jpdc.2011.01.009\n                        \n                    . \n                        http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0743731511000219","DOI":"10.1016\/j.jpdc.2011.01.009"},{"key":"2553_CR8","unstructured":"Chu Y, Ganjam A, Ng TSE, Rao SG, Sripanidkulchai K, Zhan J, Zhang H (2004) Early experience with an internet broadcast system based on overlay multicast. In: Proceedings of the annual conference on USENIX annual technical conference, ATEC \u201904, pp. 12\u201312. USENIX Association, Berkeley. \n                        http:\/\/dl.acm.org\/citation.cfm?id=1247415.1247427"},{"key":"2553_CR9","doi-asserted-by":"publisher","unstructured":"Chun BG, 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, ACM, New York, pp. 189\u2013204. doi:\n                        10.1145\/1294261.1294280","DOI":"10.1145\/1294261.1294280"},{"key":"2553_CR10","doi-asserted-by":"crossref","unstructured":"Correia M, Neves NF, 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. IEEE Computer Society, Washington, DC, USA, pp. 174\u2013183. ISBN:0-7695-2239-4","DOI":"10.1109\/RELDIS.2004.1353018"},{"issue":"5","key":"2553_CR11","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1109\/MC.2004.1297243","volume":"37","author":"PT Eugster","year":"2004","unstructured":"Eugster PT, Guerraoui R, Kermarrec AM, Massoulieacute L (2004) Epidemic information dissemination in distributed systems. Computer 37(5):60\u201367. doi:\n                        10.1109\/MC.2004.1297243","journal-title":"Computer"},{"key":"2553_CR12","doi-asserted-by":"publisher","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, ACM, New York, pp. 151\u2013160. doi:\n                        10.1145\/1582716.1582743","DOI":"10.1145\/1582716.1582743"},{"issue":"2\/3","key":"2553_CR13","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1504\/IJGUC.2012.047765","volume":"3","author":"K Haribabu","year":"2012","unstructured":"Haribabu K, Hota C, Paul A (2012) Gaur: a method to detect Sybil groups in peer-to-peer overlays. Int. J. Grid Util. Comput. 3(2\/3):145\u2013156. doi:\n                        10.1504\/IJGUC.2012.047765","journal-title":"Int. J. Grid Util. Comput."},{"key":"2553_CR14","doi-asserted-by":"publisher","unstructured":"Hill R, Antonopoulos N, Berry S (2012) Peer-to-peer networks and collective intelligence: the case for agency. Int J Grid Util Comput 3(4):233\u2013241. doi:\n                        10.1504\/IJGUC.2012.051420\n                        \n                    . \n                        http:\/\/www.inderscienceonline.com\/doi\/abs\/10.1504\/IJGUC.2012.051420","DOI":"10.1504\/IJGUC.2012.051420"},{"key":"2553_CR15","doi-asserted-by":"publisher","unstructured":"Hsu TY, Kshemkalyani AD (2015) Variable social vector clocks for exploring user interactions in social communication networks. Int J Space Based Situat Comput 5(1):39\u201352. doi:\n                        10.1504\/IJSSC.2015.067997\n                        \n                    . \n                        http:\/\/www.inderscienceonline.com\/doi\/abs\/10.1504\/IJSSC.2015.067997","DOI":"10.1504\/IJSSC.2015.067997"},{"key":"2553_CR16","doi-asserted-by":"publisher","unstructured":"Iwanicki K, van Steen M, Voulgaris S (2006) Gossip-based clock synchronization for large decentralized systems. In: Proceedings of the second IEEE international conference on self-managed networks, systems, and services, SelfMan\u201906, Springer-Verlag, Berlin, pp. 28\u201342. doi:\n                        10.1007\/11767886_3","DOI":"10.1007\/11767886_3"},{"key":"2553_CR17","doi-asserted-by":"crossref","unstructured":"Jelasity M, Guerraoui R, Kermarrec AM, van Steen M (2004) The peer sampling service: experimental evaluation of unstructured gossip-based implementations. In: Proceedings of the 5th ACM\/IFIP\/USENIX international conference on middleware, Middleware \u201904, Springer-Verlag New York, Inc., New York, pp. 79\u201398. \n                        http:\/\/dl.acm.org\/citation.cfm?id=1045658.1045666","DOI":"10.1007\/978-3-540-30229-2_5"},{"key":"2553_CR18","doi-asserted-by":"crossref","unstructured":"Jelasity M, Montresor A (2004) Epidemic-style proactive aggregation in large overlay networks. In: ICDCS 2004: Proceedings of the 24th international conference on Distributed computing systems (ICDCS 2004), pp. 102\u2013109. IEEE Computer Society, Washington, DC, USA","DOI":"10.1109\/ICDCS.2004.1281573"},{"key":"2553_CR19","doi-asserted-by":"publisher","unstructured":"Kamilaris A, Taliadoros G, Pitsillides A, Papadiomidous D (2012) The practice of online social networking of the physical world. Int J Space Based Situat Comput 2(4):240\u2013252. doi:\n                        10.1504\/IJSSC.2012.050007\n                        \n                    . \n                        http:\/\/www.inderscienceonline.com\/doi\/abs\/10.1504\/IJSSC.2012.050007","DOI":"10.1504\/IJSSC.2012.050007"},{"key":"2553_CR20","doi-asserted-by":"publisher","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 ACM European conference on computer systems, EuroSys \u201912, ACM, New York, pp. 295\u2013308. doi:\n                        10.1145\/2168836.2168866","DOI":"10.1145\/2168836.2168866"},{"issue":"3","key":"2553_CR21","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. doi:\n                        10.1145\/357172.357176","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"2553_CR22","series-title":"Lecture notes in computer science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-36424-2_1","volume-title":"Architecture of computing systems ARCS 2013","author":"J Lim","year":"2013","unstructured":"Lim J, Chung KS, Gil JM, Suh T, Yu H (2013) An unstructured termination detection algorithm using gossip in cloud computing environments. In: Kubtov H, Hochberger C, Dank M, Sick B (eds) Architecture of computing systems ARCS 2013, vol 7767., Lecture notes in computer scienceSpringer, Berlin, pp 1\u201312. doi:\n                        10.1007\/978-3-642-36424-2_1"},{"issue":"1","key":"2553_CR23","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/s10796-013-9460-7","volume":"16","author":"J Lim","year":"2014","unstructured":"Lim J, Suh T, Gil J, Yu H (2014) Scalable and leaderless Byzantine consensus in cloud computing environments. Inform Syst Front 16(1):19\u201334. doi:\n                        10.1007\/s10796-013-9460-7","journal-title":"Inform Syst Front"},{"key":"2553_CR24","doi-asserted-by":"publisher","DOI":"10.1002\/dac.2638","author":"J Lim","year":"2013","unstructured":"Lim J, Suh T, Yu H (2013b) Unstructured deadlock detection technique with scalability and complexity-efficiency in clouds. Int J Commun Syst. doi:\n                        10.1002\/dac.2638","journal-title":"Int J Commun Syst"},{"key":"2553_CR25","doi-asserted-by":"publisher","unstructured":"Malatras A (2015) State-of-the-art survey on \n                        $$\\{\\text{P2P}\\}$$\n                        \n                            \n                                \n                                    {\n                                    P2P\n                                    }\n                                \n                            \n                        \n                     overlay networks in pervasive computing environments. J Netw Comput Appl 55:1\u201323. doi:\n                        10.1016\/j.jnca.2015.04.014\n                        \n                    . \n                        http:\/\/www.sciencedirect.com\/science\/article\/pii\/S1084804515000879","DOI":"10.1016\/j.jnca.2015.04.014"},{"key":"2553_CR26","doi-asserted-by":"publisher","unstructured":"Matos M, Sousa A, Pereira J, Oliveira R, Deliot E, Murray P (2009) Clon: Overlay networks and gossip protocols for cloud environments. In: Proceedings of the confederated international conferences, CoopIS, DOA, IS, and ODBASE 2009 on the move to meaningful internet systems: part I, OTM \u201909, Springer-Verlag, Berlin, pp. 549\u2013566. doi:\n                        10.1007\/978-3-642-05148-7_41","DOI":"10.1007\/978-3-642-05148-7_41"},{"issue":"2","key":"2553_CR27","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. doi:\n                        10.1145\/322186.322188","journal-title":"J. ACM"},{"key":"2553_CR28","doi-asserted-by":"publisher","unstructured":"Schiavoni V, Riviere E, Felber P (2011) Whisper: middleware for confidential communication in large-scale networks. In: Distributed computing systems (ICDCS), 2011 31st international conference on, pp. 456\u2013466. doi:\n                        10.1109\/ICDCS.2011.15","DOI":"10.1109\/ICDCS.2011.15"},{"issue":"2","key":"2553_CR29","doi-asserted-by":"publisher","first-page":"193","DOI":"10.3745\/JIPS.01.0001","volume":"10","author":"R Sharma","year":"2014","unstructured":"Sharma R, Nitin N (2014) Duplication with task assignment in mesh distributed system. J Inform Process Syst 10(2):193\u2013214. doi:\n                        10.3745\/JIPS.01.0001","journal-title":"J Inform Process Syst"},{"key":"2553_CR30","doi-asserted-by":"publisher","unstructured":"Singh A, Urdaneta G, van Steen M, Vitenberg R (2012) Robust overlays for privacy-preserving data dissemination over a social graph. In: Distributed computing systems (ICDCS), 2012 IEEE 32nd international conference on, pp. 234\u2013244. doi:\n                        10.1109\/ICDCS.2012.57","DOI":"10.1109\/ICDCS.2012.57"},{"issue":"1","key":"2553_CR31","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1109\/JSAC.2003.818778","volume":"22","author":"A Stavrou","year":"2004","unstructured":"Stavrou A, Rubenstein D, Sahu S (2004) A lightweight, robust p2p system to handle flash crowds. IEEE J Sel Areas Commun 22(1):6\u201317. doi:\n                        10.1109\/JSAC.2003.818778","journal-title":"IEEE J Sel Areas Commun"},{"key":"2553_CR32","doi-asserted-by":"publisher","unstructured":"T\u00f6lgyesi N, Jelasity M (2009) Adaptive peer sampling with newscast. In: Sips H, Epema D, Lin H-X (eds) Proceedings of the 15th international Euro-Par conference on parallel processing, Euro-Par \u201909, Springer-Verlag, Berlin, pp. 523\u2013534. doi:\n                        10.1007\/978-3-642-03869-3_50","DOI":"10.1007\/978-3-642-03869-3_50"},{"issue":"1","key":"2553_CR33","doi-asserted-by":"publisher","first-page":"7:1","DOI":"10.1145\/2593512","volume":"47","author":"AN Toosi","year":"2014","unstructured":"Toosi AN, Calheiros RN, Buyya R (2014) Interconnected cloud computing environments: challenges, taxonomy, and survey. ACM Comput Surv 47(1):7:1\u20137:47. doi:\n                        10.1145\/2593512","journal-title":"ACM Comput Surv"},{"issue":"1","key":"2553_CR34","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1109\/TC.2011.221","volume":"62","author":"G Veronese","year":"2013","unstructured":"Veronese G, Correia M, Bessani A, Lung LC, Verissimo P (2013) Efficient Byzantine fault-tolerance. IEEE Trans Comput 62(1):16\u201330. doi:\n                        10.1109\/TC.2011.221","journal-title":"IEEE Trans Comput"},{"issue":"2","key":"2553_CR35","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/s10922-005-4441-x","volume":"13","author":"S Voulgaris","year":"2005","unstructured":"Voulgaris S, Gavidia D, Steen M (2005) Cyclon: inexpensive membership management for unstructured p2p overlays. J Netw Syst Manag 13(2):197\u2013217. doi:\n                        10.1007\/s10922-005-4441-x","journal-title":"J Netw Syst Manag"},{"issue":"2","key":"2553_CR36","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1109\/TNSM.2012.031512.110176","volume":"9","author":"F Wuhib","year":"2012","unstructured":"Wuhib F, Stadler R, Spreitzer M (2012) A gossip protocol for dynamic resource management in large cloud environments. IEEE Trans Netw Serv Manag 9(2):213\u2013225. doi:\n                        10.1109\/TNSM.2012.031512.110176","journal-title":"IEEE Trans Netw Serv Manag"},{"key":"2553_CR37","doi-asserted-by":"publisher","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 nineteenth ACM symposium on operating systems principles, SOSP \u201903, ACM, New York, pp. 253\u2013267. doi:\n                        10.1145\/945445.945470","DOI":"10.1145\/945445.945470"},{"key":"2553_CR38","doi-asserted-by":"publisher","unstructured":"Zeilemaker N, Capot\u0103 M, Bakker A, Pouwelse J (2011) Tribler: p2p media search and sharing. In: Proceedings of the 19th ACM international conference on multimedia, MM \u201911, ACM, New York, pp. 739\u2013742. doi:\n                        10.1145\/2072298.2072433","DOI":"10.1145\/2072298.2072433"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-017-2553-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-017-2553-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-017-2553-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,4,7]],"date-time":"2018-04-07T11:05:07Z","timestamp":1523099107000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-017-2553-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,3,21]]},"references-count":38,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2018,5]]}},"alternative-id":["2553"],"URL":"https:\/\/doi.org\/10.1007\/s00500-017-2553-3","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"type":"print","value":"1432-7643"},{"type":"electronic","value":"1433-7479"}],"subject":[],"published":{"date-parts":[[2017,3,21]]}}}