{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T17:26:21Z","timestamp":1743009981148,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030500283"},{"type":"electronic","value":"9783030500290"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-50029-0_15","type":"book-chapter","created":{"date-parts":[[2020,6,9]],"date-time":"2020-06-09T23:03:55Z","timestamp":1591743835000},"page":"230-239","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Refined Mean Field Analysis: The Gossip Shuffle Protocol Revisited"],"prefix":"10.1007","author":[{"given":"Nicolas","family":"Gast","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Diego","family":"Latella","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mieke","family":"Massink","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,6,10]]},"reference":[{"key":"15_CR1","unstructured":"Bakhshi, R.: Gossiping models - formal analysis of epidemic protocols. Ph.D. thesis, Vrije Universiteit Amsterdam, January 2011. http:\/\/www.cs.vu.nl\/en\/Images\/Gossiping_Models_van_Rena_Bakhshi_tcm210-256906.pdf"},{"issue":"2","key":"15_CR2","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/j.peva.2010.08.025","volume":"68","author":"R Bakhshi","year":"2011","unstructured":"Bakhshi, R., Cloth, L., Fokkink, W., Haverkort, B.R.: Mean-field framework for performance evaluation of push-pull gossip protocols. Perform. Eval. 68(2), 157\u2013179 (2011). https:\/\/doi.org\/10.1016\/j.peva.2010.08.025","journal-title":"Perform. Eval."},{"issue":"13","key":"15_CR3","doi-asserted-by":"publisher","first-page":"2288","DOI":"10.1016\/j.comnet.2009.03.017","volume":"53","author":"R Bakhshi","year":"2009","unstructured":"Bakhshi, R., Gavidia, D., Fokkink, W., van Steen, M.: An analytical model of information dissemination for a gossip-based protocol. Comput. Netw. 53(13), 2288\u20132303 (2009). https:\/\/doi.org\/10.1016\/j.comnet.2009.03.017","journal-title":"Comput. Netw."},{"key":"15_CR4","doi-asserted-by":"publisher","unstructured":"Bakhshi, R., Gavidia, D., Fokkink, W., van Steen, M.: A modeling framework for gossip-based information spread. In: Eighth International Conference on Quantitative Evaluation of Systems, QEST 2011, Aachen, Germany, 5\u20138 September 2011, pp. 245\u2013254. IEEE Computer Society (2011). https:\/\/doi.org\/10.1109\/QEST.2011.39","DOI":"10.1109\/QEST.2011.39"},{"key":"15_CR5","first-page":"153:1","volume":"18","author":"AG Baydin","year":"2018","unstructured":"Baydin, A.G., Pearlmutter, B.A., Radul, A.A., Siskind, J.M.: Automatic differentiation in machine learning: a survey. J. Mach. Learn. Res. 18, 153:1\u2013153:43 (2018). http:\/\/jmlr.org\/papers\/v18\/17-468.html","journal-title":"J. Mach. Learn. Res."},{"issue":"5","key":"15_CR6","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1145\/1317379.1317382","volume":"41","author":"K Birman","year":"2007","unstructured":"Birman, K.: The promise, and limitations, of gossip protocols. Oper. Syst. Rev. 41(5), 8\u201313 (2007). https:\/\/doi.org\/10.1145\/1317379.1317382","journal-title":"Oper. Syst. Rev."},{"issue":"5","key":"15_CR7","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/j.peva.2013.01.001","volume":"70","author":"L Bortolussi","year":"2013","unstructured":"Bortolussi, L., Hillston, J., Latella, D., Massink, M.: Continuous approximation of collective system behaviour: a tutorial. Perform. Eval. 70(5), 317\u2013349 (2013)","journal-title":"Perform. Eval."},{"issue":"4","key":"15_CR8","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1504\/IJBIC.2011.041144","volume":"3","author":"R Frei","year":"2011","unstructured":"Frei, R., Serugendo, G.D.M.: Advances in complexity engineering. Int. J. Bio-Inspired Comput. 3(4), 199\u2013212 (2011). https:\/\/doi.org\/10.1504\/IJBIC.2011.041144","journal-title":"Int. J. Bio-Inspired Comput."},{"issue":"2","key":"15_CR9","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1504\/IJBIC.2011.039911","volume":"3","author":"R Frei","year":"2011","unstructured":"Frei, R., Serugendo, G.D.M.: Concepts in complexity engineering. Int. J. Bio-Inspired Comput. 3(2), 123\u2013139 (2011). https:\/\/doi.org\/10.1504\/IJBIC.2011.039911","journal-title":"Int. J. Bio-Inspired Comput."},{"issue":"1","key":"15_CR10","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/s10626-010-0094-3","volume":"21","author":"N Gast","year":"2011","unstructured":"Gast, N., Gaujal, B.: A mean field approach for optimization in discrete time. Discrete Event Dyn. Syst. 21(1), 63\u2013101 (2011). https:\/\/doi.org\/10.1007\/s10626-010-0094-3","journal-title":"Discrete Event Dyn. Syst."},{"issue":"2","key":"15_CR11","doi-asserted-by":"publisher","first-page":"33:1","DOI":"10.1145\/3154491","volume":"1","author":"N Gast","year":"2017","unstructured":"Gast, N., Houdt, B.V.: A refined mean field approximation. Proc. ACM Meas. Anal. Comput. Syst. 1(2), 33:1\u201333:28 (2017). https:\/\/doi.org\/10.1145\/3154491","journal-title":"Proc. ACM Meas. Anal. Comput. Syst."},{"key":"15_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.peva.2018.05.002","volume":"126","author":"N Gast","year":"2018","unstructured":"Gast, N., Latella, D., Massink, M.: A refined mean field approximation of synchronous discrete-time population models. Perform. Eval. 126, 1\u201321 (2018). https:\/\/doi.org\/10.1016\/j.peva.2018.05.002","journal-title":"Perform. Eval."},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"Gast, N., Latella, D., Massink, M.: A refined mean field approximation for synchronous population processes. In: Workshop on Mathematical Performance Modeling and Analysis (MAMA 2018), pp. 30\u201332. ACM (2019). ACM SIGMETRICS Perform. Eval. Rev","DOI":"10.1145\/3305218.3305230"},{"key":"15_CR14","doi-asserted-by":"crossref","unstructured":"Gast, N., Latella, D., Massink, M.: Refined mean field analysis of the gossip shuffle protocol - extended version - (2020). arXiv:2004.07519v1","DOI":"10.1007\/978-3-030-50029-0_15"},{"key":"15_CR15","unstructured":"Gavidia, D., Voulgaris, S., van Steen, M.: A gossip-based distributed news service for wireless mesh networks. In: Conference on Wireless On demand Network Systems and Services (WONS), pp. 59\u201367. IEEE Computer Society (2006)"},{"key":"15_CR16","series-title":"Natural Computing Series","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/978-3-642-17348-6_7","volume-title":"Self-organising Software - From Natural to Artificial Adaptation","author":"M Jelasity","year":"2011","unstructured":"Jelasity, M.: Gossip. In: Serugendo, G.D.M., Gleizes, M.P., Karageorgos, A. (eds.) Self-organising Software - From Natural to Artificial Adaptation. NCS, pp. 139\u2013162. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-17348-6_7"},{"key":"15_CR17","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.scico.2015.06.009","volume":"110","author":"D Latella","year":"2015","unstructured":"Latella, D., Loreti, M., Massink, M.: On-the-fly PCTL fast mean-field approximated model-checking for self-organising coordination. Sci. Comput. Program. 110, 23\u201350 (2015). https:\/\/doi.org\/10.1016\/j.scico.2015.06.009","journal-title":"Sci. Comput. Program."},{"key":"15_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/978-3-662-54580-5_18","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"D Latella","year":"2017","unstructured":"Latella, D., Loreti, M., Massink, M.: FlyFast: a mean field model checker. In: Legay, A., Margaria, T. (eds.) TACAS 2017. LNCS, vol. 10206, pp. 303\u2013309. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-662-54580-5_18"},{"key":"15_CR19","doi-asserted-by":"crossref","unstructured":"Le Boudec, J., McDonald, D.D., Mundinger, J.: A generic mean field convergence result for systems of interacting objects. In: Fourth International Conference on the Quantitative Evaluation of Systems (QEST 2007), Edinburgh, Scotland, UK, 17\u201319 September 2007, pp. 3\u201318. IEEE Computer Society (2007)","DOI":"10.1109\/QEST.2007.8"},{"key":"15_CR20","unstructured":"Massink, M.: Refined mean field F$$\\#$$ implementation and gossip shuffle model. https:\/\/github.com\/mimass\/RefinedMF"},{"key":"15_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1007\/978-3-319-39519-7_12","volume-title":"Coordination Models and Languages","author":"D Pianini","year":"2016","unstructured":"Pianini, D., Beal, J., Viroli, M.: Improving gossip dynamics through overlapping replicates. In: Lluch Lafuente, A., Proen\u00e7a, J. (eds.) COORDINATION 2016. LNCS, vol. 9686, pp. 192\u2013207. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-39519-7_12"},{"key":"15_CR22","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","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, M.P. (eds.) AP2PC 2003. LNCS (LNAI), vol. 2872, pp. 47\u201358. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-25840-7_6"}],"container-title":["Lecture Notes in Computer Science","Coordination Models and Languages"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-50029-0_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,9]],"date-time":"2024-06-09T23:04:16Z","timestamp":1717974256000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-50029-0_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030500283","9783030500290"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-50029-0_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"10 June 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COORDINATION","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Coordination Languages and Models","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Valletta","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Malta","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 June 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 June 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"coordination2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.discotec.org\/2020\/coordination","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"12","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"40% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2 invited tutorials and 4 tool papers. The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}