CN114465933B - Block chain network transmission method and transmission medium based on KAD (Kad-based binary) model - Google Patents

Block chain network transmission method and transmission medium based on KAD (Kad-based binary) model Download PDF

Info

Publication number
CN114465933B
CN114465933B CN202210381224.6A CN202210381224A CN114465933B CN 114465933 B CN114465933 B CN 114465933B CN 202210381224 A CN202210381224 A CN 202210381224A CN 114465933 B CN114465933 B CN 114465933B
Authority
CN
China
Prior art keywords
node
nodes
twin
bucket
source
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN202210381224.6A
Other languages
Chinese (zh)
Other versions
CN114465933A (en
Inventor
李晓风
程龙乐
方世玉
谭海波
李皙茹
潘婉苏
吕波
许金林
赵赫
元沐南
陈良锋
王卫东
张中贤
周桐
余斌
盛念祖
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Hefei Institutes of Physical Science of CAS
Original Assignee
Hefei Institutes of Physical Science of CAS
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Hefei Institutes of Physical Science of CAS filed Critical Hefei Institutes of Physical Science of CAS
Priority to CN202210381224.6A priority Critical patent/CN114465933B/en
Publication of CN114465933A publication Critical patent/CN114465933A/en
Application granted granted Critical
Publication of CN114465933B publication Critical patent/CN114465933B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L43/00Arrangements for monitoring or testing data switching networks
    • H04L43/08Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters
    • H04L43/0852Delays
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00Traffic control in data switching networks
    • H04L47/10Flow control; Congestion control
    • H04L47/28Flow control; Congestion control in relation to timing considerations
    • H04L47/283Flow control; Congestion control in relation to timing considerations in response to processing delays, e.g. caused by jitter or round trip time [RTT]
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00Network arrangements or protocols for supporting network services or applications
    • H04L67/01Protocols
    • H04L67/10Protocols in which an application is distributed across nodes in the network
    • H04L67/104Peer-to-peer [P2P] networks

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Environmental & Geological Engineering (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

The invention relates to a block chain network transmission method based on a KAD dual-sub model and a storage medium, wherein a node ID exclusive-or distance value set between any source node A and a known peer node thereof is obtained through calculation, a node B corresponding to the maximum value in the set is selected, and a 'dual-sub node' B of the node A is obtained and is continuously refreshed. The larger the ID exclusive or distance between the nodes is, the larger the difference of adjacent nodes in the K buckets of the two nodes is, when the source node transmits data, information is firstly synchronized to the corresponding dual-child nodes and is synchronously transmitted, the coverage rate of the data in the network is improved, and the transmission redundancy is reduced. Meanwhile, the adjacent nodes in the K bucket of the nodes are reordered, the adjacent nodes feed back the network bandwidth and the transmission time of the adjacent nodes to the source node in a mode of sending test packets, the arrangement sequence of the adjacent nodes is determined according to delay parameters, and the high-order adjacent nodes have priority transmission rights, so that the network transmission efficiency is improved.

Description

Block chain network transmission method and transmission medium based on KAD (Kad-based binary) model
Technical Field
The invention relates to the technical field of blockchain network transmission, in particular to a blockchain network transmission method and a transmission medium based on a KAD bipartite model.
Background
The traditional network structure is based on a client-server model, a server is used as a provider of resources and services and is responsible for processing requests of clients, and messages sent between the clients are forwarded by the server. Participants in the P2P network architecture are both clients and servers, and the participants can share resources with each other, thereby avoiding the forwarding process of the server and enabling the operation of the whole network to be free from centralized management mechanisms.
The Kademlia protocol is a structured P2P network protocol, and efficient resource discovery is realized by constructing a distributed hash table as a node list and periodically maintaining the node list. Each node has an ID when joining the network, the Kademlia protocol provides for using the xor result of the IDs of two nodes as the distance between the nodes, each level of the node list maintained by a node is called a bucket, and each node maintains the number of buckets equivalent to the number of ID bits. By calculating the distance between nodes, each node places other nodes in different buckets, the time complexity of message propagation in the network is log (n).
In the Kademlia DHT network, a node acquires neighbor node information by sending a route query message. Each node maintains one <IP address, UDP port, ID>Three-dimensional list containing all distance nodes 2iAnd 2i+1(0≤i<N) of neighboring nodes. In the blockchain network, each bucket in the K buckets stores node information of a corresponding distance range, and nodes maintained in the K buckets are neighbor nodes serving as source nodes and used for next-level target nodes of data transmission of the source nodes. There are some problems with existing blockchain networks:
1) when data transmission is performed, a large amount of information redundancy occurs, which results in delay of data propagation and waste of network resources.
2) Since the node selection in the K bucket is more updated according to the xor logical distance of the node IDs, the problem of network bandwidth among nodes is not considered.
Disclosure of Invention
The invention provides a block chain network transmission method based on a KAD dual-sub model, which can solve the technical problem.
In order to achieve the purpose, the invention adopts the following technical scheme:
a block chain network transmission method based on a KAD dual-sub model comprises the following steps:
a Twin node architecture is added on the original KAD node architecture, and the Twin node is selected by finding out a node which is the farthest node in exclusive or logical distance with the node ID value of a source node in the existing block chain network;
The transmission method comprises the following steps:
s1, when a new node is added into the block chain network, firstly obtaining a plurality of seed nodes, then calculating the ID values of the source node and the seed nodes by using a hash algorithm, obtaining corresponding logical distance values according to the XOR algorithm between the ID values of the source node and the seed nodes, and then dividing the seed nodes into K buckets corresponding to the source node according to the logical distance values;
the source node sends FindNode instructions to the seed nodes, the seed nodes reply own neighbor nodes to the source node through neighbor instructions, the source node performs instruction PING operation with the returned neighbor nodes so as to determine whether the returned neighbor nodes are on-line, and if PONG instruction replies of the neighbor nodes are received, the nodes are on-line; the neighbor node also returns the network bandwidth and transmission time information of the neighbor node to the source node together with the PONG instruction, the returned nodes are subjected to ID XOR operation, and the nodes are updated to the corresponding positions in the K buckets of the neighbor node according to the ID operation value and the received bandwidth and transmission time;
s2, updating K bucket nodes by using an original KAD protocol, when a new node is found, connecting the node with the node according to a PING instruction, sending the bandwidth and transmission time of the new node to a source node through a PONG instruction, calculating transmission delay by the source node according to the returned bandwidth and transmission time, carrying out XOR on the ID value of the source node and the ID value of the new node to obtain a final XOR logical distance value, distributing the XOR logical distance value to the corresponding K bucket according to the XOR logical distance value, and then carrying out sequencing storage in the K bucket according to the transmission delay;
S3, after the K bucket is updated, taking a node with the maximum XOR logical distance value between the node ID value and the source node ID value in the updating process as a 'twin child node' of the source node, maintaining the 'twin child node' in a list of the source node, acquiring the K bucket node of the 'twin child node', sharing the K bucket nodes of the two nodes, comparing the transmission delay of the common node of the two K buckets, and keeping the node with which the transmission delay is low in the K bucket of which node, thereby reducing the repetition and redundancy in transmission;
and S4, because the K bucket is periodically updated and maintained, the corresponding disconnected node is cleared, and other new nodes are acquired and added into the K bucket, so that when the exclusive or logical distance value between the ID value of the existing new node and the ID value of the source node is larger, the previous 'double-child node' is replaced, the newly acquired node is taken as a new 'double-child node', and the S3 operation is performed again.
Further, step S1 is specifically as follows:
when a new node A is added into the whole block chain network, corresponding seed nodes are obtained according to an original KAD algorithm, neighbor nodes of the seed nodes are updated to a routing table of the new node A, so that K buckets are divided according to values obtained by carrying out XOR on node ID values and ID values of the new node A, the nodes are divided into different K buckets according to corresponding results, the nodes with the maximum logical distance value exclusive-or with the ID values of the new node A are selected from the neighbor nodes to serve as the Twin nodes of the new node A, 5 next-distant nodes are selected in sequence to serve as alternative nodes of the Twin nodes, the problem that the Twin nodes are disconnected during data transmission is prevented, and the alternative nodes are updated immediately to serve as the new Twin nodes.
Further, step S2 is specifically as follows:
when the K buckets are refreshed, firstly, attributions of the K buckets are distributed in sequence according to the size of an exclusive or logic distance value of an ID value between a source node and a neighbor node, then corresponding sequencing is carried out according to communication time between each node and network bandwidth transmitted by the nodes, nodes with low network delay are sequenced in the front, and nodes with high network delay are sequenced in the back.
Further, step S3 is specifically as follows:
when a source node finds out a Twin node of the source node, storing node information of the Twin node in a Twin node routing table constructed by the source node, wherein the Twin node routing table not only maintains the Twin node information, but also stores K bucket information of the Twin node;
the source node compares the K bucket node information of the node with the obtained K bucket information of the Twin node, screens repeated nodes in the K bucket information of the two nodes, and selects the K bucket of which the node is finally positioned according to the transmission delay time from the repeated node to the source node and the Twin node, wherein the delay from which node to the repeated node is low, and the repeated node belongs to the K bucket of the node.
According to the technical scheme, the block chain network transmission method based on the KAD dual-sub model is based on the defects of the existing block chain Kademlia protocol, and provides the Twin-KAD protocol on the basis of the Kademlia protocol, so that the rapid transmission and coverage of network data are realized. According to a Twin model constructed by Twin-KAD, data can cover the whole network more quickly in the transmission process, the transmission of data information is accelerated, network delay T between nodes is added to the selection of the existing K-bucket nodes, and corresponding nodes and sequences in the K buckets are obtained according to the final calculation result. Therefore, when data is transmitted, the node with better network state can be selected to transmit the data.
In summary, since the existing KAD protocol is based on P2P network, each node updates its K-bucket according to the value of the xor logical distance of the ID, and finally forms a routing table of the neighbor node. In the process of propagation, large redundant transmission exists, the propagation coverage rate is not high, the neighbor nodes in the K buckets determine the corresponding K buckets according to the XOR logical distance values of the ID values, and the K buckets do not have any practical physical significance. Based on this, the node with the largest ID XOR logical distance value of each node is used as the 'dual child node' of the node, and the XOR of the ID value of the dual child node and the ID value of the node indicates that the difference of the nodes in the two K buckets is the largest, so that the information can be synchronously updated to the dual child nodes in the data transmission process of the node, and the node and the corresponding dual child nodes can simultaneously transmit the information, thereby accelerating the coverage rate of the data in the whole network and reducing the redundancy of the transmitted data. In the process of selecting the K bucket nodes, the K bucket corresponding to the node is determined by the XOR logical distance value of the corresponding ID value, and meanwhile, the neighbor nodes can also send the network bandwidth and the transmission time to the source node, so that the sequence of the nodes is determined according to the finally calculated delay time, and the nodes with excellent network transmission state can be better preferentially transmitted when the nodes transmit data to select the neighbor nodes.
The invention provides a 'dual sub-model' on the basis of the prior KAD protocol, reduces the redundancy of propagation and accelerates the coverage speed of data on the whole network node. And parameters such as network transmission time RTT between the added nodes and network Bandwidth of the nodes are provided as weights on the basis of the K-bucket, and corresponding node sequencing in the K-bucket is obtained. Therefore, when data is transmitted, the node with better network state can be selected for data transmission.
Drawings
FIG. 1 is a basic flow of the Twin-KAD model of the present invention;
FIG. 2 is a schematic diagram of a Twin-KAD structure model according to the present invention;
FIG. 3 is a diagram illustrating a process for updating K buckets by a node according to the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are some, but not all, embodiments of the present invention.
The invention provides a KAD dual-sub-model-based block chain network transmission method, which mainly provides a Twin-KAD protocol on the basis of the Kademlia protocol according to the defects of the conventional block chain Kademlia protocol, and realizes the rapid propagation and coverage of network data. According to the Twin model constructed by Twin-KAD, data can quickly cover the whole network in the transmission process, and the transmission of data information is accelerated.
As shown in fig. 1, the method for transmitting a blockchain network based on KAD dual-sub model in this embodiment includes:
s1, when a new node is added into the block chain network, firstly obtaining a plurality of seed nodes, then calculating the ID values of the source node and the seed nodes by using a hash algorithm, obtaining corresponding logical distance values according to the XOR algorithm between the ID values of the source node and the seed nodes, and then dividing the seed nodes into K buckets corresponding to the source node according to the logical distance values;
the source node sends FindNode instructions to the seed nodes, the seed nodes reply own neighbor nodes to the source node through neighbor instructions, the source node performs instruction PING operation with the returned neighbor nodes so as to determine whether the returned neighbor nodes are on-line, and if PONG instruction replies of the neighbor nodes are received, the nodes are on-line; the neighbor node also returns the network bandwidth and transmission time information of the neighbor node to the source node together with the PONG instruction, the returned nodes are subjected to ID XOR operation, and the nodes are updated to the corresponding positions in the K buckets of the neighbor node according to the ID operation value and the received bandwidth and transmission time;
s2, updating K bucket nodes by using an original KAD protocol, when a new node is found, connecting the node with the node according to a PING instruction, sending the bandwidth and transmission time of the new node to a source node through a PONG instruction, calculating transmission delay by the source node according to the returned bandwidth and transmission time, carrying out XOR on the ID value of the source node and the ID value of the new node to obtain a final XOR logical distance value, distributing the XOR logical distance value to the corresponding K bucket according to the XOR logical distance value, and then carrying out sequencing storage in the K bucket according to the transmission delay;
S3, after the K bucket is updated, taking the node with the maximum XOR logical distance value between the node ID value and the source node ID value in the updating process as the 'twin child node' of the source node, simultaneously maintaining the 'twin child node' in a list of the source node, simultaneously acquiring the K bucket node of the 'twin child node', sharing the K bucket nodes of the two nodes, comparing the transmission delay of the common node of the two K buckets, and keeping the node with which the transmission delay is low in the K bucket of which node, thereby reducing the repetition and redundancy in transmission;
and S4, because the K bucket is periodically updated and maintained, the corresponding disconnected node is cleared, and other new nodes are acquired and added into the K bucket, so that when the exclusive or logical distance value between the ID value of the existing new node and the ID value of the source node is larger, the previous 'double-child node' is replaced, the newly acquired node is taken as a new 'double-child node', and the S3 operation is performed again.
The following is a detailed description:
as shown in the basic flow chart of the Twin-KAD model in FIG. 1, the Twin-KAD protocol adds Twin nodes on the basis of the original network nodes. The Twin node is selected according to the fact that the exclusive or logical distance between the ID value of the source node and the ID values of other nodes in the whole network is the largest. When a new node A is added into the whole block chain network, acquiring a corresponding seed node according to an original KAD algorithm, updating neighbor nodes of the seed node into a routing table of the seed node, dividing K buckets according to values obtained by carrying out XOR on ID values of the neighbor nodes and ID values of the new node A, dividing the K buckets into different K buckets according to corresponding results, selecting a node with the largest logical distance value with the ID value of the new node A from the neighbor nodes as a Twin node of the new node A, sequentially selecting 5 next-distant nodes as alternative nodes of the Twin node, preventing the problem that the Twin node is disconnected during data transmission, and immediately updating the alternative nodes as new Twin nodes.
When the K buckets are refreshed, firstly, the attributions of the K buckets are distributed in sequence according to the size of the XOR logical distance value of the ID value between the source node and the neighbor node, then, corresponding sequencing is carried out according to the communication time between each node and the network bandwidth transmitted by the nodes, the node with low network delay is sequenced in the front, and the node with high network delay is sequenced in the back.
When a source node finds out a Twin node of the source node, node information of the Twin node is stored in a Twin node routing table constructed by the source node, and the Twin node routing table not only maintains the Twin node information, but also stores K bucket information of the Twin node. The source node compares the K bucket node information of the node with the obtained K bucket information of the Twin node, screens repeated nodes in the K bucket information of the two nodes, and selects the K bucket of which the node is finally positioned according to the transmission delay time from the repeated node to the source node and the Twin node. Which node has low delay to the duplicate node, the duplicate node is attributed to the node's K-bucket.
The architecture diagram of the whole Twin-KAD network is shown in fig. 2, when a new node is added into the blockchain network, firstly, the neighbor node of the new node is obtained according to a seed node in the network, so that K bucket information is updated, redundancy in transmission is reduced and transmission of data information is accelerated in order to better cover the whole network in transmission, and thus a Twin node architecture is added on the original node architecture, and the Twin node is selected according to a node which is farthest from the node ID value of a source node in the existing blockchain network in exclusive or logical distance. The node ID value of the Twin node and the node ID value of the source node have the largest xor logical distance, so that the difference between the K bucket information of the two nodes is the largest, that is, the difference between the next-stage target nodes of the data transmitted by the two nodes is the largest, while the nodes in the block chain select a certain number of nodes in the K bucket to perform cyclic transmission during transmission, and the existence of the Twin node maximizes the difference between the nodes that perform cyclic transmission during transmission, thereby increasing the information transmission speed of the whole network. And the source node not only maintains the routing table of the node but also maintains the routing table of the Twin node, the node data in the routing table of the node is compared with the node data in the routing table of the Twin node, the nodes with low delay are selected to be stored according to the network delay with two nodes when the nodes exist repeatedly, and the other nodes store the repeated nodes into the storage space of the alternative node from the K bucket. Therefore, the dissimilarity of the two nodes in transmission is ensured, the redundancy in transmission is reduced, and the network transmission time is saved.
Updating of K bucket nodes is shown in FIG. 3, the number of K buckets in an existing block chain is 17, the value of n in the graph is 1-17, when a node A joins a block chain network, a seed node is firstly obtained, then the seed node is stored in the K bucket, then a neighboring node of the seed node is obtained through a FindNode instruction, so that the node A is connected with the nodes, whether the node is abnormal or not is confirmed, and when the node A is connected normally, the nodes are placed into the corresponding K buckets of the node A according to the XOR logical distance value of the node ID value. When the node A and the node m are in connection communication, the node m returns the network bandwidth of the node m to the node A, the node A confirms the network delay of the node m and the node M according to the network bandwidth and the network transmission time, the node M and the network delay are sequentially arranged in the K bucket according to the delay, the sequencing mode is from small to large, but the number of the nodes stored in the K bucket is generally 16, therefore, if i in the figure is less than 16, the node m can be stored in the K bucket according to the delay sequence; if i =16, node m is again stored in K buckets in delay order. But the last node is placed by the K bucket into the alternate node storage area. And the neighbor nodes selected by the nodes are guaranteed to be the nodes with lower network delay during data transmission, so that the network propagation speed is guaranteed.
From the above, time delay and network bandwidth are proposed on the basis of updating and maintaining the K-bucket nodes in the existing KAD protocol to ensure that the nodes in the K-bucket have better communication rate.
In yet another aspect, the present invention also discloses a computer readable storage medium storing a computer program which, when executed by a processor, causes the processor to perform the steps of any of the methods described above.
In yet another aspect, the present invention also discloses a computer device comprising a memory and a processor, the memory storing a computer program which, when executed by the processor, causes the processor to perform the steps of any of the methods described above.
In a further embodiment provided by the present application, there is also provided a computer program product comprising instructions which, when run on a computer, cause the computer to perform the steps of any of the methods of the above embodiments.
It is understood that the system provided by the embodiment of the present invention corresponds to the method provided by the embodiment of the present invention, and the explanation, the example and the beneficial effects of the related contents can refer to the corresponding parts in the method.
It will be understood by those skilled in the art that all or part of the processes of the methods of the embodiments described above can be implemented by a computer program, which can be stored in a non-volatile computer-readable storage medium, and can include the processes of the embodiments of the methods described above when the program is executed. Any reference to memory, storage, database, or other medium used in the embodiments provided herein may include non-volatile and/or volatile memory, among others. Non-volatile memory can include read-only memory (ROM), Programmable ROM (PROM), Electrically Programmable ROM (EPROM), Electrically Erasable Programmable ROM (EEPROM), or flash memory. Volatile memory can include Random Access Memory (RAM) or external cache memory. By way of illustration and not limitation, RAM is available in a variety of forms such as Static RAM (SRAM), Dynamic RAM (DRAM), Synchronous DRAM (SDRAM), Double Data Rate SDRAM (DDRSDRAM), Enhanced SDRAM (ESDRAM), Synchronous Link DRAM (SLDRAM), Rambus Direct RAM (RDRAM), direct bus dynamic RAM (DRDRAM), and memory bus dynamic RAM (RDRAM).
All possible combinations of the technical features in the above embodiments may not be described for the sake of brevity, but should be considered as being within the scope of the present disclosure as long as there is no contradiction between the combinations of the technical features.
The above examples are only intended to illustrate the technical solution of the present invention, and not to limit it; although the present invention has been described in detail with reference to the foregoing embodiments, it should be understood by those of ordinary skill in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some technical features may be equivalently replaced; and such modifications or substitutions do not depart from the spirit and scope of the corresponding technical solutions of the embodiments of the present invention.

Claims (5)

1. A block chain network transmission method based on KAD dual sub-model is characterized in that a Twin node architecture is added on the original KAD node architecture, and the Twin node is selected by finding out the node which has the exclusive OR logical distance with the node ID value of a source node in the original block chain network;
the transmission method comprises the following steps:
s1, when a new node is added into the block chain network, firstly obtaining a plurality of seed nodes, and dividing the seed nodes into K buckets with corresponding distances according to the ID exclusive or logic distance values of the source nodes and the seed nodes;
The method comprises the steps that a FindNode instruction is sent to a seed node by a source node, the seed node replies own neighbor nodes to the source node through neighbor instructions, and connectivity among nodes is determined through a PING-PONG instruction; the neighbor nodes also return the network bandwidth and transmission time information of the neighbor nodes to the source node together with the PONG instruction, and the return nodes are placed into the K buckets of the corresponding source nodes according to the ID XOR logical distance values of the return nodes and the source nodes; sequencing the nodes in the K bucket according to the network state of the returned nodes;
s2, updating the K bucket nodes by using the original KAD protocol, when a new node is found, determining the connectivity of the new node and acquiring the network state of the new node according to the PING-PONG instruction, and placing the new node at the corresponding position in the K bucket corresponding to the source node according to the ID value or the logical distance value and the network state of the new node and the source node;
s3, after the K bucket is updated, taking the node with the maximum XOR logical distance value between the node ID value and the source node ID value in the updating process as the 'twin child node' of the source node, simultaneously maintaining the 'twin child node' in a source node list, simultaneously acquiring the K bucket node of the 'twin child node', sharing the K bucket nodes of the two nodes, comparing the transmission delay of the common node of the two K buckets, and keeping the node with which the transmission delay is lower in the K bucket of which node, thereby reducing the repetition and redundancy in transmission;
And S4, periodically updating and maintaining the K bucket, clearing the corresponding disconnected node, acquiring other new nodes, adding the other new nodes into the K bucket, replacing the previous 'double-child node' when the exclusive or logical distance value between the ID value of the existing new node and the ID value of the source node is larger, taking the newly acquired node as a new 'double-child node', and repeating the S3 operation.
2. The KAD bigeminy model based blockchain network transmission method of claim 1, wherein: the step S1 is specifically as follows:
when a new node A is added into the whole block chain network, acquiring a corresponding seed node according to an original KAD algorithm, updating neighbor nodes of the seed node into a routing table of the seed node, dividing K buckets according to values obtained by carrying out XOR on node ID values and ID values of the new node A, dividing the K buckets into different K buckets according to corresponding results, selecting a node with the largest logical distance value with the ID value of the new node A from the neighbor nodes as a Twin node of the new node A, sequentially selecting 5 nodes which are far from the time to be used as alternative nodes of the Twin node, preventing the problem that the Twin node is disconnected during data transmission, and immediately updating the alternative nodes as new Twin nodes.
3. The KAD bigeminy model based blockchain network transmission method of claim 2, wherein: the step S2 is specifically as follows:
when the K buckets are refreshed, firstly, attributions of the K buckets are distributed in sequence according to the size of an exclusive or logic distance value of an ID value between a source node and a neighbor node, then corresponding sequencing is carried out according to communication time between each node and network bandwidth transmitted by the nodes, nodes with low network delay are sequenced in the front, and nodes with high network delay are sequenced in the back.
4. The KAD bi-sub model based blockchain network transmission method of claim 3, wherein: the step S3 is specifically as follows:
when a source node finds out a Twin node of the source node, storing node information of the Twin node in a Twin node routing table constructed by the source node, wherein the Twin node routing table not only maintains the Twin node information, but also stores K bucket information of the Twin node;
the source node compares the K bucket node information of the node with the obtained K bucket information of the Twin node, screens repeated nodes in the K bucket information of the two nodes, and selects the K bucket of which the node is finally positioned according to the transmission delay time from the repeated node to the source node and the Twin node, wherein the delay from which node to the repeated node is low, and the repeated node belongs to the K bucket of the node.
5. A computer-readable storage medium, storing a computer program which, when executed by a processor, causes the processor to carry out the steps of the method according to any one of claims 1 to 4.
CN202210381224.6A 2022-04-13 2022-04-13 Block chain network transmission method and transmission medium based on KAD (Kad-based binary) model Active CN114465933B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202210381224.6A CN114465933B (en) 2022-04-13 2022-04-13 Block chain network transmission method and transmission medium based on KAD (Kad-based binary) model

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202210381224.6A CN114465933B (en) 2022-04-13 2022-04-13 Block chain network transmission method and transmission medium based on KAD (Kad-based binary) model

Publications (2)

Publication Number Publication Date
CN114465933A CN114465933A (en) 2022-05-10
CN114465933B true CN114465933B (en) 2022-06-14

Family

ID=81418554

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202210381224.6A Active CN114465933B (en) 2022-04-13 2022-04-13 Block chain network transmission method and transmission medium based on KAD (Kad-based binary) model

Country Status (1)

Country Link
CN (1) CN114465933B (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115296824B (en) * 2022-10-08 2022-12-16 中国科学院合肥物质科学研究院 Hierarchical transmission method of block chain network based on multi-scale node management and storage medium

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103605708A (en) * 2013-11-11 2014-02-26 中国科学院计算技术研究所 Method and system for presuming keyword according to keyword Hash value in KAD network
WO2022022992A1 (en) * 2020-07-27 2022-02-03 Siemens Aktiengesellschaft Digital twin-based process control in an iot network
CN114244849A (en) * 2021-11-08 2022-03-25 北京中合谷投资有限公司 Routing layer of P2P network

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20160366214A9 (en) * 2013-03-15 2016-12-15 Jean Alexandera Munemann Dual node network system and method

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103605708A (en) * 2013-11-11 2014-02-26 中国科学院计算技术研究所 Method and system for presuming keyword according to keyword Hash value in KAD network
WO2022022992A1 (en) * 2020-07-27 2022-02-03 Siemens Aktiengesellschaft Digital twin-based process control in an iot network
CN114244849A (en) * 2021-11-08 2022-03-25 北京中合谷投资有限公司 Routing layer of P2P network

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
An identity-based approach to secure P2P applications;Luca Maria Aiello etc;《Peer-to-Peer Networking and applications》;20110106;全文 *
Dual-Kad Kademlia-Based Query Processing Strategies for P2P Data Integration;Zongquan Wang;《2012 Ninth Web Information Systems and Applications Conference》;20121224;全文 *

Also Published As

Publication number Publication date
CN114465933A (en) 2022-05-10

Similar Documents

Publication Publication Date Title
US7304994B2 (en) Peer-to-peer system and method with prefix-based distributed hash table
CN110971663B (en) Trusted processing method and system for data transaction
CN112104558B (en) Method, system, terminal and medium for implementing block chain distribution network
EP2491698B1 (en) Method and arrangement for locating services in a peer-to-peer network
US20090016346A1 (en) Apparatus, system and method for reliable, fast, and scalable meultcast message delivery in service overlay networks
Gai et al. Broose: a practical distributed hashtable based on the de-bruijn topology
JP2009543447A5 (en)
CN105519053A (en) Dynamic interest forwarding mechanism for information centric networking
CN114465933B (en) Block chain network transmission method and transmission medium based on KAD (Kad-based binary) model
CN110943918B (en) Networking method of centerless multi-channel concurrent transmission system
CN110336741B (en) Kad algorithm optimization method suitable for P2P instant messaging
CN101640628B (en) Mesh network-based routing management and routing methods, node, device and system
Xie et al. A fast hybrid data sharing framework for hierarchical mobile edge computing
CN110956463A (en) Credible certificate storing method and system based on extensible distributed query system
CN115914074A (en) Point-to-point network message transmission method, routing equipment and computer storage medium
Leong et al. Achieving one-hop dht lookup and strong stabilization by passing tokens
Al Mojamed et al. Design and evaluation of a peer-to-peer MANET crosslayer approach: OneHopOverlay4MANET
JP2011530953A (en) Message routing platform
CN116667910A (en) Satellite network addressing method, device, electronic equipment and storage medium
Wirtz et al. DHT-based localized service discovery in wireless mesh networks
CN114363247A (en) Method for constructing block chain fully-distributed node routing network
Chen et al. A forwarding model for voronoi-based overlay network
Chang et al. MR-Chord: A scheme for enhancing Chord lookup accuracy and performance in mobile P2P network
CN112272143A (en) Route learning and forwarding method
CN116033520B (en) Wireless networking method and wireless ad hoc network system

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant