{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T07:00:27Z","timestamp":1743058827279,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642021633"},{"type":"electronic","value":"9783642021640"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-02164-0_6","type":"book-chapter","created":{"date-parts":[[2009,6,2]],"date-time":"2009-06-02T04:52:00Z","timestamp":1243918320000},"page":"73-86","source":"Crossref","is-referenced-by-count":15,"title":["Fault-Tolerant Aggregation by Flow Updating"],"prefix":"10.1007","author":[{"given":"Paulo","family":"Jesus","sequence":"first","affiliation":[]},{"given":"Carlos","family":"Baquero","sequence":"additional","affiliation":[]},{"given":"Paulo S\u00e9rgio","family":"Almeida","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/3-540-37795-6_16","volume-title":"Future Directions in Distributed Computing","author":"R. Renesse Van","year":"2003","unstructured":"Van Renesse, R.: The importance of aggregation. In: Schiper, A., Shvartsman, M.M.A.A., Weatherspoon, H., Zhao, B.Y. (eds.) Future Directions in Distributed Computing. LNCS, vol.\u00a02584, pp. 87\u201392. Springer, Heidelberg (2003)"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"Stoica, I., Morris, R., Karger, D., Kaashoek, M., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for internet applications. In: SIGCOMM 2001: Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications, pp. 149\u2013160 (August 2001)","DOI":"10.1145\/383059.383071"},{"issue":"2","key":"6_CR3","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/s00446-005-0139-2","volume":"18","author":"I. Abraham","year":"2005","unstructured":"Abraham, I., Malkhi, D.: Probabilistic quorums for dynamic systems. Distributed Computing\u00a018(2), 113\u2013124 (2005)","journal-title":"Distributed Computing"},{"issue":"SI","key":"6_CR4","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1145\/844128.844142","volume":"36","author":"S. Madden","year":"2002","unstructured":"Madden, S., Franklin, M., Hellerstein, J., Hong, W.: TAG: a Tiny AGgregation service for ad-hoc sensor networks. ACM SIGOPS Operating Systems Review\u00a036(SI), 131\u2013146 (2002)","journal-title":"ACM SIGOPS Operating Systems Review"},{"issue":"1","key":"6_CR5","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1145\/1052812.1052813","volume":"35","author":"J. Li","year":"2005","unstructured":"Li, J., Sollins, K., Lim, D.: Implementing aggregation and broadcast over distributed hash tables. ACM SIGCOMM Computer Communication Review\u00a035(1), 81\u201392 (2005)","journal-title":"ACM SIGCOMM Computer Communication Review"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"Birk, Y., Keidar, I., Liss, L., Schuster, A., Wolff, R.: Veracity radius: capturing the locality of distributed computations. In: PODC 2006: Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing (July 2006)","DOI":"10.1145\/1146381.1146399"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"Kempe, D., Dobra, A., Gehrke, J.: Gossip-based computation of aggregate information. In: Proceedings. 44th Annual IEEE Symposium on Foundations of Computer Science, pp. 482\u2013491 (2003)","DOI":"10.1109\/SFCS.2003.1238221"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Jelasity, M., Montresor, A., Babaoglu, O.: Gossip-based aggregation in large dynamic networks. In: ACM Transactions on Computer Systems, TOCS (2005)","DOI":"10.1145\/1082469.1082470"},{"issue":"9","key":"6_CR9","doi-asserted-by":"publisher","first-page":"987","DOI":"10.1109\/TPDS.2006.128","volume":"17","author":"J.-Y. Chen","year":"2006","unstructured":"Chen, J.-Y., Pandurangan, G., Xu, D.: Robust computation of aggregates in wireless sensor networks: Distributed randomized algorithms and analysis. IEEE Transactions on Parallel and Distributed Systems\u00a017(9), 987\u20131000 (2006)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Wuhib, F., Dam, M., Stadler, R., Clemm, A.: Robust monitoring of network-wide aggregates through gossiping. In: 10th IFIP\/IEEE International Symposium on Integrated Network Management, pp. 226\u2013235 (2007)","DOI":"10.1109\/INM.2007.374787"},{"key":"6_CR11","volume-title":"International Conference on Autonomic and Autonomous Systems (ICAS)","author":"C. Baquero","year":"2009","unstructured":"Baquero, C., Almeida, P.S., Menezes, R.: Fast estimation of aggregates in unstructured networks. In: International Conference on Autonomic and Autonomous Systems (ICAS), Valencia, Spain. IEEE Computer Society, Los Alamitos (2009)"},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"Mosk-Aoyama, D., Shah, D.: Computing separable functions via gossip. In: PODC 2006: Proceedings of the twenty-fifth annual ACM symposium on Principles of Distributed Computing, pp. 113\u2013122 (2006)","DOI":"10.1145\/1146381.1146401"},{"key":"6_CR13","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 (2005)","DOI":"10.1109\/NCA.2005.15"},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"Massouli\u00e9, L., Merrer, E., Kermarrec, A.-M., Ganesh, A.: Peer counting and sampling in overlay networks: random walk methods. In: PODC 2006: Proceedings of the twenty-fifth annual ACM symposium on Principles of Distributed Computing (July 2006)","DOI":"10.1145\/1146381.1146402"},{"issue":"4","key":"6_CR15","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/s00446-007-0027-z","volume":"20","author":"A. Ganesh","year":"2007","unstructured":"Ganesh, A., Kermarrec, A., Le Merrer, E., Massouli\u00e9, L.: Peer counting and sampling in overlay networks based on random walks. Distributed Computing\u00a020(4), 267\u2013278 (2007)","journal-title":"Distributed Computing"},{"key":"6_CR16","doi-asserted-by":"crossref","unstructured":"Jelasity, M., Montresor, A.: Epidemic-style proactive aggregation in large overlay networks. In: 24th International Conference on Distributed Computing Systems (2004)","DOI":"10.1109\/ICDCS.2004.1281573"},{"key":"6_CR17","volume-title":"Distributed Algorithms","author":"N.A. Lynch","year":"1996","unstructured":"Lynch, N.A.: Distributed Algorithms. Morgan Kaufmann Publishers Inc., San Francisco (1996)"},{"key":"6_CR18","series-title":"Graduate Texts in Mathematics","volume-title":"Graph Theory","author":"R. Diestel","year":"2005","unstructured":"Diestel, R.: Graph Theory, 3rd edn. Graduate Texts in Mathematics, vol.\u00a0173. Springer, Heidelberg (2005)","edition":"3"},{"key":"6_CR19","first-page":"17","volume":"5","author":"P. Erd\u0151s","year":"1960","unstructured":"Erd\u0151s, P., R\u00e9nyi, A.: On the evolution of random graphs. Publications of the Mathematical Institute of the Hungarian Academy of Sciences\u00a05, 17\u201361 (1960)","journal-title":"Publications of the Mathematical Institute of the Hungarian Academy of Sciences"},{"key":"6_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/978-3-540-45172-3_9","volume-title":"Peer-to-Peer Systems II","author":"M.F. Kaashoek","year":"2003","unstructured":"Kaashoek, M.F., Karger, D.R.: Koorde: A simple degree-optimal distributed hash table. In: Kaashoek, M.F., Stoica, I. (eds.) IPTPS 2003. LNCS, vol.\u00a02735, pp. 98\u2013107. Springer, Heidelberg (2003)"}],"container-title":["Lecture Notes in Computer Science","Distributed Applications and Interoperable Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02164-0_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,8]],"date-time":"2019-03-08T09:12:35Z","timestamp":1552036355000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02164-0_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642021633","9783642021640"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02164-0_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}