{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T11:27:53Z","timestamp":1780054073319,"version":"3.54.0"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319098722","type":"print"},{"value":"9783319098739","type":"electronic"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","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":[[2014]]},"DOI":"10.1007\/978-3-319-09873-9_32","type":"book-chapter","created":{"date-parts":[[2014,8,11]],"date-time":"2014-08-11T06:04:21Z","timestamp":1407737061000},"page":"379-390","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Spanning Tree or Gossip for Aggregation: A Comparative Study"],"prefix":"10.1007","author":[{"given":"Lehel","family":"Nyers","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"M\u00e1rk","family":"Jelasity","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"3","key":"32_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 Transactions on Computer Systems\u00a023(3), 219\u2013252 (2005)","journal-title":"ACM Transactions on Computer Systems"},{"key":"32_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/978-3-642-28209-6_7","volume-title":"Algorithms for Sensor Systems","author":"I. Eyal","year":"2012","unstructured":"Eyal, I., Keidar, I., Rom, R.: Limosense \u2013 live monitoring in dynamic sensor networks. In: Erlebach, T., Nikoletseas, S., Orponen, P. (eds.) ALGOSENSORS 2011. LNCS, vol.\u00a07111, pp. 72\u201385. Springer, Heidelberg (2012)"},{"key":"32_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/978-3-642-02164-0_6","volume-title":"Distributed Applications and Interoperable Systems","author":"P. Jesus","year":"2009","unstructured":"Jesus, P., Baquero, C., Almeida, P.S.: Fault-tolerant aggregation by flow updating. In: Senivongse, T., Oliveira, R. (eds.) DAIS 2009. LNCS, vol.\u00a05523, pp. 73\u201386. Springer, Heidelberg (2009)"},{"issue":"3","key":"32_CR4","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1109\/TNET.2007.893226","volume":"15","author":"M. Mehyar","year":"2007","unstructured":"Mehyar, M., Spanos, D., Pongsajapan, J., Low, S.H., Murray, R.M.: Asynchronous distributed averaging on communication networks. IEEE\/ACM Trans. Netw.\u00a015(3), 512\u2013520 (2007)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"32_CR5","doi-asserted-by":"crossref","unstructured":"Wuhib, F., Dam, M., Stadler, R., Clemm, A.: Robust monitoring of network-wide aggregates through gossiping. In: Proc. 10th IFIP\/IEEE Intl. Symp. on Integrated Management (IM 2007), pp. 21\u201325 (May 2007)","DOI":"10.1109\/INM.2007.374787"},{"key":"32_CR6","doi-asserted-by":"crossref","unstructured":"Madden, S., Franklin, M.J., Hellerstein, J.M., Hong, W.: TAG: A tiny aggregation service for ad-hoc sensor networks. In: Proc. 5th Symp. on Operating Systems Design and Implementation (OSDI 2002), pp. 131\u2013146 (2002)","DOI":"10.1145\/844128.844142"},{"key":"32_CR7","unstructured":"Gupta, I., van Renesse, R., Birman, K.P.: Scalable fault-tolerant aggregation in large process groups. In: Proc. Intl. Conf. on Dependable Systems and Networks (DSN 2001). IEEE Computer Society Press (2001)"},{"key":"32_CR8","doi-asserted-by":"crossref","unstructured":"Birman, K.P., van Renesse, R., Vogels, W.: Scalable data fusion using astrolabe. In: Proc. Fifth Intl. Conf. on Information Fusion (FUSION 2002), vol.\u00a02, pp. 1434\u20131441 (2002)","DOI":"10.1109\/ICIF.2002.1020984"},{"key":"32_CR9","unstructured":"Dam, M., Stadler, R.: A generic protocol for network state aggregation. In: Proc. Radiovetenskap och Kommunikation, RVK 2005 (2005)"},{"issue":"1","key":"32_CR10","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1109\/TNSM.2007.030101","volume":"4","author":"A.G. Prieto","year":"2007","unstructured":"Prieto, A.G., Stadler, R.: A-gap: An adaptive protocol for continuous network monitoring with accuracy objectives. IEEE Trans. on Netw. and Serv. Manag.\u00a04(1), 2\u201312 (2007)","journal-title":"IEEE Trans. on Netw. and Serv. Manag."},{"key":"32_CR11","doi-asserted-by":"crossref","unstructured":"Krishnamurthy, S., Ardelius, J., Aurell, E., Dam, M., Stadler, R., Wuhib, F.Z.: Brief announcement: the accuracy of tree-based counting in dynamic networks. In: ACM Symp. on Principles of Distr. Comp. (PODC), pp. 291\u2013292. ACM (2010)","DOI":"10.1145\/1835698.1835770"},{"key":"32_CR12","unstructured":"Jain, N., Mahajan, P., Kit, D., Yalagandula, P., Dahlin, M., Zhang, Y.: Network imprecision: A new consistency metric for scalable monitoring. In: Proc. 8th USENIX Conf. on Operating Systems Design and Implementation (OSDI 2008), pp. 87\u2013102. USENIX Association (2008)"},{"key":"32_CR13","unstructured":"Le Merrer, E., Kermarrec, A.M., Massoulie, L.: Peer to peer size estimation in large and dynamic networks: A comparative study. In: Proc. 15th IEEE Intl. Symp. on High Performance Distr. Comp. (HPDC 2006), pp. 7\u201317 (2006)"},{"key":"32_CR14","doi-asserted-by":"crossref","unstructured":"Chitnis, L., Dobra, A., Ranka, S.: Aggregation methods for large-scale sensor networks. ACM Trans. Sen. Netw.\u00a04(2), 9:1\u20139:36 (2008)","DOI":"10.1145\/1340771.1340775"},{"issue":"1","key":"32_CR15","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/BF02278851","volume":"7","author":"S. Dolev","year":"1993","unstructured":"Dolev, S., Israeli, A., Moran, S.: Self-stabilization of dynamic systems assuming only read\/write atomicity. Distributed Computing\u00a07(1), 3\u201316 (1993)","journal-title":"Distributed Computing"},{"key":"32_CR16","unstructured":"Kempe, D., Dobra, A., Gehrke, J.: Gossip-based computation of aggregate information. In: Proc. 44th Annual IEEE Symp. on Foundations of Computer Science (FOCS 2003), pp. 482\u2013491. IEEE Computer Society (2003)"},{"key":"32_CR17","doi-asserted-by":"crossref","unstructured":"Montresor, A., Jelasity, M.: Peersim: A scalable P2P simulator. In: Proc. 9th IEEE Intl. Conf. on P2P Comp. (P2P 2009), pp. 99\u2013100. IEEE (September 2009), extended abstract","DOI":"10.1109\/P2P.2009.5284506"},{"issue":"3","key":"32_CR18","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 Transactions on Computer Systems\u00a025(3), 8 (2007)","journal-title":"ACM Transactions on Computer Systems"},{"key":"32_CR19","doi-asserted-by":"crossref","unstructured":"Roverso, R., Dowling, J., Jelasity, M.: Through the wormhole: Low cost, fresh peer sampling for the internet. In: Proc. 13th IEEE Intl. Conf. on P2P Comp. (P2P 2013). IEEE (2013)","DOI":"10.1109\/P2P.2013.6688707"},{"issue":"1","key":"32_CR20","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1103\/RevModPhys.74.47","volume":"74","author":"R. Albert","year":"2002","unstructured":"Albert, R., Barab\u00e1si, A.L.: Statistical mechanics of complex networks. Reviews of Modern Physics\u00a074(1), 47\u201397 (2002)","journal-title":"Reviews of Modern Physics"},{"key":"32_CR21","unstructured":"Roozenburg, J.: Secure decentralized swarm discovery in Tribler. Master\u2019s thesis, Parallel and Distributed Systems Group, Delft University of Technology (2006)"},{"key":"32_CR22","doi-asserted-by":"crossref","unstructured":"Stutzbach, D., Rejaie, R.: Understanding churn in peer-to-peer networks. In: Proc. 6th ACM SIGCOMM Conf. on Internet Measurement (IMC 2006), pp. 189\u2013202. ACM (2006)","DOI":"10.1145\/1177080.1177105"},{"issue":"6","key":"32_CR23","doi-asserted-by":"publisher","first-page":"2508","DOI":"10.1109\/TIT.2006.874516","volume":"52","author":"S. Boyd","year":"2006","unstructured":"Boyd, S., Ghosh, A., Prabhakar, B., Shah, D.: Randomized gossip algorithms. IEEE Transactions on Information Theory\u00a052(6), 2508\u20132530 (2006)","journal-title":"IEEE Transactions on Information Theory"},{"key":"32_CR24","doi-asserted-by":"crossref","unstructured":"Levin, D.A., Peres, Y., Wilmer, E.L.: Markov Chains and Mixing Times. AMS (2008)","DOI":"10.1090\/mbk\/058"}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2014 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-09873-9_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T03:55:24Z","timestamp":1746330924000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-09873-9_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319098722","9783319098739"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-09873-9_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}