• 中国精品科技期刊
  • CCF推荐A类中文期刊
  • 计算领域高质量科技期刊T1类
Advanced Search
Guo Leitao, Yang Shoubao, Wang Jing, and Zhou Jinyang. A Distributed Trust Model Based on Vector Space in P2P Networks[J]. Journal of Computer Research and Development, 2006, 43(9): 1564-1570.
Citation: Guo Leitao, Yang Shoubao, Wang Jing, and Zhou Jinyang. A Distributed Trust Model Based on Vector Space in P2P Networks[J]. Journal of Computer Research and Development, 2006, 43(9): 1564-1570.

A Distributed Trust Model Based on Vector Space in P2P Networks

More Information
  • Published Date: September 14, 2006
  • Peers in P2P networks share resources voluntarily. They may arbitrarily terminate services, and some peers may provide fake services, so the QoS of services are not reliable. Moreover, peers are self-interest and rationality. Some peers always abuse resources but seldom contribute their own resources, which induces the free-riding in P2P networks. Traditional security schemes can hardly solve the fake services providing and free-ridings in P2P networks. The trust model based on reputation can restrain these kinds of malicious behaviors. However, it suffers much from strategically altering behaviors and dishonest feedbacks from malicious peers. Recurring to the trust model of society network, a distributed trust model based on vector space is proposed. This trust model uses ‘time-sensitive factor’ to improve the sensitiveness of detecting peers' behaviors, and recommendation trust based on vector space model to prevent collusion and bad-mouthing among peers. Furthermore, a distributed implementation schema based on R-Chain is proposed. Simulation and analysis show that this trust model is effective and has favorable feasibility of implementation.
  • Related Articles

    [1]Zheng Wenping, Wu Zhikang, Yang Gui. A Novel Algorithm for Identifying Critical Nodes in Networks Based on Local Centrality[J]. Journal of Computer Research and Development, 2019, 56(9): 1872-1880. DOI: 10.7544/issn1000-1239.2019.20180831
    [2]Liu Haolin, Chi Jinlong, Deng Qingyong, Peng Xin, Pei Tingrui. Multi-Objective Evolutionary Sparse Recovery Approach Based on Adaptive Local Search[J]. Journal of Computer Research and Development, 2019, 56(7): 1420-1431. DOI: 10.7544/issn1000-1239.2019.20180557
    [3]Xu Zhengguo, Zheng Hui, He Liang, Yao Jiaqi. Self-Adaptive Clustering Based on Local Density by Descending Search[J]. Journal of Computer Research and Development, 2016, 53(8): 1719-1728. DOI: 10.7544/issn1000-1239.2016.20160136
    [4]Li Guilin, Yang Yuqi, Gao Xing, and Liao Minghong. Personalized Representation and Rank Algorithm for Enterprise Search Engines[J]. Journal of Computer Research and Development, 2014, 51(1): 206-214.
    [5]Li Shaohua, Feng Qilong, Wang Jianxin, and Chen Jianer. Kernelization for Weighted 3-Set Packing Problem[J]. Journal of Computer Research and Development, 2012, 49(8): 17811-786.
    [6]Li Wenjun, Wang Jianxin, and Chen Jianer. An Improved Parameterized Algorithm for Hyperplane-Cover Problem[J]. Journal of Computer Research and Development, 2012, 49(4): 804-811.
    [7]Wang Chuyang, Li Xiaoping, Wang Qian, Yuan Yingchun. A New Local Search Algorithm for No-Wait Fowshops with Setup Time[J]. Journal of Computer Research and Development, 2010, 47(4): 653-662.
    [8]Zhang Peng. Approximation Algorithms for Generalized Multicut in Trees[J]. Journal of Computer Research and Development, 2008, 45(7): 1195-1202.
    [9]Zeng Liping and Huang Wenqi. A New Local Search Algorithm for the Job Shop Scheduling Problem[J]. Journal of Computer Research and Development, 2005, 42(4): 582-587.
    [10]Yang Jinji, Su Kaile. Improvement of Local Research in SAT Problem[J]. Journal of Computer Research and Development, 2005, 42(1): 60-65.

Catalog

    Article views (559) PDF downloads (664) Cited by()

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return