On Unbiased Sampling for Unstructured Peer-to-Peer Networks

被引:106
作者
Stutzbach, Daniel [1 ]
Rejaie, Reza [2 ]
Duffield, Nick [3 ]
Sen, Subhabrata [3 ]
Willinger, Walter [3 ]
机构
[1] Stutzbach Enterprises LLC, Dallas, TX 75206 USA
[2] Univ Oregon, Dept Comp Sci, Eugene, OR 97403 USA
[3] AT&T Labs Res, Florham Pk, NJ 07932 USA
基金
美国国家科学基金会;
关键词
Peer-to-peer; sampling;
D O I
10.1109/TNET.2008.2001730
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
This paper presents a detailed examination of how the dynamic and heterogeneous nature of real-world peer-to-peer systems can introduce bias into the selection of representative samples of peer properties (e.g., degree, link bandwidth, number of files shared). We propose the Metropolized Random Walk with Backtracking (MRWB) as a viable and promising technique for collecting nearly unbiased samples and conduct an extensive simulation study to demonstrate that our technique works well for a wide variety of commonly-encountered peer-to-peer network conditions. We have implemented the MRWB algorithm for selecting peer addresses uniformly at random into a tool called ion-sampler. Using the Gnutella network, we empirically show that ion-sampler yields more accurate samples than tools that rely on commonly-used sampling techniques and results in dramatic improvements in efficiency and scalability compared to performing a full crawl.
引用
收藏
页码:377 / 390
页数:14
相关论文
共 51 条
  • [1] ACHLIOPTAS D, 2005, 2005 S THEOR COMP BA
  • [2] [Anonymous], P AAAI FALL S US UNC
  • [3] AWAN A, 2006, 2006 HAW INT C SYST
  • [4] BARYOSSEF Z, 2006 WWW C ED SCOTL
  • [5] BHAGWAN R, 2003 INT WORKSH PEER
  • [6] Bollobas B., 1980, Eur. J. Comb., V1, DOI [10.1016/S0195-6698(80)80030-8, DOI 10.1016/S0195-6698(80)80030-8]
  • [7] Bonato Anthony., 2004, CAAN COMBINATORIAL A, P159
  • [8] BUSTAMANTE FE, 2003, P INT WORKSH WEB CON, P2
  • [9] CHAWATHE Y, ACM SIGCOMM 2003 KAR
  • [10] UNDERSTANDING THE METROPOLIS-HASTINGS ALGORITHM
    CHIB, S
    GREENBERG, E
    [J]. AMERICAN STATISTICIAN, 1995, 49 (04) : 327 - 335