Exploring probabilistic follow relationship to prevent collusive peer-to-peer piracy

被引:0
|
作者
Wenjia Niu
Endong Tong
Qian Li
Gang Li
Xuemin Wen
Jianlong Tan
Li Guo
机构
[1] Chinese Academy of Science,Institute of Information Engineering
[2] Chinese Academy of Sciences,Institute of Microelectronics
[3] Deakin University,School of Information Technology
来源
关键词
P2P piracy; Behavior; Time constraint; Content feedback; Bloom filter;
D O I
暂无
中图分类号
学科分类号
摘要
P2P collusive piracy, where paid P2P clients share the content with unpaid clients, has drawn significant concerns in recent years. Study on the follow relationship provides an emerging track of research in capturing the followee (e.g., paid client) for the blocking of piracy spread from all his followers (e.g., unpaid clients). Unfortunately, existing research efforts on the follow relationship in online social network have largely overlooked the time constraint and the content feedback in sequential behavior analysis. Hence, how to consider these two characteristics for effective P2P collusive piracy prevention remains an open problem. In this paper, we proposed a multi-bloom filter circle to facilitate the time-constraint storage and query of P2P sequential behaviors. Then, a probabilistic follow with content feedback model to fast discover and quantify the probabilistic follow relationship is further developed, and then, the corresponding approach to piracy prevention is designed. The extensive experimental analysis demonstrates the capability of the proposed approach.
引用
收藏
页码:111 / 141
页数:30
相关论文
共 50 条
  • [31] Exploring the robustness of BitTorrent peer-to-peer content distribution systems
    Liogkas, Nikitas
    Nelson, Robert
    Kohler, Eddie
    Zhang, Lixia
    CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE, 2008, 20 (02): : 179 - 189
  • [32] Exploring Interest Correlation for Peer-to-Peer Socialized Video Sharing
    Cheng, Xu
    Liu, Jiangchuan
    ACM TRANSACTIONS ON MULTIMEDIA COMPUTING COMMUNICATIONS AND APPLICATIONS, 2012, 8 (01)
  • [33] Adaptive probabilistic search over unstructured peer-to-peer computing systems
    Zhou, Aoying
    Xu, Linhao
    Dai, Chenyun
    WORLD WIDE WEB-INTERNET AND WEB INFORMATION SYSTEMS, 2006, 9 (04): : 537 - 556
  • [34] Probabilistic replication based on access frequencies in unstructured peer-to-peer networks
    Hara, Takahiro
    Kido, Yuki
    Nishio, Shojiro
    DATABASE AND EXPERT SYSTEMS APPLICATIONS, PROCEEDINGS, 2006, 4080 : 791 - 800
  • [35] Adaptive Probabilistic Search Over Unstructured Peer-to-Peer Computing Systems
    Aoying Zhou
    Linhao Xu
    Chenyun Dai
    World Wide Web, 2006, 9 : 537 - 556
  • [36] Study of the relationship between peer-to-peer systems and IP multicasting
    Oh-ishi, T
    Sakai, K
    Kikuma, K
    Kurokawa, A
    IEEE COMMUNICATIONS MAGAZINE, 2003, 41 (01) : 80 - 84
  • [37] InfoPuzzle: Exploring Group Decision Making in Mobile Peer-to-Peer Databases
    Elmore, Aaron J.
    Das, Sudipto
    Agrawal, Divyakant
    El Abbadi, Amr
    PROCEEDINGS OF THE VLDB ENDOWMENT, 2012, 5 (12): : 1998 - 2001
  • [38] Exploring Peer-to-Peer Infrastructure for Computer Supported Collaborative Work Applications
    Wei, Tianming
    Xu, Yongjun
    Zhao, Yiyun
    Khanna, Nishant
    Gao, Bing
    Coady, Yvonne
    2015 IEEE PACIFIC RIM CONFERENCE ON COMMUNICATIONS, COMPUTERS AND SIGNAL PROCESSING (PACRIM), 2015, : 304 - 308
  • [39] Exploring large-scale peer-to-peer live streaming topologies
    Wu, Chuan
    Li, Baochun
    Zhao, Shuqiao
    ACM TRANSACTIONS ON MULTIMEDIA COMPUTING COMMUNICATIONS AND APPLICATIONS, 2008, 4 (03)
  • [40] Exploring Behavioral Patterns Through Entropy in Multimedia Peer-to-Peer Traffic
    Gomes, Joao V.
    Inacio, Pedro R. M.
    Pereira, Manuela
    Freire, Mario M.
    Monteiro, Paulo P.
    COMPUTER JOURNAL, 2012, 55 (06): : 740 - 755