{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T13:37:36Z","timestamp":1725716256207},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642364235"},{"type":"electronic","value":"9783642364242"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-36424-2_1","type":"book-chapter","created":{"date-parts":[[2013,2,11]],"date-time":"2013-02-11T10:56:45Z","timestamp":1360580205000},"page":"1-12","source":"Crossref","is-referenced-by-count":3,"title":["An Unstructured Termination Detection Algorithm Using Gossip in Cloud Computing Environments"],"prefix":"10.1007","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":"Joon-Min","family":"Gil","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"TaeWeon","family":"Suh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"HeonChang","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"1_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0020-0190(80)90021-6","volume":"11","author":"E.W. Dijkstra","year":"1980","unstructured":"Dijkstra, E.W., Scholten, C.S.: Termination detection for diffusing computations. Inf. Proc. Letters\u00a011(1), 1\u20134 (1980)","journal-title":"Inf. Proc. Letters"},{"issue":"3","key":"1_CR2","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/BF01782776","volume":"2","author":"F. Mattern","year":"1987","unstructured":"Mattern, F.: Algorithms for distributed termination detection. Distributed Computing\u00a02(3), 161\u2013175 (1987)","journal-title":"Distributed Computing"},{"issue":"3","key":"1_CR3","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/0020-0190(89)90010-0","volume":"32","author":"S.T. Huang","year":"1989","unstructured":"Huang, S.T.: Termination detection by using distributed snapshots. Inf. Process. Lett.\u00a032(3), 113\u2013120 (1989)","journal-title":"Inf. Process. Lett."},{"issue":"10","key":"1_CR4","doi-asserted-by":"publisher","first-page":"1047","DOI":"10.1016\/j.jpdc.2007.05.013","volume":"67","author":"N.R. Mahapatra","year":"2007","unstructured":"Mahapatra, N.R., Dutt, S.: An efficient delay-optimal distributed termination detection algorithm. J. Parallel Distrib. Comput.\u00a067(10), 1047\u20131066 (2007)","journal-title":"J. Parallel Distrib. Comput."},{"key":"1_CR5","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/s00446-007-0031-3","volume":"20","author":"N. Mittal","year":"2007","unstructured":"Mittal, N., Venkatesan, S., Peri, S.: A family of optimal termination detection algorithms. Distributed Computing\u00a020, 141\u2013162 (2007)","journal-title":"Distributed Computing"},{"key":"1_CR6","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1007\/s00446-006-0013-x","volume":"19","author":"M. Livesey","year":"2007","unstructured":"Livesey, M., Morrison, R., Munro, D.: The doomsday distributed termination detection protocol. Distributed Computing\u00a019, 419\u2013431 (2007)","journal-title":"Distributed Computing"},{"issue":"2","key":"1_CR7","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1109\/TC.2003.1176982","volume":"52","author":"A. Ganesh","year":"2003","unstructured":"Ganesh, A., Kermarrec, A.M., Massoulie, L.: Peer-to-peer membership management for gossip-based protocols. IEEE Transactions on Computers\u00a052(2), 139\u2013149 (2003)","journal-title":"IEEE Transactions on Computers"},{"key":"1_CR8","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1145\/1073814.1073871","volume-title":"Proceedings of the Twenty-Fourth Annual ACM Symposium on Principles of Distributed Computing, PODC 2005","author":"A. Allavena","year":"2005","unstructured":"Allavena, A., Demers, A., Hopcroft, J.E.: Correctness of a gossip based membership protocol. In: Proceedings of the Twenty-Fourth Annual ACM Symposium on Principles of Distributed Computing, PODC 2005, pp. 292\u2013301. ACM, New York (2005)"},{"key":"1_CR9","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1145\/1582716.1582743","volume-title":"Proceedings of the 28th ACM Symposium on Principles of Distributed Computing, PODC 2009","author":"M. Gurevich","year":"2009","unstructured":"Gurevich, M., Keidar, I.: Correctness of gossip-based membership under message loss. In: Proceedings of the 28th ACM Symposium on Principles of Distributed Computing, PODC 2009, pp. 151\u2013160. ACM, New York (2009)"},{"key":"1_CR10","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1145\/1133373.1133398","volume-title":"Proceedings of the 10th Workshop on ACM SIGOPS European Workshop, EW 10","author":"A.J. Ganesh","year":"2002","unstructured":"Ganesh, A.J., Kermarrec, A.M., Massouli\u00e9, L.: Hiscamp: self-organizing hierarchical membership protocol. In: Proceedings of the 10th Workshop on ACM SIGOPS European Workshop, EW 10, pp. 133\u2013139. ACM, New York (2002)"},{"key":"1_CR11","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.: Cyclon: Inexpensive membership management for unstructured p2p overlays. Journal of Network and Systems Management\u00a013, 197\u2013217 (2005)","journal-title":"Journal of Network and Systems Management"},{"key":"1_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1007\/978-3-642-05148-7_41","volume-title":"On the Move to Meaningful Internet Systems: OTM 2009","author":"M. Matos","year":"2009","unstructured":"Matos, M., Sousa, A., Pereira, J., Oliveira, R., Deliot, E., Murray, P.: CLON: Overlay Networks and Gossip Protocols for Cloud Environments. In: Meersman, R., Dillon, T., Herrero, P. (eds.) OTM 2009, Part I. LNCS, vol.\u00a05870, pp. 549\u2013566. Springer, Heidelberg (2009)"},{"issue":"13","key":"1_CR13","doi-asserted-by":"publisher","first-page":"2321","DOI":"10.1016\/j.comnet.2009.03.013","volume":"53","author":"M. Jelasity","year":"2009","unstructured":"Jelasity, M., Montresor, A., Babaoglu, O.: T-man: Gossip-based fast overlay topology construction. Comput. Netw.\u00a053(13), 2321\u20132339 (2009)","journal-title":"Comput. Netw."},{"key":"1_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/978-3-642-20754-9_3","volume-title":"Advances in Grid and Pervasive Computing","author":"J.B. Lim","year":"2011","unstructured":"Lim, J.B., Lee, J.H., Chin, S.H., Yu, H.C.: Group-Based Gossip Multicast Protocol for Efficient and Fault Tolerant Message Dissemination in Clouds. In: Riekki, J., Ylianttila, M., Guo, M. (eds.) GPC 2011. LNCS, vol.\u00a06646, pp. 13\u201322. Springer, Heidelberg (2011)"},{"key":"1_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-642-30767-6_3","volume-title":"Advances in Grid and Pervasive Computing","author":"J. Lim","year":"2012","unstructured":"Lim, J., Chung, K.-S., Chin, S.-H., Yu, H.-C.: A Gossip-Based Mutual Exclusion Algorithm for Cloud Environments. In: Li, R., Cao, J., Bourgeois, J. (eds.) GPC 2012. LNCS, vol.\u00a07296, pp. 31\u201345. Springer, Heidelberg (2012)"},{"key":"1_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/11767886_3","volume-title":"Self-Managed Networks, Systems, and Services","author":"K. Iwanicki","year":"2006","unstructured":"Iwanicki, K., van Steen, M., Voulgaris, S.: Gossip-Based Clock Synchronization for Large Decentralized Systems. In: Keller, A., Martin-Flatin, J.-P. (eds.) SelfMan 2006. LNCS, vol.\u00a03996, pp. 28\u201342. Springer, Heidelberg (2006)"},{"key":"1_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/978-3-540-30229-2_5","volume-title":"Middleware 2004","author":"M. Jelasity","year":"2004","unstructured":"Jelasity, M., Guerraoui, R., Kermarrec, A.-M., van Steen, M.: The Peer Sampling Service: Experimental Evaluation of Unstructured Gossip-Based Implementations. In: Jacobsen, H.-A. (ed.) Middleware 2004. LNCS, vol.\u00a03231, pp. 79\u201398. Springer, Heidelberg (2004)"},{"key":"1_CR18","doi-asserted-by":"crossref","unstructured":"Montresor, A., Jelasity, M.: Peersim: A scalable p2p simulator. In: IEEE Ninth International Conference on Peer-to-Peer Computing, P2P 2009, pp. 99\u2013100 (September 2009)","DOI":"10.1109\/P2P.2009.5284506"}],"container-title":["Lecture Notes in Computer Science","Architecture of Computing Systems \u2013 ARCS 2013"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-36424-2_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,29]],"date-time":"2023-06-29T10:53:14Z","timestamp":1688035994000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-36424-2_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642364235","9783642364242"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-36424-2_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}