Respondent-driven sampling for characterizing unstructured overlays

Proceedings - IEEE INFOCOM

Volumn , Issue , 2009, Pages 2701-2705

  Rasti, Amir H ^a   Torkjazi, Mojtaba ^a   Rejaie, Reza ^a   Duffield, Nick ^b   Willinger, Walter ^b   Stutzbach, Daniel ^c  

^a UNIVERSITY OF OREGON   (United States)

^b AT AND T LABS RESEARCH   (United States)

^c Stutzbach Enterprises ^*

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTERING COEFFICIENT; CONNECTIVITY STRUCTURES; GNUTELLA; GNUTELLA NETWORKS; KEY FACTORS; NODE DEGREE; OVERLAY STRUCTURES; RANDOM WALK; SAMPLING TECHNIQUE; STATIC AND DYNAMIC; UNBIASED ESTIMATES; UNSTRUCTURED OVERLAY NETWORKS; UNSTRUCTURED OVERLAYS;

OVERLAY NETWORKS; RESPIRATORY MECHANICS;

COMPUTER SIMULATION;

EID: 70349670865     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2009.5062215     Document Type: Conference Paper

References (18)

1. A.-L. Barabási and R. Albert. Emergence of Scaling in Random Networks. Science, 286:509-512, Oct. 1999.
2. A.-L. Barabasi, Z. Dezso, E. Ravasz, S.-H. Yook, and Z. Oltvai. Scale-free and Hierarchical Structures in Complex Networks. In Seventh Granada Lectures, 2002.
3. B. Bollobás. A probabilistic Proof of an Asymptotic Formula for the Number of Labelled Regular Graphs. European Journal of Combinatorics, 1:311-316, 1980.
4. S. Chib and E. Greenberg. Understanding the Metropolis-Hastings Algorithm. The Americian Statistician, 49(4):327-335, Nov. 1995.
5. S. Goel and M. J. Sagalnik. Respondent-driven sampling as markov chain monte carlo. Manuscript, 2007.
6. K. P. Gummadi, S. Saroiu, and S. D. Gribble. King: Estimating Latency between Arbitrary Internet End Hosts. In Internet Measurement Workshop, Nov. 2002.
7. M. Hansen and W. Hurwitz. On the Theory of Sampling from Finite Populations. Annals of Mathematical Statistics, 14(4):333-362, 1943.
8. W. Hastings. Monte Carlo Sampling Methods Using Markov Chains and Their Applications. Biometrika, 57:97-109, 1970.
9. D. Heckathorn. Respondent-Driven Sampling II: Deriving Valid Population Estimates from Chain-Referral Samples of Hidden Populations. Social Problems, 49(1):11-34, 2002.
10. L. Lovász. Random walks on graphs: A survey. Combinatorics: Paul Erdös is Eighty, 2:1-46, 1993.
11. N. Metropolis, A. Rosenbluth, M. Rosenbluth, A. Teller, and E. Teller. Equations of State Calculations by Fast Computing Machines. Journal of Chemical Physics, 21:1087-1092, 1953.
12. A. Rasti, R. Rejaie, N. Duffield, D. Stutzbach, and W. Willinger. Evaluating Sampling Techniques for Large Dynamic Graphs. Technical report, University of Oregon, Mar. 2008.
13. M. Salganik and D. Heckathorn. Sampling and estimation in hidden populations using respondent-driven sampling. Sociological Methodology, 34:193-239, 2004.
14. S. Saroiu, P. K. Gummadi, and S. D. Gribble. A Measurement Study of Peer-to-Peer File Sharing Systems. In MMCN, Jan. 2002.
15. D. Stutzbach and R. Rejaie. Understanding Churn in Peer-to-Peer Networks. In Internet Measurement Conference, Oct. 2006.
16. D. Stutzbach, R. Rejaie, N. Duffield, S. Sen, and W. Willinger. On Unbiased Sampling for Unstructured Peer-to-Peer Networks. TON, 2008.
17. D. Stutzbach, R. Rejaie, and S. Sen. Characterizing Unstructured Overlay Topologies in Modern P2P File-Sharing Systems. TON, 16(2), Apr. 2008.
18. D. J. Watts. Six Degrees. In The Essence of a Connected Edge.ACM Press, 2003.