Optimistic inquiry method based on reputation under Chord-like environment

Abstract

The invention provides a novel optimistic inquiry method applicable to a Chord-like environment. The method comprises the following steps of: firstly, by utilizing a manner that all nodes on a route path share the feedback of a start node, collecting feedback messages and form a training set; utilizing a Beta estimation mechanism to carry out trust measurement on a network node historical route behavior; meanwhile, aiming at a short-period online behavior of chord network nodes, determining a minimum transmitting time threshold value through setting the confidence coefficient; and ignoring a provided reputation calculation result by a system aiming to a reputation value provided by the node with the transmitting time which is smaller than the threshold value, so as to guarantee the reliability of the formed reputation value. On the aspect of a selection manner of the transmitting node, a manner of combining a greedy policy and a reputation policy is adopted; firstly, the greedy policy is used for selecting the next jump; if the inquiry is failed, a principle of reputation selection is used for gradually replacing greedy selection when starting from a source starting node; and the method can realize the reasonable multi-path route and considers both the inquiry efficiency and the inquiry success rate.

Description

technical field [0001] The invention relates to the field of P2P technology, in particular to an optimistic query method based on reputation in a Chord-like environment. Background technique [0002] Since the emergence of P2P technology, it has received widespread attention from the industry and has gradually become active in various application stages. In the P2P network, each participating entity (peer) is both a server and a client, and the status of nodes is equal. The network has characteristics such as autonomy, dynamics, anonymity, and openness, which bring great convenience to users. However, with the rapid development of P2P networks, there are also some challenges. One of the key issues is: how to accurately and efficiently locate resource nodes in a large-scale P2P environment? To solve this problem, P2P network topologies are usually divided into the following three types for discussion according to node information storage and search methods: P2P networks with...

AI Technical Summary

Problems solved by technology

[0005] The problem solved by the present invention is that in the traditional chord network query process, the forwarding node is always selected in a greedy decision-making manner, and most of the improved methods for chord query are based on optimizing the routing table structure or refactoring chord ring to improve routing efficiency; when the number of uncooperative nodes in the Chord ring is large, these existing methods cannot successfully implement routing; in addition, for general structured P2P network environments, reputation-based routing decisions can be made in poorer Provides a better query success rate in a network environment, but for an environment with a good network status, the query efficiency is low

Images