A distributed hash table routing method fusing geographic positions

Abstract

The invention discloses a distributed hash table routing method f fusing geographic positions, which comprises the following steps that: P2P (Peer-to-Peer) network nodes use an ID (Identity) generation rule based on geographic positions to generate node IDs (Identities), and the distances among the nodes are calculated according to the IDs; The invention discloses a distributed hash table routingmethod fusing geographic positions. the advantages of the distributed hash table and geographic position information knowing are combined, The distributed hash table can be decentralized and is used for bottom layer network transmission of the block chain, geographic position information can be known, nodes close to geographic positions can be found more quickly, the communication speed between the nodes is higher, and the problem that the communication efficiency is low due to the fact that the distance between the nodes of the distributed hash table is too long is solved.

Description

technical field [0001] The present invention relates to the technical fields of geography, distributed hash tables and blockchains, and in particular to a distributed hash table routing method that integrates geographic locations. Background technique [0002] With the advent of the Internet of Things era, a large number of devices have entered thousands of households, and technologies such as blockchain, distributed file system, and edge computing are making rapid progress. Many blockchain underlying networks use distributed hash table technology. Improving the efficiency of distributed hash table data exchange is of great help in improving the speed of blockchain data exchange and finding nodes. [0003] However, the traditional distributed hash table routing method cannot guarantee the data exchange efficiency of connected nodes. When the user uses the distributed hash table, the distance between the P2P network nodes is calculated based on the value obtained by the XOR ...

AI Technical Summary

Problems solved by technology

[0003] However, the traditional distributed hash table routing method cannot guarantee the data exchange efficiency of connected nodes

When the user uses the distributed hash table, the distance between the P2P network nodes is calculated based on the value obtained by the XOR operation of the IDs of the two nodes. The smaller the value, the closer the distance, and the ID of the P2P network node is randomly generated. , has nothing to do with the geographical location of the P2P network node. The first found node providing the service is on the other side of the earth. There are nodes that can provide the same service even if it is closer, but the node with the closer physical distance may be farther logically. Nodes that are farther away are logically closer, resulting in inefficient data transmission

Images