Font Size: a A A

Trust-Based Super-Node Selection And Search Strategy

Posted on:2011-10-07Degree:MasterType:Thesis
Country:ChinaCandidate:X Y DingFull Text:PDF
GTID:2178360302994587Subject:Computer application technology
Abstract/Summary:PDF Full Text Request
In recent years, P2P technology has been seen as one of the most popular computer technology in twenty-one century. With the network technology advances and power of PCs enhances, the computing pattern of Internet is transforming from C/S to P2P. The anonymity and self-organization characteristic etc of P2P network determine that it can not guarantee that all the nodes are honest, and have good service and reliable resource. Some nodes even provide malicious services. Therefore, in P2P network environment of facing a large number of dynamic anonymous users, how to avoid these malicious nodes in the resource search process, to ensure to provide reliable service, and to improve search efficiency is one of the most key problems in P2P technology.This paper combined with trust ideal, based on study of the existing P2P resource search algorithm, for these issues above, make better a super-peer network structure and search algorithm based on trust. The model, according to the capacity of the node, stability and trust value, selectes super-node and improves system stability.Firstly, the paper that simulates the human society, through the services trust and feedback trust, evaluates the node, so that the node can get reliable resources and services. The service trust that is the evaluation of service nodes could show the service reliability of service nodes. The feedback trust that is evaluation of evaluation nodes could show the evaluation authenticity of evaluation nodes.Secondly, integrated the history hit rate of the node and trust with the search process of P2P resources, it can direct the query routing efficiently. Forwarding node sends the query messages to the area where there could be the requested resources to improve the search efficiency, according to the trust value and historical hit rate neighbor nodes. At the same time, the system will search out of honest nodes and provide steady reliable service.Finally, NS2-based simulation experiments compare on the Gnutella environment Flooding algorithm and trust-based search strategy.The simulation experiments were compare in three areas of hit rate, the proportion of honest nodes, and broadband utilization.
Keywords/Search Tags:P2P, Trust, Serviec trust, Feedback trust, History hit rate, Search strategy
PDF Full Text Request
Related items