{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T04:05:29Z","timestamp":1743134729128,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642307669"},{"type":"electronic","value":"9783642307676"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-30767-6_3","type":"book-chapter","created":{"date-parts":[[2012,5,7]],"date-time":"2012-05-07T10:41:50Z","timestamp":1336387310000},"page":"31-45","source":"Crossref","is-referenced-by-count":3,"title":["A Gossip-Based Mutual Exclusion Algorithm for Cloud 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":"Sung-Ho","family":"Chin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Heon-Chang","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1145\/6110.214406","volume":"3","author":"I. Suzuki","year":"1985","unstructured":"Suzuki, I., Kasami, T.: A distributed mutual exclusion algorithm. ACM Trans. Comput. Syst.\u00a03, 344\u2013349 (1985)","journal-title":"ACM Trans. Comput. Syst."},{"key":"3_CR2","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1145\/58564.59295","volume":"7","author":"K. Raymond","year":"1989","unstructured":"Raymond, K.: A tree-based algorithm for distributed mutual exclusion. ACM Trans. Comput. Syst.\u00a07, 61\u201377 (1989)","journal-title":"ACM Trans. Comput. Syst."},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Mizuno, M., Neilsen, M.L., Rao, R.: A token based distributed mutual exclusion algorithm based on quorum agreements. In: 11th International Conference on Distributed Computing Systems, pp. 361\u2013368 (1991)","DOI":"10.1109\/ICDCS.1991.148690"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Neilsen, M.L., Mizuno, M.: A DAG-based algorithm for distributed mutual exclusion. In: 11th International Conference on Distributed Computing Systems, pp. 354\u2013360 (1991)","DOI":"10.1109\/ICDCS.1991.148689"},{"key":"3_CR5","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1145\/359545.359563","volume":"21","author":"L. Lamport","year":"1978","unstructured":"Lamport, L.: Time, clocks, and the ordering of events in a distributed system. Commun. ACM\u00a021, 558\u2013565 (1978)","journal-title":"Commun. ACM"},{"key":"3_CR6","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1145\/358527.358537","volume":"24","author":"G. Ricart","year":"1981","unstructured":"Ricart, G., Agrawala, A.K.: An optimal algorithm for mutual exclusion in computer networks. Commun. ACM\u00a024, 9\u201317 (1981)","journal-title":"Commun. ACM"},{"key":"3_CR7","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1109\/71.113087","volume":"3","author":"M. Singhal","year":"1992","unstructured":"Singhal, M.: A Dynamic Information-Structure Mutual Exclusion Algorithm for Distributed Systems. IEEE Trans. Parallel Distrib. Syst.\u00a03, 121\u2013125 (1992)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"3_CR8","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1109\/71.862205","volume":"11","author":"S. Lodha","year":"2000","unstructured":"Lodha, S., Kshemkalyani, A.: A fair distributed mutual exclusion algorithm. IEEE Transactions on Parallel and Distributed Systems\u00a011, 537\u2013549 (2000)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"3_CR9","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1145\/214438.214445","volume":"3","author":"M. Maekawa","year":"1985","unstructured":"Maekawa, M.: A \u221aN algorithm for mutual exclusion in decentralized systems. ACM Trans. Comput. Syst.\u00a03, 145\u2013159 (1985)","journal-title":"ACM Trans. Comput. Syst."},{"key":"3_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/103727.103728","volume":"9","author":"D. Agrawal","year":"1991","unstructured":"Agrawal, D., Abbadi, A.E.: An efficient and fault-tolerant solution for distributed mutual exclusion. ACM Trans. Comput. Syst.\u00a09, 1\u201320 (1991)","journal-title":"ACM Trans. Comput. Syst."},{"key":"3_CR11","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/PL00008918","volume":"13","author":"Y.-J. Joung","year":"2000","unstructured":"Joung, Y.-J.: Asynchronous group mutual exclusion. Distrib. Comput.\u00a013, 189\u2013206 (2000)","journal-title":"Distrib. Comput."},{"key":"3_CR12","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1109\/TC.2003.1176982","volume":"52","author":"A.J. Ganesh","year":"2003","unstructured":"Ganesh, A.J., Kermarrec, A.M., Massoulie, L.: Peer-to-peer membership management for gossip-based protocols. IEEE Transactions on Computers\u00a052, 139\u2013149 (2003)","journal-title":"IEEE Transactions on Computers"},{"key":"3_CR13","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1145\/1073814.1073871","volume-title":"Proceedings of the Twenty-Fourth Annual ACM Symposium on Principles of Distributed Computing","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, pp. 292\u2013301. ACM, Las Vegas (2005)"},{"key":"3_CR14","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","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, pp. 151\u2013160. ACM, Calgary (2009)"},{"key":"3_CR15","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1145\/1133373.1133398","volume-title":"Proceedings of the 10th Workshop on ACM SIGOPS European Workshop","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, pp. 133\u2013139. ACM, Saint-Emilion (2002)"},{"key":"3_CR16","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., van 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":"3_CR17","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. LNCS, vol.\u00a05870, pp. 549\u2013566. Springer, Heidelberg (2009)"},{"key":"3_CR18","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, 2321\u20132339 (2009)","journal-title":"Comput. Netw."},{"key":"3_CR19","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":"3_CR20","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":"3_CR21","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":"3_CR22","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 (2009)","DOI":"10.1109\/P2P.2009.5284506"},{"key":"3_CR23","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.: Networks: An Introduction. Oxford University Press, Inc., New York (2010)"}],"container-title":["Lecture Notes in Computer Science","Advances in Grid and Pervasive Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-30767-6_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T11:17:26Z","timestamp":1743074246000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-30767-6_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642307669","9783642307676"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-30767-6_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}