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
相关论文
共 50 条
  • [1] Search in unstructured peer-to-peer networks
    Jia, ZQ
    Tang, XH
    You, JY
    Li, ML
    WEB INFORMATION SYSTEMS - WISE 2004, PROCEEDINGS, 2004, 3306 : 694 - 705
  • [2] Structuring unstructured peer-to-peer networks
    Schmid, Stefan
    Wattenhofer, Roger
    HIGH PERFORMANCE COMPUTING - HIPC 2007, PROCEEDINGS, 2007, 4873 : 432 - 442
  • [3] ON COVERAGE BOUNDS OF UNSTRUCTURED PEER-TO-PEER NETWORKS
    Chandra, Joydeep
    Ganguly, Niloy
    ADVANCES IN COMPLEX SYSTEMS, 2011, 14 (04): : 611 - 633
  • [4] Replication strategies in unstructured peer-to-peer networks
    Cohen, E
    Shenker, S
    ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2002, 32 (04) : 177 - 190
  • [5] Efficient search in unstructured peer-to-peer networks
    Cholvi, V
    Felber, P
    Biersack, E
    EUROPEAN TRANSACTIONS ON TELECOMMUNICATIONS, 2004, 15 (06): : 535 - 548
  • [6] Broadcasting in unstructured peer-to-peer overlay networks
    Annexstein, FS
    Berman, KA
    Jovanovic, MA
    THEORETICAL COMPUTER SCIENCE, 2006, 355 (01) : 25 - 36
  • [7] Exploiting semantics in unstructured peer-to-peer networks
    Nakauchi, K
    Ishikawa, Y
    Morikawa, H
    Aoyama, T
    IEICE TRANSACTIONS ON COMMUNICATIONS, 2004, E87B (07) : 1806 - 1817
  • [8] Dynamic Search Algorithm in Unstructured Peer-to-Peer Networks
    Lin, Tsungnan
    Lin, Pochiang
    Wang, Hsinping
    Chen, Chiahung
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2009, 20 (05) : 654 - 666
  • [9] Improving Query Mechanisms for Unstructured Peer-to-Peer Networks
    Fang, Guangwei
    Zheng, Xiao
    COMMUNICATIONS AND NETWORKING IN CHINA, 2009, 26 : 60 - +
  • [10] Hybrid search schemes for unstructured peer-to-peer networks
    Gkantsidis, C
    Mihail, N
    Saberi, A
    IEEE INFOCOM 2005: THE CONFERENCE ON COMPUTER COMMUNICATIONS, VOLS 1-4, PROCEEDINGS, 2005, : 1526 - 1537