{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T03:32:34Z","timestamp":1761708754881},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642300530"},{"type":"electronic","value":"9783642300547"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-30054-7_32","type":"book-chapter","created":{"date-parts":[[2012,5,15]],"date-time":"2012-05-15T06:42:55Z","timestamp":1337064175000},"page":"404-417","source":"Crossref","is-referenced-by-count":8,"title":["Gossip-Based Counting in Dynamic Networks"],"prefix":"10.1007","author":[{"given":"Ruud","family":"van de Bovenkamp","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fernando","family":"Kuipers","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Piet","family":"Van Mieghem","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"32_CR1","doi-asserted-by":"crossref","unstructured":"Demers, A., Greene, D., Hauser, C., Irish, W., Larson, J., Shenker, S., Sturgis, H., Swinehart, D., Terry, D.: Epidemic algorithms for replicated database maintenance. In: Proc. of the 6th Annual ACM Symp. on Principles of Distributed Computing, pp. 1\u201312 (1987)","DOI":"10.1145\/41840.41841"},{"key":"32_CR2","unstructured":"Le Merrer, E., Kermarrec, A.M., Massoulie, L.: Peer to peer size estimation in large and dynamic networks: A comparative study. In: Proc. of the 15th IEEE Int. High Performance Distributed Computing Symp., pp. 7\u201317 (2006)"},{"key":"32_CR3","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: Proc. of the 4th IEEE Int. Network Computing and Applications Symp., pp. 41\u201348 (2005)","DOI":"10.1109\/NCA.2005.15"},{"key":"32_CR4","doi-asserted-by":"crossref","unstructured":"Massouli\u00e9, L., Le Merrer, E., Kermarrec, A.M., Ganesh, A.: Peer counting and sampling in overlay networks: random walk methods. In: Proc. of the 25th annual ACM Symp. on Principles of Distributed Computing, pp. 123\u2013132 (2006)","DOI":"10.1145\/1146381.1146402"},{"key":"32_CR5","doi-asserted-by":"crossref","unstructured":"Montresor, A., Ghodsi, A.: Towards robust peer counting. In: Proc. of the 9th IEEE Int. Conf. on Peer-to-Peer Computing, pp. 143\u2013146 (2009)","DOI":"10.1109\/P2P.2009.5284525"},{"key":"32_CR6","doi-asserted-by":"crossref","unstructured":"Jelasity, M., Montresor, A.: Epidemic-style proactive aggregation in large overlay networks. In: Proc. of the 24th Int. Distributed Computing Systems Conf., pp. 102\u2013109 (2004)","DOI":"10.1109\/ICDCS.2004.1281573"},{"key":"32_CR7","unstructured":"Kempe, D., Dobra, A., Gehrke, J.: Gossip-based computation of aggregate information. In: Proc. of the 44th IEEE Symp. on Foundations of Computer Science, pp. 482\u2013491 (2003)"},{"key":"32_CR8","doi-asserted-by":"publisher","first-page":"1472","DOI":"10.1016\/j.comcom.2010.01.019","volume":"33","author":"A. Guerrieri","year":"2010","unstructured":"Guerrieri, A., Carreras, I., De Pellegrini, F., Miorandi, D., Montresor, A.: Distributed estimation of global parameters in delay-tolerant networks. Computer Communications\u00a033, 1472\u20131482 (2010)","journal-title":"Computer Communications"},{"key":"32_CR9","unstructured":"Giakkoupis, G.: Tight bounds for rumor spreading in graphs of a given conductance. In: Proc. of the 28th Symp. on Theoretical Aspects of Computer Science, pp. 57\u201368 (2011)"},{"issue":"3","key":"32_CR10","doi-asserted-by":"publisher","first-page":"36113","DOI":"10.1103\/PhysRevE.71.036113","volume":"71","author":"V. Batagelj","year":"2005","unstructured":"Batagelj, V., Brandes, U.: Efficient generation of large random networks. Phys. Rev. E\u00a071(3), 036113 (2005)","journal-title":"Phys. Rev. E"},{"key":"32_CR11","unstructured":"Van Mieghem, P., Hooghiemstra, G., van der Hofstad, R.: A scaling law for the hopcount in internet. Technical report. Delft University of Technology (2000)"},{"issue":"5920","key":"32_CR12","doi-asserted-by":"publisher","first-page":"1453","DOI":"10.1126\/science.1167782","volume":"323","author":"D. Achlioptas","year":"2009","unstructured":"Achlioptas, D., D\u2019Souza, R.M., Spencer, J.: Explosive percolation in random networks. Science\u00a0323(5920), 1453\u20131455 (2009)","journal-title":"Science"}],"container-title":["Lecture Notes in Computer Science","NETWORKING 2012"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-30054-7_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T07:02:46Z","timestamp":1556780566000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-30054-7_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642300530","9783642300547"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-30054-7_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}