{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,10]],"date-time":"2025-11-10T13:30:35Z","timestamp":1762781435415},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2007,6,5]],"date-time":"2007-06-05T00:00:00Z","timestamp":1181001600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Distrib. Comput."],"published-print":{"date-parts":[[2007,11]]},"DOI":"10.1007\/s00446-007-0027-z","type":"journal-article","created":{"date-parts":[[2007,6,4]],"date-time":"2007-06-04T15:06:10Z","timestamp":1180969570000},"page":"267-278","source":"Crossref","is-referenced-by-count":34,"title":["Peer counting and sampling in overlay networks based on random walks"],"prefix":"10.1007","volume":"20","author":[{"given":"A. J.","family":"Ganesh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A. -M.","family":"Kermarrec","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"E.","family":"Le Merrer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L.","family":"Massouli\u00e9","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,6,5]]},"reference":[{"key":"27_CR1","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1103\/RevModPhys.74.47","volume":"74","author":"R. Albert","year":"2002","unstructured":"Albert R. and Barab\u00e1si A.-L (2002). Statistical mechanics of complex networks. Rev. Mod. Phys. 74: 47","journal-title":"Rev. Mod. Phys."},{"key":"27_CR2","unstructured":"Aldous, D., Fill, J.: Reversible markov chains and random walks on graphs. Monograph in preparation, http:\/\/stat-www.berkeley. edu\/users\/aldous\/RWG\/book.html"},{"key":"27_CR3","volume-title":"The Probabilistic Method","author":"N. Alon","year":"2002","unstructured":"Alon N. and Spencer J. (2002). The Probabilistic Method. Wiley, London"},{"key":"27_CR4","unstructured":"Alouf S., Altman E., Nain, P.: Optimal on-line estimation of the size of a dynamic multicast group. IEEE INFOCOM \u201902 (2002)"},{"key":"27_CR5","doi-asserted-by":"crossref","unstructured":"Bar-Yossef, Z., Friedman, R., Kliot, G.: Rawms\u2014random walk based lightweight membership service for wireless ad-hoc networks. In: Mobihoc. Florence, Italy (2006)","DOI":"10.1145\/1132905.1132932"},{"key":"27_CR6","unstructured":"Bawa, M., Garcia-Molina, H., Gionis, A., Motwani, R.: Estimating aggregates on a peer-to-peer network. Technical Report, Dept. of computer science, Stanford University (2003)"},{"key":"27_CR7","doi-asserted-by":"crossref","DOI":"10.1002\/9780470316962","volume-title":"Convergence of Probability Measures","author":"P. Billingsley","year":"1999","unstructured":"Billingsley P. (1999). Convergence of Probability Measures. Wiley, London"},{"key":"27_CR8","doi-asserted-by":"crossref","unstructured":"Bolot, J.-C., Turletti, T., Wakeman, I.: Scalable feedback control for multicast video distribution in the internet. ACM SIGCOMM (1994)","DOI":"10.1145\/190314.190320"},{"key":"27_CR9","unstructured":"Boyd, S., Ghosh, A., Prabhakar, B., Shah, D.: Gossip algorithms: design, analysis and applications. IEEE INFOCOM (2005)"},{"key":"27_CR10","doi-asserted-by":"crossref","unstructured":"Castro, M., Druschel, P., Ganesh, A., Rowstron, A., wallach, D.: Security for structured peer-to-peer overlay networks. OSDI (2002)","DOI":"10.1145\/1060289.1060317"},{"key":"27_CR11","doi-asserted-by":"crossref","DOI":"10.1002\/0471200611","volume-title":"Elements of Information Theory","author":"T.M. Cover","year":"1991","unstructured":"Cover T.M. and Thomas J.A. (1991). Elements of Information Theory. Wiley, London"},{"key":"27_CR12","doi-asserted-by":"crossref","unstructured":"Dolev, D., Mokryn, O., Shavitt, Y.: On multicast trees: structure and size estimation. IEEE INFOCOM (2003)","DOI":"10.1109\/INFCOM.2003.1208938"},{"key":"27_CR13","doi-asserted-by":"crossref","unstructured":"Dolev, S., Schiller, E., Welsh, J.: Random walk for self-stabilizing group communication in ad-hoc networks. PODC (2002)","DOI":"10.1145\/571865.571872"},{"key":"27_CR14","doi-asserted-by":"crossref","unstructured":"Eugster, P., Handurukande, S., Guerraoui, R., Kermarrec, A.-M., Kouznetsov, P.: Lightweight probabilistic broadcast. ACM Trans. Comput. Syst. 21(4), (2003)","DOI":"10.1145\/945506.945507"},{"key":"27_CR15","doi-asserted-by":"crossref","unstructured":"Friedman, T., Towsley, D.: Multicast session membership size estimation. IEEE INFOCOM (1999)","DOI":"10.1109\/INFCOM.1999.751487"},{"key":"27_CR16","doi-asserted-by":"crossref","unstructured":"Ganesh, A.J., Kermarrec, A.-M., Massouli\u00e9, L.: Peer-to-peer membership management for gossip-based protocols. IEEE Trans Comput. 52(2), 2003","DOI":"10.1109\/TC.2003.1176982"},{"key":"27_CR17","doi-asserted-by":"crossref","unstructured":"Ganesh, A.J., Massouli\u00e9, L., Towsley, D.: The effect of network topology on the spread of epidemics. IEEE INFOCOM (2005)","DOI":"10.1109\/INFCOM.2005.1498374"},{"key":"27_CR18","unstructured":"Ganesh, A.J., Xue, F.: Expansion properties of k-out random graphs. Preprint (2004)"},{"issue":"5","key":"27_CR19","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/j.ipl.2003.08.011","volume":"88","author":"K. Horowitz","year":"2003","unstructured":"Horowitz K. and Malkhi D (2003). Estimating network size from local information. Inf. Process. Lett. 88(5): 237\u2013243","journal-title":"Inf. Process. Lett."},{"key":"27_CR20","doi-asserted-by":"crossref","unstructured":"Jelasity, M., Montresor, A.: Epidemic-style proactive aggregation in large overlay networks. ICDCS (2004)","DOI":"10.1109\/ICDCS.2004.1281573"},{"key":"27_CR21","doi-asserted-by":"crossref","unstructured":"Jelasity M., Preu\u00df, M.: On obtaining global information in a peer-to-peer fully distributed environment, vol. 2400. LNCS. Springer, Heidelberg, pp. 573\u2013577 (2002)","DOI":"10.1007\/3-540-45706-2_78"},{"key":"27_CR22","doi-asserted-by":"crossref","unstructured":"Jelasity, M., Voulgaris, S., Guerraoui, R., Kermarrec, A-M., van Steen, M.: Gossip-based peer sampling (submitted) (2007)","DOI":"10.1145\/1275517.1275520"},{"key":"27_CR23","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. IEEE NCA \u201905 (2005)","DOI":"10.1109\/NCA.2005.15"},{"key":"27_CR24","doi-asserted-by":"crossref","unstructured":"Le Merrer, E., Kermarrec, A.-M., Massouli\u00e9, L.: Peer to peer size estimation in large and dynamic networks: a comparative study. In: The proceedings of HPDC-15, June (2006)","DOI":"10.1109\/HPDC.2006.1652131"},{"key":"27_CR25","unstructured":"Li, J., Lim, D.-Y.: A robust aggregation tree on distributed hash tables. MIT student oxygen workshop 2004, (2004)"},{"key":"27_CR26","volume-title":"Lectures on the Coupling Method","author":"T. Lindvall","year":"2002","unstructured":"Lindvall T. (2002). Lectures on the Coupling Method. Dover, New york"},{"key":"27_CR27","unstructured":"Linial, N., Wigderson, A.: Expander graphs and their applications. Lecture Notes, http:\/\/www.cs.huji.ac.il\/~nati\/ (2002)"},{"key":"27_CR28","doi-asserted-by":"crossref","unstructured":"Malkhi, D., Naor, M., Ratajczak, D.: Viceroy: a scalable and dynamic emulation of the butterfly. In: Proceedings of principles of distributed computing (PODC 2002), (2002)","DOI":"10.1145\/571825.571857"},{"key":"27_CR29","doi-asserted-by":"crossref","unstructured":"Manku, G.S.: Routing networks for distributed hash tables. PODC (2003)","DOI":"10.1145\/872035.872054"},{"key":"27_CR30","doi-asserted-by":"crossref","unstructured":"Massouli\u00e9, L., Le Merrer, E., Kermarrec, A.-M., Ganesh, A.J.: Peer counting and sampling in overlay networks: random walk methods. PODC (2006)","DOI":"10.1145\/1146381.1146402"},{"key":"27_CR31","doi-asserted-by":"crossref","unstructured":"Mohar, B.: Some applications of laplace eigenvalues of graphs, in graph symmetry: algebric methods and applications. In: Hahn, G., Sabidussi, G.(eds.) NATO ASI Series C, vol. 497. Kluwer, Dordrecht, pp. 225-275 (1997)","DOI":"10.1007\/978-94-015-8937-6_6"},{"key":"27_CR32","doi-asserted-by":"crossref","unstructured":"Mosk-Aoyama, D., Shah, D.: Computing separable functions via gossip. ACM PODC (2006)","DOI":"10.1145\/1146381.1146401"},{"key":"27_CR33","unstructured":"Nonnenmacher, J., Biersack, E.W.: Optimal multicast feedback. IEEE INFOCOMM \u201998 (1998)"},{"key":"27_CR34","doi-asserted-by":"crossref","unstructured":"Ntarmos, N., Triantafillou, P., Weikum, G.: Counting at large: efficient cardinality estimation in internet-scale data networks. Proc. ICDE \u201906 (2006)","DOI":"10.1109\/ICDE.2006.44"},{"key":"27_CR35","unstructured":"http:\/\/www.peersim.sourceforge.net"},{"key":"27_CR36","doi-asserted-by":"crossref","unstructured":"Psaltoulis, D., Kostoulas, D., Gupta, I., Birman, K., Demers, A.: Practical algorithms for size estimation in large and dynamic groups. PODC (2004)","DOI":"10.1109\/NCA.2005.15"},{"key":"27_CR37","volume-title":"Simulation","author":"S. Ross","year":"2001","unstructured":"Ross S. (2001). Simulation. Elsevier, Amsterdam"},{"key":"27_CR38","unstructured":"Zhang, X., Liu, J., Li, B., Yum, T.-S.P.: Donet\/coolstreaming: A data-driven overlay network for live media streaming. IEEE INFOCOM (2005)"}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-007-0027-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00446-007-0027-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-007-0027-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T13:26:36Z","timestamp":1559136396000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00446-007-0027-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,6,5]]},"references-count":38,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2007,11]]}},"alternative-id":["27"],"URL":"https:\/\/doi.org\/10.1007\/s00446-007-0027-z","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"value":"0178-2770","type":"print"},{"value":"1432-0452","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,6,5]]}}}