{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T16:23:08Z","timestamp":1725985388689},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319977942"},{"type":"electronic","value":"9783319977959"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-97795-9_16","type":"book-chapter","created":{"date-parts":[[2018,7,23]],"date-time":"2018-07-23T16:07:17Z","timestamp":1532362037000},"page":"173-185","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Robust Epidemic Aggregation Under Churn"],"prefix":"10.1007","author":[{"given":"Mosab M.","family":"Ayiad","sequence":"first","affiliation":[]},{"given":"Giuseppe","family":"Di Fatta","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,7,24]]},"reference":[{"issue":"3","key":"16_CR1","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1145\/1082469.1082470","volume":"23","author":"M Jelasity","year":"2005","unstructured":"Jelasity, M., Montresor, A., Babaoglu, O.: Gossip-based aggregation in large dynamic networks. ACM Trans. Comput. Syst. 23(3), 219\u2013252 (2005). \nhttps:\/\/doi.org\/10.1145\/1082469.1082470","journal-title":"ACM Trans. Comput. Syst."},{"key":"16_CR2","doi-asserted-by":"crossref","unstructured":"Katti, A., Fatta, G.D., Naughton, T., Engelmann, C.: Epidemic failure detection and consensus for extreme parallelism. Int. J. High Perform. Comput. Appl., 1094342017690910 (2017). \nhttps:\/\/doi.org\/10.1177\/1094342017690910","DOI":"10.1177\/1094342017690910"},{"key":"16_CR3","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/j.jpdc.2012.09.009","volume":"73","author":"GD Fatta","year":"2012","unstructured":"Fatta, G.D., Blasa, F., Cafiero, S., Fortino, G.: Fault tolerant decentralised K-Means clustering for asynchronous large-scale networks. J. Parallel Distrib. Comput. 73, 317\u2013329 (2012). \nhttps:\/\/doi.org\/10.1016\/j.jpdc.2012.09.009","journal-title":"J. Parallel Distrib. Comput."},{"issue":"2","key":"16_CR4","doi-asserted-by":"publisher","first-page":"9:1","DOI":"10.1145\/1340771.1340775","volume":"4","author":"L Chitnis","year":"2008","unstructured":"Chitnis, L., Dobra, A., Ranka, S.: Aggregation methods for large-scale sensor networks. Trans. Sens. Netw. 4(2), 9:1\u20139:36 (2008). \nhttps:\/\/doi.org\/10.1145\/1340771.1340775","journal-title":"Trans. Sens. Netw."},{"key":"16_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/978-3-642-05006-0_10","volume-title":"Modelling Autonomic Communications Environments","author":"R Makhloufi","year":"2009","unstructured":"Makhloufi, R., Bonnet, G., Doyen, G., Ga\u00efti, D.: Decentralized aggregation protocols in peer-to-peer networks: a survey. In: Strassner, J.C., Ghamri-Doudane, Y.M. (eds.) MACE 2009. LNCS, vol. 5844, pp. 111\u2013116. Springer, Heidelberg (2009). \nhttps:\/\/doi.org\/10.1007\/978-3-642-05006-0_10"},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"Kempe, D., Dobra, A., Gehrke, J.: Gossip-based computation of aggregate information. In: 44th Annual IEEE Symposium on Foundations of Computer Science, Proceedings, pp. 482\u2013491. IEEE (2003). \nhttps:\/\/doi.org\/10.1109\/SFCS.2003.1238221","DOI":"10.1109\/SFCS.2003.1238221"},{"key":"16_CR7","unstructured":"Blasa, F., Cafiero, S., Fortino, G., Fatta, G.D.: Symmetric push-sum protocol for decentralised aggregation. In: Proceedings of International Conference on Advances in P2P Systems, pp. 27\u201332. IARIA (2011)"},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"Kostoulas, D., Psaltoulis, D., Gupta, I., Birman, K., Demers, A.: Decentralized schemes for size estimation in large and dynamic groups. In: Fourth IEEE International Symposium on Network Computing and Applications, pp. 41\u201348. IEEE (2005). \nhttps:\/\/doi.org\/10.1109\/NCA.2005.15","DOI":"10.1109\/NCA.2005.15"},{"key":"16_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/978-3-319-45940-0_9","volume-title":"Internet and Distributed Computing Systems","author":"M Ayiad","year":"2016","unstructured":"Ayiad, M., Katti, A., Di Fatta, G.: Agreement in epidemic information dissemination. In: Li, W., et al. (eds.) IDCS 2016. LNCS, vol. 9864, pp. 95\u2013106. Springer, Cham (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-45940-0_9"},{"key":"16_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/978-3-642-54420-0_29","volume-title":"Euro-Par 2013: Parallel Processing Workshops","author":"P Poonpakdee","year":"2014","unstructured":"Poonpakdee, P., Orhon, N.G., Di Fatta, G.: Convergence detection in epidemic aggregation. In: an Mey, D., et al. (eds.) Euro-Par 2013. LNCS, vol. 8374, pp. 292\u2013300. Springer, Heidelberg (2014). \nhttps:\/\/doi.org\/10.1007\/978-3-642-54420-0_29"},{"key":"16_CR11","doi-asserted-by":"crossref","unstructured":"Montresor, A., Jelasity, M.: PeerSim: a scalable P2P simulator. In: Peer-to-Peer Computing, pp. 99\u2013100. IEEE (2009). \nhttps:\/\/doi.org\/10.1109\/P2P.2009.5284506","DOI":"10.1109\/P2P.2009.5284506"},{"key":"16_CR12","doi-asserted-by":"crossref","unstructured":"Rao, I., Harwood, A., Karunasekera, S.: Gossip-based asynchronous and robust aggregation protocol - a pessimistic approach. In: Consumer Communications and Networking Conference, pp. 543\u2013548. IEEE (2011). \nhttps:\/\/doi.org\/10.1109\/CCNC.2011.5766539","DOI":"10.1109\/CCNC.2011.5766539"},{"key":"16_CR13","unstructured":"Roh, H.-G., Ignat, C.L.: Rapid and Round-free Multi-pair Asynchronous Push-Pull Aggregation. Technical report, INRIA (2012). \nhttps:\/\/hal.inria.fr\/hal-00724232"},{"key":"16_CR14","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.jpdc.2015.02.003","volume":"78","author":"P Jesus","year":"2015","unstructured":"Jesus, P., Baquero, C., Almeida, P.S.: Flow updating: fault-tolerant aggregation for dynamic networks. J. Parallel Distrib. Comput. 78, 53\u201364 (2015). \nhttps:\/\/doi.org\/10.1016\/j.jpdc.2015.02.003","journal-title":"J. Parallel Distrib. Comput."}],"container-title":["Lecture Notes in Computer Science","Internet and Distributed Computing Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-97795-9_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,7,23]],"date-time":"2018-07-23T16:15:41Z","timestamp":1532362541000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-97795-9_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319977942","9783319977959"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-97795-9_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}