{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T18:54:49Z","timestamp":1743015289415,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":16,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811064265"},{"type":"electronic","value":"9789811064272"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-981-10-6427-2_22","type":"book-chapter","created":{"date-parts":[[2017,9,23]],"date-time":"2017-09-23T06:32:16Z","timestamp":1506148336000},"page":"266-280","source":"Crossref","is-referenced-by-count":1,"title":["A Distributed Transactional Memory Protocol for Dynamic Networks"],"prefix":"10.1007","author":[{"given":"Moumita","family":"Chatterjee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sanjit K.","family":"Setua","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,9,24]]},"reference":[{"key":"22_CR1","doi-asserted-by":"crossref","unstructured":"Attiya, H., Gramoli, V., Milani, A.: A provably starvation free distributed directory protocol. In: Proceedings of the 12th International Conference on Stabilization, Safety, and Security of Distributed Systems (SSS), pp. 405\u2013419 (2010)","DOI":"10.1007\/978-3-642-16023-3_33"},{"key":"22_CR2","unstructured":"Attiya, H., Gramoli, V., Milani, A.: Combine: an improved directory-based consistency protocol. Technical, LPD-2010-002, EPFL (2010)"},{"issue":"3","key":"22_CR3","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/s00446-007-0037-x","volume":"20","author":"M Herlihy","year":"2007","unstructured":"Herlihy, M., Sun, Y.: Distributed transactional memory for metric-space networks. Distrib. Comput. 20(3), 195\u2013208 (2007)","journal-title":"Distrib. Comput."},{"key":"22_CR4","doi-asserted-by":"crossref","unstructured":"Sharma, G., Busch, C., Srinivasagopalan, S.: Distributed transactional memory for general networks. In: 2012 IEEE 26th International Parallel and Distributed Processing Symposium (2012)","DOI":"10.1109\/IPDPS.2012.97"},{"key":"22_CR5","doi-asserted-by":"crossref","unstructured":"Zhang, B., Ravindran, B.: Dynamic analysis of the relay cache-coherence protocol for distributed transactional memory. In: IEEE International Symposium on Parallel and Distributed Processing (IPDPS) (2010)","DOI":"10.1109\/IPDPS.2010.5470393"},{"key":"22_CR6","doi-asserted-by":"crossref","unstructured":"Zhang, B., Ravindran, B.: BA: relay: a cache-coherence protocol for distributed transactional memory. In: Proceedings of the 13th International Conference on Principles of Distributed Systems (OPODIS), pp. 48\u201353 (2009)","DOI":"10.1007\/978-3-642-10877-8_6"},{"key":"22_CR7","doi-asserted-by":"publisher","first-page":"875","DOI":"10.1007\/s00224-006-1251-9","volume":"39","author":"M Herlihy","year":"2006","unstructured":"Herlihy, M., Kuhn, F., Tirthapura, S., Wattenhofer, R.: Dynamic analysis of the arrow distributed protocol. Theory Comput. Syst. 39, 875\u2013901 (2006). Springer Science+Business Media, Inc.","journal-title":"Theory Comput. Syst."},{"issue":"1","key":"22_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/1300000014","volume":"3","author":"D Shah","year":"2008","unstructured":"Shah, D.: Gossip algorithms. Found. Trends Netw. 3(1), 1\u2013125 (2008). doi: 10.1561\/1300000014","journal-title":"Gossip algorithms. Found. Trends Netw."},{"key":"22_CR9","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/11767886_3","volume-title":"SelfMan 2006","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. 3996, pp. 28\u201342. Springer, Heidelberg (2006). doi: 10.1007\/11767886_3"},{"key":"22_CR10","doi-asserted-by":"publisher","first-page":"765","DOI":"10.1016\/j.comcom.2010.10.001","volume":"34","author":"S Tang","year":"2011","unstructured":"Tang, S., Jaho, E., Stavrakakis, I., Koukoutsidis, I., Van Mieghem, P.: Modeling Gossip-based content dissemination and search in distributed networking. Comput. Commun. 34, 765\u2013779 (2011). Elsevier","journal-title":"Comput. Commun."},{"key":"22_CR11","doi-asserted-by":"publisher","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)"},{"key":"22_CR12","doi-asserted-by":"publisher","unstructured":"M\u00e1rk Jelasity \u201cGossip\u201d: Springer, 2011. Preprint version of: Di Marzo Serugendo, G., Gleizes, M.-P., Karageorgos, A. (eds.): Self-Organising Software: From Natural to Artificial Adaptation. Natural Computing Series, pp. 139\u2013162. Springer, Heidelberg (2011). doi: 10.1007\/978-3-642-17348-6_7","DOI":"10.1007\/978-3-642-17348-6_7"},{"key":"22_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1007\/978-3-642-35668-1_26","volume-title":"Distributed Computing and Networking","author":"G Sharma","year":"2013","unstructured":"Sharma, G., Busch, C.: An analysis framework for distributed hierarchical directories. In: Frey, D., Raynal, M., Sarkar, S., Shyamasundar, Rudrapatna K., Sinha, P. (eds.) ICDCN 2013. LNCS, vol. 7730, pp. 378\u2013392. Springer, Heidelberg (2013). doi: 10.1007\/978-3-642-35668-1_26"},{"key":"22_CR14","doi-asserted-by":"publisher","unstructured":"Sharma, G., Busch, C.: Distributed queuing in dynamic networks. In: Censor-Hillel, K., King, V. (eds.) Ninth International Workshop on Foundations of Mobile Computing 2013 (FOMC 2013). EPTCS, vol. 132, pp. 1\u201319 (2013). doi: 10.4204\/EPTCS.132.1","DOI":"10.4204\/EPTCS.132.1"},{"issue":"3","key":"22_CR15","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1145\/1275517.1275520","volume":"25","author":"M Jelasity","year":"2007","unstructured":"Jelasity, M., Voulgaris, S., Guerraoui, R., Kermarrec, A.-M., Van Steen, M.: Gossip-based peer sampling. ACM Trans. Comput. Syst. (TOCS) 25(3), 8 (2007). TOCS Homepage archive","journal-title":"ACM Trans. Comput. Syst. (TOCS)"},{"key":"22_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/978-3-540-25840-7_6","volume-title":"Agents and Peer-to-Peer Computing","author":"S Voulgaris","year":"2004","unstructured":"Voulgaris, S., Jelasity, M., van Steen, M.: A robust and scalable peer-to-peer gossiping protocol. In: Moro, G., Sartori, C., Singh, Munindar P. (eds.) AP2PC 2003. LNCS, vol. 2872, pp. 47\u201358. Springer, Heidelberg (2004). doi: 10.1007\/978-3-540-25840-7_6"}],"container-title":["Communications in Computer and Information Science","Computational Intelligence, Communications, and Business Analytics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-10-6427-2_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,3]],"date-time":"2019-10-03T18:07:43Z","timestamp":1570126063000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-10-6427-2_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9789811064265","9789811064272"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-981-10-6427-2_22","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2017]]}}}