Identification of Malicious Nodes in Peer-to-Peer Streaming: A Belief Propagation-Based Technique

被引:20
作者
Gaeta, Rossano [1 ]
Grangetto, Marco [1 ]
机构
[1] Univ Turin, Dipartimento Informat, I-10149 Turin, Italy
关键词
Peer-to-peer; pollution attack; malicious node identification; streaming; belief propagation; statistical inference; PlanetLab; POLLUTION; ALGORITHM;
D O I
10.1109/TPDS.2012.342
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Peer-to-peer streaming has witnessed a great success thanks to the possibility of aggregating resources from all participants. Nevertheless, performance of the entire system may be highly degraded due to the presence of malicious peers that share bogus data on purpose. In this paper, we propose to use a statistical inference technique, namely, belief propagation (BP), to estimate the probability of peers being malicious. The detection algorithm is run by a set of trusted monitor nodes that receives notification messages (checks) from peers whenever they obtain a chunk of data; these checks contain the list of the chunk uploaders and a flag to mark the chunk as polluted or clean. Peers are able to detect if the received chunk is polluted or not but, since multiparty download is employed, they are not capable to identify the source(s) of bogus blocks. This problem definition allows us to define a factor graph of peers and checks on which an incremental version of the belief propagation algorithm is run by the monitor nodes to infer the probability of each peer being a malicious one. We evaluate the accuracy, robustness, and complexity of our technique by running a real peer-to-peer application on PlanetLab. We show that the proposed approach is very accurate and robust against malicious nodes misbehaving (different pollution intensity, presence of fake checks, churning, and total uncooperation from malicious nodes), increasing number and colluding behavior of malicious nodes.
引用
收藏
页码:1994 / 2003
页数:10
相关论文
共 29 条
  • [1] [Anonymous], P IEEE S SEC PRIV
  • [2] [Anonymous], 1963, Low-Density Parity-Check Codes
  • [3] [Anonymous], P IEEE INFOCOM
  • [4] [Anonymous], P 40 ANN C INF SCI S
  • [5] [Anonymous], 2010, P 8 CHINESE MED CONS
  • [6] On the Fly Gaussian Elimination for LT Codes
    Bioglio, Valerio
    Grangetto, Marco
    Gaeta, Rossano
    Sereno, Matteo
    [J]. IEEE COMMUNICATIONS LETTERS, 2009, 13 (12) : 953 - 955
  • [7] Dhungel P., 2007, P2P TV PROC WORKSHOP, P323
  • [8] Learning low-level vision
    Freeman, WT
    Pasztor, EC
    Carmichael, OT
    [J]. INTERNATIONAL JOURNAL OF COMPUTER VISION, 2000, 40 (01) : 25 - 47
  • [9] Byzantine modification detection in multicast networks with random network coding
    Ho, Tracey
    Leong, Ben
    Koetter, Ralf
    Medard, Muriel
    Effros, Michelle
    Karger, David R.
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2008, 54 (06) : 2798 - 2803
  • [10] Huang Gale., 2007, P ACM SIGCOMM WORKSH