Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Method and system for selecting optimal transaction node in peer-to-peer network set, and storage medium

A peer-to-peer network and transaction technology, applied in transmission systems, electrical components, etc., can solve problems such as high computational complexity, high node computing performance requirements, and no transaction time series recorded, so as to improve accuracy and reliability. improved effect

Inactive Publication Date: 2018-11-16
ZHEJIANG GONGSHANG UNIVERSITY
View PDF6 Cites 3 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

However, because this method only records the number of successes and failures of transactions in the trust list, but does not record the time series of transactions, it cannot contain the attack of "oscillating nodes"
[0004] There are also some methods for selecting the best transaction nodes in a peer-to-peer network set, such as using a "time series three-dimensional data table" on each node to save the transaction trust value between the node and other nodes, and by calculating the trust value of the transaction The method of twice weighting the time to prevent the attack of the oscillating node, but the calculation complexity is too high, and the calculation performance of the node is high.

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Method and system for selecting optimal transaction node in peer-to-peer network set, and storage medium
  • Method and system for selecting optimal transaction node in peer-to-peer network set, and storage medium
  • Method and system for selecting optimal transaction node in peer-to-peer network set, and storage medium

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0040] Assuming that the current set of peer-to-peer network nodes is N, set a two-dimensional array A with (N-1) rows and M columns for each node i (i∈N), which is used to record the transactions between node i and other nodes j in the network The transaction trust score is scored. The higher the transaction trust score, the better the service provided by node j for node i. The lower the score, the worse the service provided by node j for node i. Each row in the two-dimensional array A represents a node in the network. The score of each transaction between node and node i.

[0041] There are 4 nodes in the peer-to-peer network set in this embodiment, that is, N is 4, and each node is represented by 0 to 3, and each node saves the transaction trust score of the last 4 transactions with other nodes, that is, M for 4. Based on this, computing node 0 screens the best transaction nodes for other nodes in the peer-to-peer network set, specifically:

[0042] S01: Assign transactio...

Embodiment 2

[0105] This embodiment provides a system for selecting the best transaction node in a peer-to-peer network set, the system includes a transaction record assignment module, an array construction module, a time weight assignment module, a trust value calculation module and a selection module, wherein the transaction record assignment module , the array building module, the time weight assignment module and the trust value calculation and selection module are connected in sequence;

[0106] Specifically, the transaction record assignment module assigns transaction trust values ​​to each transaction record between each node in the current peer-to-peer network set, for example, assigning a value of 0.1 to a satisfactory transaction and -0.5 to an unsatisfactory transaction, which makes The trust score of transaction satisfaction is much smaller than the trust score of transaction dissatisfaction. Once the oscillating node does evil, its transaction trust will drop off a cliff, and i...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention discloses a method and system for selecting an optimal transaction node in a peer-to-peer network set, and a storage medium. The method comprises: transaction trust values are given to all transaction records among all nodes in a current peer-to-peer network set respectively, so that the trust scores with transaction satisfaction are far less than trust scores of transaction dissatisfaction; on the basis of the transaction trust values, a two-dimensional transaction array between each node and other nodes in the current peer-to-peer network set is constructed and a time weight isassigned for each transaction trust value in the two-dimensional transaction array; according to the two-dimensional transaction array, direct trust values of all nodes with all other nodes are calculated and indirect trust values of one current node with all other nodes are calculated based on the direct trust values between all other nodes; and according to the direct trust values and indirecttrust values of the current node with other nodes, a comprehensive trust value of the current node with all other nodes is calculated and the node with the highest comprehensive trust values is selected to carry out transaction with the current node.

Description

technical field [0001] The invention relates to a method for evaluating the credibility of network nodes, in particular to a method, system and storage medium for selecting the best transaction nodes in a peer-to-peer network set. Background technique [0002] Node transaction refers to the process in which a node j provides services for another node i. After the service is over, node i scores the trust value of node j. For example, node i needs to download a file, and this file exists on node j. Node i requests Node j gives it a download file, and node j allows node i to download its own file, then the transaction is completed; after the transaction is completed, node i gives node j a trust score based on node j's download speed, file integrity, etc., and the download speed is fast , the integrity of the file is good, the transaction is satisfactory, and the direct trust value increases, and if it is not satisfied, the trust value decreases. However, in the existing set of...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Applications(China)
IPC IPC(8): H04L29/08
CPCH04L67/104H04L67/1074H04L67/51
Inventor 甘志刚蒋晓宁余长宏余斌霄饶屾
Owner ZHEJIANG GONGSHANG UNIVERSITY
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com