{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,18]],"date-time":"2026-04-18T15:47:54Z","timestamp":1776527274288,"version":"3.51.2"},"publisher-location":"New York, NY, USA","reference-count":43,"publisher":"ACM","license":[{"start":{"date-parts":[[2006,10,25]],"date-time":"2006-10-25T00:00:00Z","timestamp":1161734400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2006,10,25]]},"DOI":"10.1145\/1177080.1177084","type":"proceedings-article","created":{"date-parts":[[2007,1,17]],"date-time":"2007-01-17T01:15:56Z","timestamp":1168996556000},"page":"27-40","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":47,"title":["On unbiased sampling for unstructured peer-to-peer networks"],"prefix":"10.1145","author":[{"given":"Daniel","family":"Stutzbach","sequence":"first","affiliation":[{"name":"University of Oregon"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Reza","family":"Rejaie","sequence":"additional","affiliation":[{"name":"University of Oregon"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nick","family":"Duffield","sequence":"additional","affiliation":[{"name":"AT&T Labs - Research"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Subhabrata","family":"Sen","sequence":"additional","affiliation":[{"name":"AT&T Labs - Research"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Walter","family":"Willinger","sequence":"additional","affiliation":[{"name":"AT&T Labs - Research"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2006,10,25]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060693"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/HICSS.2006.126"},{"key":"e_1_3_2_1_3_1","volume-title":"International Conference on Very Large Databases","author":"Bar-Yossef Z.","year":"2000","unstructured":"Z. Bar-Yossef , A. Berg , S. Chien , J. Fakcharoenphol , and D. Weitz . Approximating Aggregate Queries about Web Pages via Random Walks . In International Conference on Very Large Databases , 2000 . Z. Bar-Yossef, A. Berg, S. Chien, J. Fakcharoenphol, and D. Weitz. Approximating Aggregate Queries about Web Pages via Random Walks. In International Conference on Very Large Databases, 2000."},{"key":"e_1_3_2_1_4_1","volume-title":"Understanding Availability. In International Workshop on Peer-to-Peer Systems","author":"Bhagwan R.","year":"2003","unstructured":"R. Bhagwan , S. Savage , and G. Voelker . Understanding Availability. In International Workshop on Peer-to-Peer Systems , 2003 . R. Bhagwan, S. Savage, and G. Voelker. Understanding Availability. In International Workshop on Peer-to-Peer Systems, 2003."},{"key":"e_1_3_2_1_5_1","first-page":"1","author":"Bollob\u00e1s B.","year":"1980","unstructured":"B. Bollob\u00e1s . A probabilistic proof of an asymptotic formula for the number of labelled regular graphs. European Journal of Combinatorics , 1 , 1980 . B. Bollob\u00e1s. A probabilistic proof of an asymptotic formula for the number of labelled regular graphs. European Journal of Combinatorics, 1, 1980.","journal-title":"European Journal of Combinatorics"},{"key":"e_1_3_2_1_6_1","volume-title":"International Workshop on Web Content Caching and Distribution","author":"Bustamante F. E.","year":"2003","unstructured":"F. E. Bustamante and Y. Qiao . Friendships that last: Peer lifespan and its role in P2P protocols . In International Workshop on Web Content Caching and Distribution , 2003 . F. E. Bustamante and Y. Qiao. Friendships that last: Peer lifespan and its role in P2P protocols. In International Workshop on Web Content Caching and Distribution, 2003."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/863955.864000"},{"key":"e_1_3_2_1_8_1","volume-title":"Understanding the Metropolis-Hastings Algorithm. The Americian Statistician, 49(4)","author":"Chib S.","year":"1995","unstructured":"S. Chib and E. Greenberg . Understanding the Metropolis-Hastings Algorithm. The Americian Statistician, 49(4) , 1995 . S. Chib and E. Greenberg. Understanding the Metropolis-Hastings Algorithm. The Americian Statistician, 49(4), 1995."},{"key":"e_1_3_2_1_9_1","volume-title":"Symposium on Discrete Algorithms","author":"Cooper C.","year":"2005","unstructured":"C. Cooper , M. Dyer , and C. Greenhill . Sampling regular graphs and a peer-to-peer network . In Symposium on Discrete Algorithms , 2005 . C. Cooper, M. Dyer, and C. Greenhill. Sampling regular graphs and a peer-to-peer network. In Symposium on Discrete Algorithms, 2005."},{"key":"e_1_3_2_1_10_1","unstructured":"H. D\u00e4mpfling. Gnutella Web Caching System: Version 2 Specifications Client Developers' Guide. http:\/\/www.gnucleus.com\/gwebcache\/newgwc.html 2003.  H. D\u00e4mpfling. Gnutella Web Caching System: Version 2 Specifications Client Developers' Guide. http:\/\/www.gnucleus.com\/gwebcache\/newgwc.html 2003."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.peva.2005.01.002"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/945445.945475"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/637201.637203"},{"key":"e_1_3_2_1_14_1","first-page":"57","year":"1970","unstructured":"W. Hastings. Monte Carlo Sampling Methods Using Markov Chains and Their Applications. Biometrika , 57 , 1970 . W. Hastings. Monte Carlo Sampling Methods Using Markov Chains and Their Applications. Biometrika, 57, 1970.","journal-title":"W. Hastings. Monte Carlo Sampling Methods Using Markov Chains and Their Applications. Biometrika"},{"key":"e_1_3_2_1_15_1","volume-title":"On Near-Uniform URL Sampling. In International World Wide Web Conference","author":"Henzinger M.","year":"2001","unstructured":"M. Henzinger , A. Heydon , M. Mitzenmacher , and M. Najork . On Near-Uniform URL Sampling. In International World Wide Web Conference , 2001 . M. Henzinger, A. Heydon, M. Mitzenmacher, and M. Najork. On Near-Uniform URL Sampling. In International World Wide Web Conference, 2001."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24668-8_1"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(90)90164-D"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24668-8_3"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/11422778_27"},{"key":"e_1_3_2_1_20_1","volume-title":"International Conference on Internet Computing","author":"Krishnamurthy V.","year":"2003","unstructured":"V. Krishnamurthy , J. Sun , M. Faloutsos , and S. Tauro . Sampling Internet Topologies: How Small Can We Go ? In International Conference on Internet Computing , 2003 . V. Krishnamurthy, J. Sun, M. Faloutsos, and S. Tauro. Sampling Internet Topologies: How Small Can We Go? In International Conference on Internet Computing, 2003."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2003.1208685"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1064212.1064217"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1081870.1081893"},{"key":"e_1_3_2_1_24_1","volume-title":"INFOCOM","author":"Li J.","year":"2005","unstructured":"J. Li , J. Stribling , F. Kaashoek , R. Morris , and T. Gil . A Performance vs. Cost Framework for Evaluating DHT Design Tradeoffs under Churn . In INFOCOM , 2005 . J. Li, J. Stribling, F. Kaashoek, R. Morris, and T. Gil. A Performance vs. Cost Framework for Evaluating DHT Design Tradeoffs under Churn. In INFOCOM, 2005."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/571825.571863"},{"key":"e_1_3_2_1_26_1","first-page":"2","author":"Lov\u00e1sz L.","year":"1993","unstructured":"L. Lov\u00e1sz . Random walks on graphs: A survey. Combinatorics: Paul Erd\u00f6s is Eighty , 2 , 1993 . L. Lov\u00e1sz. Random walks on graphs: A survey. Combinatorics: Paul Erd\u00f6s is Eighty, 2, 1993.","journal-title":"Eighty"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/514191.514206"},{"key":"e_1_3_2_1_28_1","first-page":"21","author":"Metropolis N.","year":"1953","unstructured":"N. Metropolis , A. Rosenbluth , M. Rosenbluth , A. Teller , and E. Teller . Equations of State Calculations by Fast Computing Machines. Journal of Chemical Physics , 21 , 1953 . N. Metropolis, A. Rosenbluth, M. Rosenbluth, A. Teller, and E. Teller. Equations of State Calculations by Fast Computing Machines. Journal of Chemical Physics, 21, 1953.","journal-title":"Journal of Chemical Physics"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/11558989_19"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/383059.383072"},{"key":"e_1_3_2_1_31_1","volume-title":"USENIX","author":"Rhea S.","year":"2004","unstructured":"S. Rhea , D. Geels , and J. Kubiatowicz . Handling Churn in a DHT . In USENIX , 2004 . S. Rhea, D. Geels, and J. Kubiatowicz. Handling Churn in a DHT. In USENIX, 2004."},{"key":"e_1_3_2_1_32_1","volume-title":"AAAI Fall Symposium on Using Uncertainty Within Computation","author":"Rusmevichientong P.","year":"2001","unstructured":"P. Rusmevichientong , D. M. Pennock , S. Lawrence , and C. L. Giles . Methods for Sampling Pages Uniformly from the World Wide Web . In AAAI Fall Symposium on Using Uncertainty Within Computation , 2001 . P. Rusmevichientong, D. M. Pennock, S. Lawrence, and C. L. Giles. Methods for Sampling Pages Uniformly from the World Wide Web. In AAAI Fall Symposium on Using Uncertainty Within Computation, 2001."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00530-003-0088-1"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2004.826277"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2002.808407"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0501179102"},{"key":"e_1_3_2_1_37_1","volume-title":"Capturing Accurate Snapshots of the Gnutella Network. In Global Internet Symposium","author":"Stutzbach D.","year":"2005","unstructured":"D. Stutzbach and R. Rejaie . Capturing Accurate Snapshots of the Gnutella Network. In Global Internet Symposium , 2005 . D. Stutzbach and R. Rejaie. Capturing Accurate Snapshots of the Gnutella Network. In Global Internet Symposium, 2005."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2006.329"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/1177080.1177105"},{"key":"e_1_3_2_1_40_1","volume-title":"Dynamic Graphs. In Global Internet Symposium","author":"Stutzbach D.","year":"2006","unstructured":"D. Stutzbach , R. Rejaie , N. Duffield , S. Sen , and W. Willinger . Sampling Techniques for Large , Dynamic Graphs. In Global Internet Symposium , 2006 . D. Stutzbach, R. Rejaie, N. Duffield, S. Sen, and W. Willinger. Sampling Techniques for Large, Dynamic Graphs. In Global Internet Symposium, 2006."},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.5555\/1251086.1251091"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.24.2.383"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2006.180"}],"event":{"name":"IMC06: Internet Measurement Conference","location":"Rio de Janeriro Brazil","acronym":"IMC06","sponsor":["SIGCOMM ACM Special Interest Group on Data Communication","ACM Association for Computing Machinery"]},"container-title":["Proceedings of the 6th ACM SIGCOMM conference on Internet measurement"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1177080.1177084","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1177080.1177084","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T14:51:38Z","timestamp":1750258298000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1177080.1177084"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,10,25]]},"references-count":43,"alternative-id":["10.1145\/1177080.1177084","10.1145\/1177080"],"URL":"https:\/\/doi.org\/10.1145\/1177080.1177084","relation":{},"subject":[],"published":{"date-parts":[[2006,10,25]]},"assertion":[{"value":"2006-10-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}