CN114520810B - Block data transmission method, equipment and medium based on block chain - Google Patents
Block data transmission method, equipment and medium based on block chain Download PDFInfo
- Publication number
- CN114520810B CN114520810B CN202210103249.XA CN202210103249A CN114520810B CN 114520810 B CN114520810 B CN 114520810B CN 202210103249 A CN202210103249 A CN 202210103249A CN 114520810 B CN114520810 B CN 114520810B
- Authority
- CN
- China
- Prior art keywords
- blockchain
- node
- nodes
- target
- determining
- 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
Links
- 230000005540 biological transmission Effects 0.000 title claims abstract description 62
- 238000000034 method Methods 0.000 title claims abstract description 40
- 238000012545 processing Methods 0.000 claims abstract description 79
- 238000012216 screening Methods 0.000 claims abstract description 13
- 238000004891 communication Methods 0.000 claims description 42
- 239000012634 fragment Substances 0.000 claims description 14
- 238000011156 evaluation Methods 0.000 claims description 13
- 238000003860 storage Methods 0.000 claims description 12
- 238000012163 sequencing technique Methods 0.000 claims description 5
- 238000012546 transfer Methods 0.000 claims description 5
- 238000004806 packaging method and process Methods 0.000 claims description 4
- 238000005457 optimization Methods 0.000 abstract description 2
- 238000010586 diagram Methods 0.000 description 8
- 238000004590 computer program Methods 0.000 description 7
- 230000006870 function Effects 0.000 description 5
- 230000009286 beneficial effect Effects 0.000 description 4
- 230000008569 process Effects 0.000 description 4
- 230000000694 effects Effects 0.000 description 3
- 238000005516 engineering process Methods 0.000 description 3
- 230000001186 cumulative effect Effects 0.000 description 2
- 238000013500 data storage Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 2
- 206010033799 Paralysis Diseases 0.000 description 1
- 230000002159 abnormal effect Effects 0.000 description 1
- 230000015556 catabolic process Effects 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 230000010354 integration Effects 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 230000007246 mechanism Effects 0.000 description 1
- 230000000750 progressive effect Effects 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/104—Peer-to-peer [P2P] networks
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/1097—Protocols in which an application is distributed across nodes in the network for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/08—Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
- H04L9/0816—Key establishment, i.e. cryptographic processes or cryptographic protocols whereby a shared secret becomes available to two or more parties, for subsequent use
- H04L9/0819—Key transport or distribution, i.e. key establishment techniques where one party creates or otherwise obtains a secret value, and securely transfers it to the other(s)
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/32—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials
- H04L9/3236—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials using cryptographic hash functions
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/50—Reducing energy consumption in communication networks in wire-line communication networks, e.g. low power modes or reduced link rate
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Computer Security & Cryptography (AREA)
- Mobile Radio Communication Systems (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The application discloses a block data transmission method, equipment and medium based on a block chain, which are used for solving the technical problems that the block chain does not realize the optimization of data transmission performance on the whole level and the reduction of data transmission efficiency is difficult to meet the user requirement. The method comprises the following steps: constructing a block chain platform; determining a plurality of paths in which user nodes are located in a tree structure; determining the trust degree and the geographic distance between a user node and each blockchain node on each path in the paths aiming at each path in the paths to obtain the accumulated trust degree and the accumulated geographic distance corresponding to the path; screening a target path from the paths according to the accumulated trust degree and the accumulated geographic distance, and taking a terminal node of the target path as a target node; forwarding block data carried by the user node to a target node; and determining each processing module contained in the target node, and carrying out random routing on the block data in the target node to obtain the target processing module.
Description
Technical Field
The application relates to the technical field of blockchains, in particular to a blockchain-based block data transmission method, equipment and medium.
Background
The block chain is used as a novel data storage mode, and the decentralization, the non-falsification and the non-falsification of data are realized through the integration of technologies such as distributed data storage, point-to-point transmission, a consensus mechanism, an encryption algorithm and the like.
However, when the conventional blockchain performs data communication between nodes, the difference between the transmission performance and the reliability of each node is not considered, the optimization of the data transmission performance is not realized on the whole level, and when the number of blockchain nodes is large or the network traffic reaches a high peak value, the data transmission efficiency is low, so that the requirement of a user is difficult to meet.
Disclosure of Invention
In order to solve the above-mentioned problems, the present application provides a block data transmission method based on a block chain, comprising: constructing a block chain platform, wherein the block chain platform comprises a plurality of block chain nodes, the plurality of block chain nodes at least comprise user nodes, and the plurality of block chain nodes divide a hierarchy based on a preset tree structure; determining a plurality of paths in which user nodes are located in a tree structure; determining the trust degree and the geographic distance between a user node and each blockchain node on each path in the paths aiming at each path in the paths to obtain the accumulated trust degree and the accumulated geographic distance corresponding to the path; screening a target path from the paths according to the accumulated trust degree and the accumulated geographic distance, and taking a terminal node of the target path as a target node; forwarding block data carried by the user node to the target node through the forwarding node in the target path; and determining each processing module contained in the target node, and carrying out random routing on the block data in the target node to obtain a target processing module so as to uplink the block data through the target processing module.
In one implementation manner of the present application, determining each processing module included in the target node specifically includes: uniformly slicing the target node to obtain different slices corresponding to the target node; aiming at different fragments, carrying out unique identification on the fragments, and carrying out hash encryption on the unique identification to obtain hash values corresponding to the fragments; and dividing the fragments with equal corresponding values at the preset bit numbers of the hash values into the same processing module to obtain each processing module contained in the target node.
In one implementation of the present application, a target processing module is obtained by performing random routing on block data in a target node, and specifically includes: randomly routing the block data to any processing module in an idle state, and taking the processing module as a target processing module; under the condition that the processing bandwidth value of the target processing module is smaller than the transmission bandwidth value required by block data transmission, selecting other processing modules with the minimum communication connection number with the target processing module from other processing modules in an idle state contained in the target node as virtual processing modules of the target processing module; and performing auxiliary uplink operation on the block data through the virtual processing module.
In one implementation of the present application, after the target path is selected from the plurality of paths and an end node of the target path is taken as the target node, the method further includes: carrying out hash encryption on block data carried by a user node to obtain a user digest, and encrypting the user digest by a private key of the user node to obtain a digest tag corresponding to the block data; determining a transmission key between the user node and the target node, and packaging the block data through the transmission key to obtain appointed block data; obtaining a public key of a target node, encrypting a transmission key through the public key, and generating an encrypted multi-layer transmission key; and forwarding the digest tag, the specified block data and the multi-layer transmission key to the target node.
In one implementation of the application, the confidence level includes a direct confidence level and an indirect confidence level; determining the trust degree between the user node and each blockchain node on the path to obtain the accumulated trust degree corresponding to the path, wherein the method specifically comprises the following steps: acquiring a historical evaluation sequence of a user node, wherein the historical evaluation sequence comprises the direct trust degree of the user node to each blockchain node on a path; according to the evaluated total number of each blockchain node on the path, carrying out weighted summation on the direct trust degree to obtain the indirect trust degree of each blockchain node; determining a first weighting coefficient and a second weighting coefficient which correspond to the direct trust degree and the indirect trust degree respectively, and carrying out weighted summation on the direct trust degree and the indirect trust degree according to the first weighting coefficient and the second weighting coefficient to obtain a standard trust degree; and giving a time stamp to the standard trust degree to obtain the trust degree between the user node and each block link point on the path at different moments.
In one implementation of the present application, a target path is selected from a plurality of paths according to an accumulated trust level and an accumulated geographic distance, and the method specifically includes: determining a first priority value and a second priority value corresponding to the paths aiming at each path in the paths, wherein the first priority value corresponds to the accumulated trust degree of the paths, and the second priority value corresponds to the accumulated geographic distance of the paths; and respectively determining a first weight and a second weight corresponding to the accumulated trust degree and the accumulated geographic distance, carrying out weighted summation on the accumulated trust degree and the accumulated geographic distance according to the first weight, the second weight, the first priority and the second priority so as to generate a path sequence to be selected according to a weighted summation result, and screening the path sequence to be selected to obtain a target path.
In one implementation of the present application, before determining the pre-built blockchain, the method further includes: determining communication domains of a plurality of block chain nodes, listing block chain link points with intersections of the communication domains into the same block chain network, and determining a hierarchical structure corresponding to the block chain network according to the computing capability of each block chain node in the block chain network; in other blockchain networks, determining cross-chain nodes with adjacent hierarchical relations with blockchain nodes in the blockchain networks according to hierarchical structures corresponding to other blockchain networks; according to the cross-chain node, cross-chain communication between other blockchain networks and the blockchain network is established to generate a tree structure for the plurality of blockchain networks.
In one implementation of the present application, determining a hierarchical structure corresponding to a blockchain network according to a computing capability of a blockchain node specifically includes: sequencing the block chain nodes according to the computing power of the block chain nodes to obtain a corresponding computing power sequence, and selecting the block chain node with the largest computing power from the computing power sequence as a root node in a hierarchical structure corresponding to the block chain network; grouping the blockchain nodes with the same computing capacity according to the computing capacity sequence, and determining the hierarchy of the blockchain nodes in the grouping according to the computing capacity corresponding to the grouping; the blockchain nodes in the group are brother nodes; determining a connecting link corresponding to an adjacent blockchain node according to the geographic distance between an upper-level blockchain node and a lower-level blockchain node in the adjacent blockchain nodes aiming at the adjacent blockchain nodes in the adjacent hierarchy; and determining the hierarchical structure in the blockchain network according to the root node, the hierarchy and the connecting links corresponding to the adjacent blockchain nodes.
The embodiment of the application provides a block data transmission device based on a block chain, which comprises:
At least one processor; and
A memory communicatively coupled to the at least one processor; wherein,
The memory stores instructions executable by the at least one processor to enable the at least one processor to:
Constructing a block chain platform, wherein the block chain platform comprises a plurality of block chain nodes, the plurality of block chain nodes at least comprise user nodes, and the plurality of block chain nodes divide a hierarchy based on a preset tree structure;
determining a plurality of paths in which user nodes are located in a tree structure;
Determining the trust degree and the geographic distance between a user node and each blockchain node on each path in the paths aiming at each path in the paths to obtain the accumulated trust degree and the accumulated geographic distance corresponding to the path;
screening a target path from the paths according to the accumulated trust degree and the accumulated geographic distance, and taking a terminal node of the target path as a target node;
Forwarding block data carried by the user node to the target node through the forwarding node in the target path;
And determining each processing module contained in the target node, and carrying out random routing on the block data in the target node to obtain a target processing module so as to uplink the block data through the target processing module.
The embodiment of the application provides a nonvolatile computer storage medium, which stores computer executable instructions, wherein the computer executable instructions are configured to:
Constructing a block chain platform, wherein the block chain platform comprises a plurality of block chain nodes, the plurality of block chain nodes at least comprise user nodes, and the plurality of block chain nodes divide a hierarchy based on a preset tree structure;
determining a plurality of paths in which user nodes are located in a tree structure;
Determining the trust degree and the geographic distance between a user node and each blockchain node on each path in the paths aiming at each path in the paths to obtain the accumulated trust degree and the accumulated geographic distance corresponding to the path;
screening a target path from the paths according to the accumulated trust degree and the accumulated geographic distance, and taking a terminal node of the target path as a target node;
Forwarding block data carried by the user node to the target node through the forwarding node in the target path;
And determining each processing module contained in the target node, and carrying out random routing on the block data in the target node to obtain a target processing module so as to uplink the block data through the target processing module.
The block data transmission method, the device and the medium based on the block chain provided by the application have the following beneficial effects:
By establishing a tree structure among the block chain nodes, each block chain link point is networked and layered, so that communication interruption of the whole block chain network is avoided when individual block chain link points fail, and the fault tolerance is stronger; when the target path is determined, the trust degree and the communication distance between the user node and other block chain nodes on the path are comprehensively considered, so that the target path can simultaneously consider the transmission efficiency and the reliability, the usability and the practicability are stronger, the block data can only be transmitted on one path through the communication between the user node and the target node at the tail end of the selected target path, the repeated transmission of the data is avoided, the block data can only be transmitted between adjacent nodes, and the transmission efficiency is improved; the target node is divided into a plurality of processing modules, so that concurrent communication with different block chain nodes can be realized, and the data transmission efficiency is improved.
Drawings
The accompanying drawings, which are included to provide a further understanding of the application and are incorporated in and constitute a part of this specification, illustrate embodiments of the application and together with the description serve to explain the application and do not constitute a limitation on the application. In the drawings:
Fig. 1 is a flowchart of a block data transmission method based on a block chain according to an embodiment of the present application;
Fig. 2 is a schematic structural diagram of a block data transmission device based on a block chain according to an embodiment of the present application.
Detailed Description
In order to make the objects, technical solutions and advantages of the present application more apparent, the technical solutions of the present application will be clearly and completely described below with reference to specific embodiments of the present application and corresponding drawings. It will be apparent that the described embodiments are only some, but not all, embodiments of the application. All other embodiments, which can be made by those skilled in the art based on the embodiments of the application without making any inventive effort, are intended to be within the scope of the application.
The following describes in detail the technical solutions provided by the embodiments of the present application with reference to the accompanying drawings.
As shown in fig. 1, a block data transmission method based on a block chain according to an embodiment of the present application includes:
s101: a blockchain platform is constructed.
The block chain platform comprises a plurality of block chain nodes, wherein the plurality of block chain nodes at least comprise user nodes, and the user nodes can uplink the block data carried by the user nodes, so that data transmission with other block chain nodes is realized.
In one embodiment, a plurality of blockchain nodes communicate in a tree topology, each blockchain node may divide a hierarchy based on a preset tree structure. The tree structure is a virtual logic structure which is planned in advance according to actual communication requirements, and can be a multi-fork tree or a binary tree structure, and the actual physical structure among the block chain nodes is not changed by various tree structures. To pre-construct the tree structure between blockchain nodes, the blockchain platform needs to pre-determine the communication domain of a plurality of blockchain nodes, wherein the communication domain is determined according to the historical communication range of each blockchain node. The block chain link points with the intersection of the communication domains are listed in the same block chain network, so that the block chain link points in the same block chain network have coincident communication areas, and can communicate with each other in the coverage area of the block chain network.
For each blockchain network, determining an internal hierarchy corresponding to the blockchain network according to the computing power among the blockchain nodes. Specifically, firstly, sequencing the blockchain nodes according to the computing power of the blockchain nodes to obtain a corresponding computing power sequence, and selecting the blockchain node with the largest computing power from the computing power sequence as a root node in a hierarchical structure corresponding to the blockchain network. And then grouping the blockchain nodes with the same computing capacity according to the computing capacity sequence, and determining the hierarchy of the blockchain nodes in the grouping according to the computing capacity corresponding to the grouping. For example, assume there are five blockchain nodes A-E, whose computing power is ordered to obtain a sequence A, C, E, D, B of computing power, where the computing power of blockchain node A is 80% at maximum, the computing power of blockchain nodes C and E are 50%, the computing power of blockchain node D is 45%, and the computing power of blockchain node B is 30%. Then, the blockchain node a is the root node of the blockchain network, and the blockchain nodes C and E in the same group have the computing power inferior to that of the root node and can be divided into the next level of the hierarchy where the root node is located, and are sibling nodes due to the same computing power of the blockchain nodes C and E.
Further, for adjacent blockchain nodes at adjacent levels, according to the geographic distance between an upper-level blockchain node and a lower-level blockchain node in the adjacent blockchain nodes, connection links corresponding to the adjacent blockchain nodes are determined, and after the root node, the level where each blockchain node is located and the connection links corresponding to the adjacent blockchain nodes are determined, the hierarchical structure in the blockchain network can be determined. For example, the level at which blockchain node D is located is the next level of blockchain nodes C and E, and whether blockchain node D is to be connected after blockchain node C or after blockchain node E depends on the geographic distance between blockchain node D and its upper level blockchain node. The geographical distance refers to the actual distance between the blockchain nodes, and the shorter the geographical distance is, the shorter the communication delay time is, so that when determining the connection link, the lower blockchain node should preferentially select the upper blockchain node with the shortest geographical distance to connect.
The interconnection between the local blockchain nodes is realized by constructing the blockchain network, but for different blockchain networks, the blockchain nodes are closed communication systems, and the blockchain nodes can only communicate and trade in the network to which the blockchain nodes belong, so that information islands are easy to form. Therefore, in order to realize communication between independent blockchain networks, the blockchain platform also needs to determine, in other blockchain networks, a cross-chain node having an adjacent hierarchical relationship with the blockchain nodes in the blockchain network according to the hierarchical structure corresponding to the other blockchain networks, and then establish cross-chain communication between the other blockchain networks and the blockchain network through the cross-chain node, so that a tree structure for a plurality of blockchain networks is generated. The cross-link node may be a node on another blockchain network, or may be a node on the blockchain network, and any node having an adjacent hierarchical relationship and capable of communicating by a cross-link protocol may be used as the cross-link node.
The logical communication among the block chain nodes is performed by constructing the tree structure, so that the communication mode is more flexible, communication paralysis cannot be caused under the condition that individual block chain nodes fail, a loop does not exist in the tree structure, block data can only be transmitted among adjacent nodes according to paths, the phenomenon of repeated data transmission cannot occur, and the data transmission efficiency is improved.
S102: a plurality of paths in the tree structure are determined along which the user nodes are located.
The paths where the user nodes are located are generally obtained by forward traversing the user nodes as starting points according to a preset tree structure. However, for the user node at the end node, the path where the user node is located may be a plurality of paths obtained by performing reverse traversal according to a preset tree structure, or a path with inflection point obtained by taking the user node as a starting point and taking any end node as an end point.
S103: and determining the trust degree and the geographic distance between the user node and each blockchain node on each path in the paths aiming at each path in the paths so as to obtain the accumulated trust degree and the accumulated geographic distance corresponding to the path.
The multiple paths corresponding to each user node include at least one blockchain node. In the blockchain, the user node and each blockchain node on the path where the user node and each blockchain node are located have different trust degrees, and the trust degrees are reflected in whether the blockchain node falsifies information, whether the blockchain network is maliciously damaged or not and the like. The good trust degree is a precondition for realizing data transmission, so that in order to ensure the communication performance and reliability of data transmission, when block data carried by user nodes are uplink, performance evaluation and path selection are required to be carried out through the accumulated trust degree and the accumulated geographic distance of the path where the user nodes are located.
The trust level includes a direct trust level and an indirect trust level, and the direct trust level refers to a direct trust relationship between a user node and a blockchain node on a path of the user node, and can be determined by acquiring a historical evaluation sequence of the user node. Each blockchain node corresponds to a historical evaluation sequence of the blockchain node, all the evaluations initiated by the blockchain node on other blockchain nodes except the blockchain node are stored, and the evaluation indexes comprise communication time, communication congestion degree, communication reliability and the like. The indirect trust degree is reflected in the reliability degree of each blockchain node on the path of the user node, for each blockchain node, the total evaluation number of the blockchain node evaluated can be determined by acquiring the historical evaluation sequences of other blockchain nodes on the blockchain network, and then the direct trust degree between the user node and the blockchain node is weighted and summed through the ratio of the evaluation number of the blockchain node to the total evaluation number of the blockchain node by the other blockchain nodes, so that the indirect trust degree of the blockchain node is obtained. It can be known that the more evaluated times the blockchain node is, the greater the indirect trust degree is. And respectively determining a first weighting coefficient and a second weighting coefficient corresponding to the direct trust degree and the indirect trust degree, carrying out weighted summation on the direct trust degree and the indirect trust degree according to the first weighting coefficient and the second weighting coefficient, and giving a time stamp to the standard trust degree obtained by the weighted summation, thereby obtaining the trust degree between the user node and each block link point on the path at different moments. It should be noted that, as time goes by, the trust level between the user node and other blockchain nodes is gradually reduced.
S104: and screening a target path from the paths according to the accumulated trust degree and the accumulated geographic distance, and taking the end node of the target path as a target node.
Summing the trust degrees corresponding to all the block chain link points on the path of the user node to obtain the accumulated trust degree corresponding to the path, and summing the geographic distances between the user node and all the block chain nodes on the path to obtain the accumulated geographic distance corresponding to the path. For each path, the blockchain platform can determine a first priority value and a second priority value according to the accumulated trust degree and the accumulated geographic distance corresponding to each path respectively, wherein the first priority value corresponds to the accumulated trust degree of the path, and the second priority value corresponds to the accumulated geographic distance of the path. For example, if the user node is on five paths a-e, and the accumulated trust of each path is sequentially arranged from big to small to be path c, path d, path b, path e and path a, then the corresponding first priority value may be sequentially set to be 5, 4, 3, 2 and 1; the accumulated communication distances are sequentially arranged from small to large as paths e, d, a, b and c, and the corresponding second priority values are also sequentially set to 5, 4, 3, 2 and 1.
The blockchain platform can determine a first weight and a second weight corresponding to the accumulated trust degree and the accumulated geographic distance according to actual application requirements, when the user node needs to emphasize the data transmission quality, the first weight is larger, and similarly, when the user node more sees the data transmission efficiency, the second weight can be set to be a larger value. And respectively carrying out weighted summation on the first priority value and the second priority value corresponding to each path through the first weight value and the second weight value, generating a corresponding path sequence to be selected according to the weighted summation result, and screening the path with the largest corresponding summation result in the path sequence to be selected as a target path, wherein the accumulated trust degree of the target path is the largest and the accumulated geographic distance is the smallest. It should be noted that, in the above-described example, the path with the largest summation result is selected as the target path, and in the case where the smaller the cumulative confidence level is, the larger the cumulative geographic distance is, and the larger the priority value is, the path with the smallest summation result is selected as the target path.
S105: and forwarding the block data carried by the user node to the target node through the forwarding node in the target path.
And the end node of the target path is used as a target node for uplink of the block data carried by the user node. The other blockchain nodes on the target path, except the user node and the target node, are forwarding nodes for forwarding the blockdata to the target node.
S106: and determining each processing module contained in the target node, and carrying out random routing on the block data in the target node to obtain a target processing module so as to uplink the block data through the target processing module.
In the blockchain provided by the embodiment of the application, for the target node, the blockchain platform can uniformly slice the target node, so that different slices corresponding to the target node are obtained, and each slice bears a data processing function by different servers. And randomly generating corresponding unique identifiers for different fragments, and carrying out hash encryption on the unique identifiers to obtain hash values corresponding to the fragments. Fragments with equal corresponding values at the preset bit numbers of the hash value are divided into the same processing module, for example, fragments with equal values of two bits after the hash value can be listed into the same processing module, so that a plurality of fragments can be divided into the processing modules according to different hash values, and the processing modules all bear different data processing capacities due to different numbers of fragments. The inside of each block chain link point is divided into a plurality of processing modules, based on the processing modules, each block chain node can realize concurrent communication with different block chain nodes, so that the data transmission efficiency is further improved, the fault tolerance is stronger, and the phenomenon of communication breakdown under the condition that a certain processing module is abnormal is avoided.
After the block data of the user node is forwarded to the target node, the block data is also required to be randomly routed in the target node, so that the block data is randomly routed to any target processing module in an idle state, and the block data is uplink through the target processing module. And under the condition that the processing bandwidth value of the target processing module which is randomly routed is smaller than the transmission bandwidth value required by the block data transmission, selecting the other processing module with the least communication connection number with the target processing module from the other processing modules which are in the idle state and contained in the target node as a virtual processing module of the target processing module, so that the auxiliary uplink operation is carried out on the block data through the virtual processing module, and the integrity of the block data is ensured. It should be noted that the number of communication connections indicates the number of transfer times between different processing modules, and is related to the number of transfer devices, and other processing modules with the minimum number of communication connections are selected to perform auxiliary uplink operation, so that the number of data transfer operations is reduced, the pressure of data transfer is reduced, and the data transmission efficiency is further improved.
In one embodiment, the blockchain platform hashes the blockdata carried by the user node to obtain a user digest, and encrypts the user digest by using a private key of the user node to obtain a digest tag corresponding to the blockdata. And determining a transmission key between the user node and the target node, packaging the block data through the transmission key to obtain the specified block data, and encrypting the transmission key through the public key of the target node to generate an encrypted multi-layer transmission key. When the block data is transmitted, the forwarding node forwards the digest tag, the designated block data and the multi-layer transmission key to the target node, so that the target node can acquire the transmission key through the private key of the target node after receiving the corresponding data packet, then acquire the block data through decryption of the transmission key, acquire the user digest through the public key of the user node, and determine whether the currently transmitted block data is tampered or not through comparing the result obtained after hash encryption of the block data with the user digest. By encrypting the transmission key and secondarily packaging the block data, the data can be further prevented from being tampered, and the safety of data transmission is improved.
The above is a method embodiment of the present application. Based on the same thought, some embodiments of the present application also provide a device and a non-volatile computer storage medium corresponding to the above method.
Fig. 2 is a schematic structural diagram of a block data transmission device based on a block chain according to an embodiment of the present application. As shown in fig. 2, includes:
At least one processor; and
A memory communicatively coupled to the at least one processor; wherein,
The memory stores instructions executable by the at least one processor to enable the at least one processor to:
Constructing a block chain platform, wherein the block chain platform comprises a plurality of block chain nodes, the plurality of block chain nodes at least comprise user nodes, and the plurality of block chain nodes divide a hierarchy based on a preset tree structure;
determining a plurality of paths in which user nodes are located in a tree structure;
Determining the trust degree and the geographic distance between a user node and each blockchain node on each path in the paths aiming at each path in the paths to obtain the accumulated trust degree and the accumulated geographic distance corresponding to the path;
screening a target path from the paths according to the accumulated trust degree and the accumulated geographic distance, and taking a terminal node of the target path as a target node;
Forwarding block data carried by the user node to the target node through the forwarding node in the target path;
And determining each processing module contained in the target node, and carrying out random routing on the block data in the target node to obtain a target processing module so as to uplink the block data through the target processing module.
The non-volatile computer storage medium provided by the embodiment of the application stores computer executable instructions, and the computer executable instructions are set as follows:
Constructing a block chain platform, wherein the block chain platform comprises a plurality of block chain nodes, the plurality of block chain nodes at least comprise user nodes, and the plurality of block chain nodes divide a hierarchy based on a preset tree structure;
determining a plurality of paths in which user nodes are located in a tree structure;
Determining the trust degree and the geographic distance between a user node and each blockchain node on each path in the paths aiming at each path in the paths to obtain the accumulated trust degree and the accumulated geographic distance corresponding to the path;
screening a target path from the paths according to the accumulated trust degree and the accumulated geographic distance, and taking a terminal node of the target path as a target node;
Forwarding block data carried by the user node to the target node through the forwarding node in the target path;
And determining each processing module contained in the target node, and carrying out random routing on the block data in the target node to obtain a target processing module so as to uplink the block data through the target processing module.
The embodiments of the present application are described in a progressive manner, and the same and similar parts of the embodiments are all referred to each other, and each embodiment is mainly described in the differences from the other embodiments. In particular, for the apparatus and medium embodiments, the description is relatively simple, as it is substantially similar to the method embodiments, with reference to the section of the method embodiments being relevant.
The devices and media provided in the embodiments of the present application are in one-to-one correspondence with the methods, so that the devices and media also have similar beneficial technical effects as the corresponding methods, and since the beneficial technical effects of the methods have been described in detail above, the beneficial technical effects of the devices and media are not repeated here.
It will be appreciated by those skilled in the art that embodiments of the present application may be provided as a method, system, or computer program product. Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present application may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The present application is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to embodiments of the application. It will be understood that each flow and/or block of the flowchart illustrations and/or block diagrams, and combinations of flows and/or blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
In one typical configuration, a computing device includes one or more processors (CPUs), input/output interfaces, network interfaces, and memory.
The memory may include volatile memory in a computer-readable medium, random Access Memory (RAM) and/or nonvolatile memory, such as Read Only Memory (ROM) or flash memory (flash RAM). Memory is an example of computer-readable media.
Computer readable media, including both non-transitory and non-transitory, removable and non-removable media, may implement information storage by any method or technology. The information may be computer readable instructions, data structures, modules of a program, or other data. Examples of storage media for a computer include, but are not limited to, phase change memory (PRAM), static Random Access Memory (SRAM), dynamic Random Access Memory (DRAM), other types of Random Access Memory (RAM), read Only Memory (ROM), electrically Erasable Programmable Read Only Memory (EEPROM), flash memory or other memory technology, compact disc read only memory (CD-ROM), digital Versatile Discs (DVD) or other optical storage, magnetic cassettes, magnetic tape magnetic disk storage or other magnetic storage devices, or any other non-transmission medium, which can be used to store information that can be accessed by a computing device. Computer-readable media, as defined herein, does not include transitory computer-readable media (transmission media), such as modulated data signals and carrier waves.
It should also be noted that the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising one … …" does not exclude the presence of other like elements in a process, method, article or apparatus that comprises the element.
The foregoing is merely exemplary of the present application and is not intended to limit the present application. Various modifications and variations of the present application will be apparent to those skilled in the art. Any modification, equivalent replacement, improvement, etc. which come within the spirit and principles of the application are to be included in the scope of the claims of the present application.
Claims (8)
1. A block data transmission method based on a block chain, the method comprising:
Constructing a blockchain platform, wherein the blockchain platform comprises a plurality of blockchain nodes, the plurality of blockchain nodes at least comprise user nodes, and the plurality of blockchain nodes divide a hierarchy based on a preset tree structure;
Determining a plurality of paths in which the user nodes are located in the tree structure;
Determining, for each path of the plurality of paths, a trust degree and a geographic distance between the user node and each blockchain node on the path to obtain an accumulated trust degree and an accumulated geographic distance corresponding to the path;
Screening a target path from the paths according to the accumulated trust degree and the accumulated geographic distance, and taking a terminal node of the target path as a target node;
Forwarding the block data carried by the user node to the target node through the forwarding node in the target path;
Determining each processing module contained in the target node, and carrying out random routing on the block data in the target node to obtain a target processing module, so that the block data is uplink through the target processing module;
before determining the pre-built blockchain, the method further includes:
Determining communication domains of a plurality of block chain nodes, listing block chain link points with intersections of the communication domains into the same block chain network, and determining a hierarchical structure corresponding to the block chain network according to the computing capability of each block chain node in the block chain network;
in other blockchain networks, determining cross-chain nodes with adjacent hierarchical relations with blockchain nodes in the blockchain networks according to hierarchical structures corresponding to the other blockchain networks;
According to the cross-chain node, establishing cross-chain communication between the other blockchain networks and the blockchain network to generate a tree structure for a plurality of blockchain networks;
determining a hierarchical structure corresponding to the blockchain network according to the computing capability of the blockchain node, wherein the hierarchical structure specifically comprises:
Sequencing the block chain nodes according to the computing power of the block chain nodes to obtain a corresponding computing power sequence, and selecting the block chain node with the largest computing power from the computing power sequence as a root node in a hierarchical structure corresponding to the block chain network;
Grouping the blockchain nodes with the same computing capacity according to the computing capacity sequence, and determining the hierarchy of the blockchain nodes in the grouping according to the computing capacity corresponding to the grouping; the blockchain nodes in the group are brother nodes;
Determining a connecting link corresponding to an adjacent block chain node in an adjacent level according to the geographic distance between an upper block chain node and a lower block chain node in the adjacent block chain nodes;
and determining a hierarchical structure in the blockchain network according to the root node, the hierarchy and the connecting links corresponding to the adjacent blockchain nodes.
2. The blockchain-based blockdata transmission method of claim 1, wherein determining each processing module included in the target node specifically includes:
uniformly slicing the target node to obtain different slices corresponding to the target node;
For different fragments, carrying out unique identification on the fragments, and carrying out hash encryption on the unique identification to obtain hash values corresponding to the fragments;
and dividing the fragments with equal corresponding values at the preset bit number of the hash value into the same processing module to obtain each processing module contained in the target node.
3. The blockchain-based block data transmission method of claim 2, wherein the block data is randomly routed in the target node to obtain a target processing module, and specifically includes:
randomly routing the block data to any processing module in an idle state, and taking the processing module as a target processing module;
Under the condition that the processing bandwidth value of the target processing module is smaller than the transmission bandwidth value required by the block data transmission, selecting the other processing module with the minimum communication connection number with the target processing module from the other processing modules in an idle state contained in the target node as a virtual processing module of the target processing module;
And performing auxiliary uplink operation on the block data through the virtual processing module.
4. The blockchain-based blockdata transmission method of claim 1, wherein after selecting a target path from the plurality of paths and taking an end node of the target path as a target node, the method further comprises:
carrying out hash encryption on the block data carried by the user node to obtain a user digest, and encrypting the user digest through a private key of the user node to obtain a digest tag corresponding to the block data;
Determining a transmission key between the user node and the target node, and packaging the block data through the transmission key to obtain specified block data;
obtaining a public key of the target node, encrypting the transmission key through the public key, and generating an encrypted multi-layer transmission key;
forwarding the digest tag, the specified chunk data, and the multi-layer transport key to the target node.
5. The blockchain-based blockdata transfer method of claim 1, wherein the trustworthiness includes a direct trustworthiness and an indirect trustworthiness;
determining the trust degree between the user node and each blockchain node on the path to obtain the accumulated trust degree corresponding to the path, wherein the method specifically comprises the following steps of:
acquiring a historical evaluation sequence of the user node, wherein the historical evaluation sequence comprises the direct trust degree of the user node on each blockchain node on the path;
According to the evaluated total number of each blockchain node on the path, carrying out weighted summation on the direct trust degree to obtain the indirect trust degree of each blockchain node;
determining a first weighting coefficient and a second weighting coefficient which correspond to the direct trust degree and the indirect trust degree respectively, and carrying out weighted summation on the direct trust degree and the indirect trust degree according to the first weighting coefficient and the second weighting coefficient to obtain standard trust degree;
And giving a time stamp to the standard trust degree to obtain the trust degree between the user node and each block link point on the path at different moments.
6. The blockchain-based blockdata transmission method of claim 1, wherein the selecting the target path from the plurality of paths according to the accumulated trust level and the accumulated geographic distance specifically includes:
Determining a first priority value and a second priority value corresponding to each path in the plurality of paths, wherein the first priority value corresponds to the accumulated trust degree of the paths, and the second priority value corresponds to the accumulated geographic distance of the paths;
And respectively determining a first weight and a second weight corresponding to the accumulated trust degree and the accumulated geographic distance, carrying out weighted summation on the accumulated trust degree and the accumulated geographic distance according to the first weight, the second weight, the first priority and the second priority so as to generate a path sequence to be selected according to a weighted summation result, and screening the path sequence to be selected to obtain a target path.
7. A blockchain-based block data transmission device, the device comprising:
At least one processor; and
A memory communicatively coupled to the at least one processor; wherein,
The memory stores instructions executable by the at least one processor to enable the at least one processor to:
Constructing a blockchain platform, wherein the blockchain platform comprises a plurality of blockchain nodes, the plurality of blockchain nodes at least comprise user nodes, and the plurality of blockchain nodes divide a hierarchy based on a preset tree structure;
Determining a plurality of paths in which the user nodes are located in the tree structure;
Determining, for each path of the plurality of paths, a trust degree and a geographic distance between the user node and each blockchain node on the path to obtain an accumulated trust degree and an accumulated geographic distance corresponding to the path;
Screening a target path from the paths according to the accumulated trust degree and the accumulated geographic distance, and taking a terminal node of the target path as a target node;
Forwarding the block data carried by the user node to the target node through the forwarding node in the target path;
Determining each processing module contained in the target node, and carrying out random routing on the block data in the target node to obtain a target processing module, so that the block data is uplink through the target processing module;
Before determining a pre-built blockchain, determining communication domains of a plurality of blockchain nodes, listing blockchain link points with intersections of the communication domains into the same blockchain network, and determining a hierarchical structure corresponding to the blockchain network according to the computing capability of each blockchain node in the blockchain network;
in other blockchain networks, determining cross-chain nodes with adjacent hierarchical relations with blockchain nodes in the blockchain networks according to hierarchical structures corresponding to the other blockchain networks;
According to the cross-chain node, establishing cross-chain communication between the other blockchain networks and the blockchain network to generate a tree structure for a plurality of blockchain networks;
determining a hierarchical structure corresponding to the blockchain network according to the computing capability of the blockchain node, wherein the hierarchical structure specifically comprises:
Sequencing the block chain nodes according to the computing power of the block chain nodes to obtain a corresponding computing power sequence, and selecting the block chain node with the largest computing power from the computing power sequence as a root node in a hierarchical structure corresponding to the block chain network;
Grouping the blockchain nodes with the same computing capacity according to the computing capacity sequence, and determining the hierarchy of the blockchain nodes in the grouping according to the computing capacity corresponding to the grouping; the blockchain nodes in the group are brother nodes;
Determining a connecting link corresponding to an adjacent block chain node in an adjacent level according to the geographic distance between an upper block chain node and a lower block chain node in the adjacent block chain nodes;
and determining a hierarchical structure in the blockchain network according to the root node, the hierarchy and the connecting links corresponding to the adjacent blockchain nodes.
8. A non-transitory computer storage medium storing computer-executable instructions, the computer-executable instructions configured to:
Constructing a blockchain platform, wherein the blockchain platform comprises a plurality of blockchain nodes, the plurality of blockchain nodes at least comprise user nodes, and the plurality of blockchain nodes divide a hierarchy based on a preset tree structure;
Determining a plurality of paths in which the user nodes are located in the tree structure;
Determining, for each path of the plurality of paths, a trust degree and a geographic distance between the user node and each blockchain node on the path to obtain an accumulated trust degree and an accumulated geographic distance corresponding to the path;
Screening a target path from the paths according to the accumulated trust degree and the accumulated geographic distance, and taking a terminal node of the target path as a target node;
Forwarding the block data carried by the user node to the target node through the forwarding node in the target path;
Determining each processing module contained in the target node, and carrying out random routing on the block data in the target node to obtain a target processing module, so that the block data is uplink through the target processing module;
Before determining a pre-built blockchain, determining communication domains of a plurality of blockchain nodes, listing blockchain link points with intersections of the communication domains into the same blockchain network, and determining a hierarchical structure corresponding to the blockchain network according to the computing capability of each blockchain node in the blockchain network;
in other blockchain networks, determining cross-chain nodes with adjacent hierarchical relations with blockchain nodes in the blockchain networks according to hierarchical structures corresponding to the other blockchain networks;
According to the cross-chain node, establishing cross-chain communication between the other blockchain networks and the blockchain network to generate a tree structure for a plurality of blockchain networks;
determining a hierarchical structure corresponding to the blockchain network according to the computing capability of the blockchain node, wherein the hierarchical structure specifically comprises:
Sequencing the block chain nodes according to the computing power of the block chain nodes to obtain a corresponding computing power sequence, and selecting the block chain node with the largest computing power from the computing power sequence as a root node in a hierarchical structure corresponding to the block chain network;
Grouping the blockchain nodes with the same computing capacity according to the computing capacity sequence, and determining the hierarchy of the blockchain nodes in the grouping according to the computing capacity corresponding to the grouping; the blockchain nodes in the group are brother nodes;
Determining a connecting link corresponding to an adjacent block chain node in an adjacent level according to the geographic distance between an upper block chain node and a lower block chain node in the adjacent block chain nodes;
and determining a hierarchical structure in the blockchain network according to the root node, the hierarchy and the connecting links corresponding to the adjacent blockchain nodes.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210103249.XA CN114520810B (en) | 2022-01-27 | 2022-01-27 | Block data transmission method, equipment and medium based on block chain |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210103249.XA CN114520810B (en) | 2022-01-27 | 2022-01-27 | Block data transmission method, equipment and medium based on block chain |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114520810A CN114520810A (en) | 2022-05-20 |
| CN114520810B true CN114520810B (en) | 2024-06-14 |
Family
ID=81596672
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210103249.XA Active CN114520810B (en) | 2022-01-27 | 2022-01-27 | Block data transmission method, equipment and medium based on block chain |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114520810B (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115567542B (en) * | 2022-12-01 | 2023-03-10 | 杭州蚂蚁酷爱科技有限公司 | Method and device for maintaining node set |
| CN116886404A (en) * | 2023-08-04 | 2023-10-13 | 中国电子信息产业集团有限公司第六研究所 | Satellite internet key management system and method |
| CN117093052B (en) * | 2023-10-17 | 2024-02-02 | 北京开源芯片研究院 | Clock signal transmission method, device, equipment and medium |
| CN117499017B (en) * | 2023-12-31 | 2024-03-22 | 湖南天河国云科技有限公司 | Block chain network transmission method, system, storage medium and terminal equipment |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109635165A (en) * | 2018-12-06 | 2019-04-16 | 北京磁云数字科技有限公司 | Data summarization method, device, equipment and medium based on tree-like block chain network |
| CN110602148A (en) * | 2019-10-10 | 2019-12-20 | 深圳前海微众银行股份有限公司 | Method and device for generating state tree of block and verifying data on chain |
Family Cites Families (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109218352B (en) * | 2017-06-30 | 2020-08-14 | 华为技术有限公司 | Consensus confirmation method and device for transaction information in blockchain network |
| CN109274667B (en) * | 2018-09-14 | 2020-06-23 | 阿里巴巴集团控股有限公司 | Copyright event evidence storing method and system based on block chain |
| WO2019179540A2 (en) * | 2019-07-11 | 2019-09-26 | Alibaba Group Holding Limited | Shared blockchain data storage |
| CN112860786A (en) * | 2019-11-27 | 2021-05-28 | 阿里健康信息技术有限公司 | Data processing method and device, computing node and storage medium |
| CN111163129B (en) * | 2019-12-05 | 2021-12-14 | 深圳前海微众银行股份有限公司 | Resource processing method and device based on cross-link network |
| SG11202010122TA (en) * | 2019-12-05 | 2020-11-27 | Alipay Hangzhou Inf Tech Co Ltd | Performing map iterations in blockchain-based system |
| CN111695223B (en) * | 2020-06-11 | 2023-03-03 | Ut斯达康通讯有限公司 | Network topology layout method and system |
| CN111769958B (en) * | 2020-09-02 | 2021-01-01 | 百度在线网络技术（北京）有限公司 | Block chain cross-chain processing method, device, equipment and storage medium |
| CN113872816B (en) * | 2021-09-30 | 2023-08-25 | 北京布洛克快链科技有限公司 | Equipment management system for industrial Internet |
| CN113643078B (en) * | 2021-10-14 | 2022-04-01 | 北京华宜信科技有限公司 | Block chain-based information value marking method, device, equipment and medium |
| CN113810507B (en) * | 2021-11-18 | 2022-02-15 | 南京信息工程大学 | Block chain credible node partitioning method based on IDE |
-
2022
- 2022-01-27 CN CN202210103249.XA patent/CN114520810B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109635165A (en) * | 2018-12-06 | 2019-04-16 | 北京磁云数字科技有限公司 | Data summarization method, device, equipment and medium based on tree-like block chain network |
| CN110602148A (en) * | 2019-10-10 | 2019-12-20 | 深圳前海微众银行股份有限公司 | Method and device for generating state tree of block and verifying data on chain |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114520810A (en) | 2022-05-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN114520810B (en) | Block data transmission method, equipment and medium based on block chain | |
| EP3353952B1 (en) | Managing groups of servers | |
| US9608913B1 (en) | Weighted load balancing in a multistage network | |
| US8681654B2 (en) | Methods and apparatus to design a survivable internet protocol link topology | |
| CN110690928B (en) | Quantum relay link virtualization method and device | |
| Kumar | Approximating circular arc colouring and bandwidth allocation in all-optical ring networks | |
| EP3189637B1 (en) | Search for disjoint paths through a network | |
| CN110690962B (en) | Application method and device of service node | |
| CN106416158B (en) | For the traffic engineered of large-scale data central site network | |
| WO2010127527A1 (en) | Method and apparatus for implementing k-shortest paths algorithm in the case of existing multiple edges between adjacent nodes | |
| CN106576065A (en) | Automatic division of internet protocol radio access networks to interior gateway protocol areas | |
| KR101472320B1 (en) | Method for data security using secret sharing system in cloud environments | |
| CN109167637B (en) | Key pool filling resource determination method, device, equipment and readable storage medium | |
| US10474644B2 (en) | Systems and methods for optimizing selection of a replication data node in a distributed file system | |
| Delgado Peris et al. | Evaluation of alternatives for the broadcast operation in Kademlia under churn | |
| Wang et al. | Coding-aware virtual network mapping for surviving single link failure | |
| US20080091740A1 (en) | Method for managing a partitioned database in a communication network | |
| US10218538B1 (en) | Hybrid Clos-multidimensional topology for data center networks | |
| CN115567542B (en) | Method and device for maintaining node set | |
| Cho et al. | Minimizing protection switching time in transport networks with shared mesh protection | |
| CN114172638A (en) | Quantum encryption communication method based on multi-model data fusion | |
| CN112367161A (en) | Relay node function virtualization method and device | |
| CN115550251B (en) | Block chain network, node set maintenance method and device | |
| CN115567541B (en) | Block chain network, node set maintenance method and device | |
| Singh et al. | P-skip graph: An efficient data structure for peer-to-peer network |
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 | ||
| CB02 | Change of applicant information |
Country or region after: China Address after: 250101 19th floor, building S02, Inspur Science Park, No. 1036, Inspur Road, high tech Zone, Jinan, Shandong Province Applicant after: Inspur industrial Internet Co.,Ltd. Address before: 250101 19th floor, building S02, Inspur Science Park, No. 1036, Inspur Road, high tech Zone, Jinan, Shandong Province Applicant before: Shandong Inspur industrial Internet Industry Co.,Ltd. Country or region before: China |
|
| CB02 | Change of applicant information | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |