CN114520810A - Block chain-based block data transmission method, equipment and medium - Google Patents
Block chain-based block data transmission method, equipment and medium Download PDFInfo
- Publication number
- CN114520810A CN114520810A CN202210103249.XA CN202210103249A CN114520810A CN 114520810 A CN114520810 A CN 114520810A CN 202210103249 A CN202210103249 A CN 202210103249A CN 114520810 A CN114520810 A CN 114520810A
- Authority
- CN
- China
- Prior art keywords
- block chain
- node
- target
- path
- block
- 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.)
- Granted
Links
- 230000005540 biological transmission Effects 0.000 title claims abstract description 63
- 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 15
- 238000004891 communication Methods 0.000 claims description 36
- 239000012634 fragment Substances 0.000 claims description 16
- 238000011156 evaluation Methods 0.000 claims description 13
- 238000004364 calculation method Methods 0.000 claims description 12
- 239000000126 substance Substances 0.000 claims description 3
- 238000012163 sequencing technique Methods 0.000 claims description 2
- 238000005457 optimization Methods 0.000 abstract 1
- 238000010586 diagram Methods 0.000 description 10
- 238000004590 computer program Methods 0.000 description 7
- 230000006870 function Effects 0.000 description 5
- 230000009286 beneficial effect Effects 0.000 description 4
- 238000005516 engineering process Methods 0.000 description 4
- 230000008569 process Effects 0.000 description 4
- 238000012546 transfer Methods 0.000 description 4
- 230000001186 cumulative effect Effects 0.000 description 3
- 230000000694 effects Effects 0.000 description 3
- 230000008859 change 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
- 238000004422 calculation algorithm Methods 0.000 description 1
- 230000015556 catabolic process Effects 0.000 description 1
- 230000003247 decreasing effect 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
- 230000006855 networking Effects 0.000 description 1
- 238000004806 packaging method and process Methods 0.000 description 1
- 230000000750 progressive effect Effects 0.000 description 1
- 230000002441 reversible effect Effects 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
Images
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)
- Data Exchanges In Wide-Area Networks (AREA)
- Mobile Radio Communication Systems (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 optimization of data transmission performance on the whole level and the reduction of data transmission efficiency is difficult to meet the requirements of users. The method comprises the following steps: building a block chain platform; determining a plurality of paths of user nodes in a tree structure; determining the trust and the geographic distance between the user node and each block chain link point on the path aiming at each path in the paths to obtain the accumulated trust and the accumulated geographic distance corresponding to the path; screening a target path from the multiple paths according to the accumulated trust and the accumulated geographic distance, and taking a terminal node of the target path as a target node; forwarding block data carried by a user node to a target node; and determining each processing module contained in the target node, and performing random routing on the block data in the target node to obtain the target processing module.
Description
Technical Field
The present application relates to the field of block chain technology, and in particular, to a block chain-based block data transmission method, device, and medium.
Background
The block chain is used as a novel data storage mode, and decentralization, non-falsification and non-falsification of data are realized through 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 block chain performs data communication between nodes, the difference between the transmission performance and reliability of each node is not considered, the data transmission performance is not optimized on the whole level, and when the number of the block chain nodes is large or the network traffic reaches a high peak value, the data transmission efficiency is low, and it is difficult to meet the user's requirement.
Disclosure of Invention
In order to solve the above problem, the present application provides a method for transmitting block data based on a block chain, including: 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 are divided into levels based on a preset tree structure; determining a plurality of paths of user nodes in a tree structure; determining the trust and the geographical distance between a user node and each block link point on the path aiming at each path in a plurality of paths so as to obtain the accumulated trust and the accumulated geographical distance corresponding to the path; screening a target path from the multiple paths according to the accumulated trust 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 a target node through a forwarding node in a target path; and determining each processing module contained in the target node, and performing 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 an 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 the same corresponding value at the preset digit of the hash value into the same processing module to obtain each processing module contained in the target node.
In an implementation manner of the present application, performing random routing on block data in a target node to obtain a target processing module 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 least number of communication connections 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 manner of the present application, after a target path is screened from multiple paths and an end node of the target path is taken as a target node, the method further includes: carrying out Hash encryption on block data carried by a user node to obtain a user abstract, and encrypting the user abstract through a private key of the user node to obtain an abstract label corresponding to the block data; determining a transmission key between a user node and a target node, and encapsulating the block data through the transmission key to obtain appointed block data; acquiring a public key of a target node, encrypting the transmission key through the public key, and generating an encrypted multi-layer transmission key; and forwarding the digest label, the specified block data and the multi-layer transmission key to the target node.
In one implementation of the present application, the trust level includes a direct trust level and an indirect trust level; determining the trust between the user node and each block link point on the path to obtain the accumulated trust corresponding to the path, specifically comprising: 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 block chain node on the path; according to the total evaluated number of each block chain node on the path, carrying out weighted summation on the direct trust to obtain the indirect trust of each block chain node; determining a first weighting coefficient and a second weighting coefficient respectively corresponding to the direct trust and the indirect trust, and performing weighted summation on the direct trust and the indirect trust according to the first weighting coefficient and the second weighting coefficient to obtain standard trust; and giving a time stamp to the standard trust to obtain the trust between the user node and each block link point on the path at different times.
In an implementation manner of the present application, the method for screening a target path from multiple paths according to the accumulated confidence and the accumulated geographic distance specifically includes: aiming at each path in the multiple paths, determining a first priority value and a second priority value corresponding to the path, wherein the first priority value corresponds to the accumulated trust of the path, and the second priority value corresponds to the accumulated geographic distance of the path; and respectively determining a first weight and a second weight corresponding to the accumulated trust and the accumulated geographic distance, performing weighted summation on the accumulated trust and the accumulated geographic distance according to the first weight, the second weight, the first priority and the second priority, generating a to-be-selected path sequence according to a weighted summation result, and screening from the to-be-selected path sequence to obtain a target path.
In one implementation of the present application, before determining the pre-constructed blockchain, the method further includes: determining communication domains of a plurality of block chain nodes, listing block chain link points with intersection in the communication domains into the same block chain network, and determining a hierarchical structure corresponding to the block chain network according to the calculation capacity of each block chain node in the block chain network; in other block chain networks, determining cross-link nodes with adjacent hierarchical relation with block chain link points in the block chain network according to the hierarchical structures corresponding to the other block chain networks; according to the cross-link nodes, cross-link communication between other blockchain networks and blockchain networks is established so as to generate a tree structure aiming at the plurality of blockchain networks.
In an implementation manner of the present application, determining a hierarchical structure corresponding to a blockchain network according to a computation capability of a blockchain node specifically includes: sequencing the block chain link points according to the calculation capacity of the block chain nodes to obtain a corresponding calculation capacity sequence, and selecting the block chain node with the maximum calculation capacity from the calculation capacity sequence as a root node in a hierarchical structure corresponding to the block chain network; according to the computing power sequence, grouping the block chain link points with the same computing power, and determining the level of the block chain link points in the group according to the computing power corresponding to the group; the block chain link points in the group are brother nodes; aiming at adjacent block chain nodes in adjacent levels, determining connecting links corresponding to the adjacent block chain nodes according to the geographic distance between an upper-level block chain node and a lower-level block chain node in the adjacent block chain nodes; and determining a hierarchical structure in the block chain network according to the root node, the hierarchy and the connecting links corresponding to the adjacent block chain link points.
The embodiment of the application provides block data transmission equipment based on a block chain, and the equipment comprises:
at least one processor; and the number of the first and second groups,
a memory communicatively coupled to the at least one processor; wherein the content of the first and second substances,
the memory stores instructions executable by the at least one processor to cause 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 are divided into levels based on a preset tree structure;
determining a plurality of paths of the user nodes in the tree structure;
determining the trust and the geographical distance between a user node and each block link point on the path aiming at each path in a plurality of paths so as to obtain the accumulated trust and the accumulated geographical distance corresponding to the path;
screening a target path from the multiple paths according to the accumulated trust 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 a target node through a forwarding node in a target path;
and determining each processing module contained in the target node, and performing 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.
An embodiment of the present application provides a non-volatile computer storage medium, in which computer-executable instructions are stored, and the computer-executable instructions are set 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 are divided into levels based on a preset tree structure;
determining a plurality of paths of the user nodes in the tree structure;
determining the trust and the geographical distance between a user node and each block link point on the path aiming at each path in a plurality of paths so as to obtain the accumulated trust and the accumulated geographical distance corresponding to the path;
screening a target path from the multiple paths according to the accumulated trust and the accumulated geographic distance, and taking a terminal node of the target path as a target node;
forwarding block data carried by a user node to a target node through a forwarding node in a target path;
and determining each processing module contained in the target node, and performing 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 block data transmission equipment and the block data transmission medium based on the block chains have the following beneficial effects that:
by establishing a tree structure among the block chain nodes, networking and layering the block chain link points, so that communication interruption of the whole block chain network can not be caused while the individual block chain link points fail, and the fault tolerance is stronger; when the target path is determined, the trust 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 reliability, the usability and the practicability are stronger, block data can be transmitted only on a certain path through the communication between the user node and the target node at the tail end of the selected target path, the repeated data transmission is avoided, the block data can be transmitted only 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 the link points of different blocks 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 application, illustrate embodiment(s) of the application and together with the description serve to explain the application and not to limit the application. In the drawings:
fig. 1 is a schematic flowchart of a block data transmission method based on a block chain according to an embodiment of the present disclosure;
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 disclosure.
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 described in detail and completely with reference to the following specific embodiments of the present application and the accompanying drawings. It should be apparent that the described embodiments are only some of the embodiments of the present application, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.
The technical solutions provided by the embodiments of the present application are described in detail below 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: and constructing a block chain platform.
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 carry out uplink on 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 using a tree topology, and each blockchain node may be hierarchically divided based on a predetermined tree structure. The tree structure is a virtual logic structure planned in advance according to actual communication requirements, and can be a multi-branch tree or a binary tree structure, and various tree structures do not change the actual physical structures among the block chain nodes. To pre-construct a tree structure between blockchain nodes, a communication domain of a plurality of blockchain nodes needs to be pre-determined by a blockchain platform, where the communication domain is determined according to a historical communication range of each blockchain node. And listing the block chain nodes with intersection of the communication domains into the same block chain network, so that the block chain nodes in the same block chain network have overlapped communication areas with each other, thereby being capable of communicating with each other within the coverage area of the block chain network.
And for each block chain network, determining the corresponding internal hierarchical structure of the block chain network according to the computing power among the block chain nodes. Specifically, the block chain link points are sorted according to the calculation capacity of the block chain nodes to obtain a corresponding calculation capacity sequence, and the block chain node with the largest calculation capacity is selected from the calculation capacity sequence and used as a root node in a hierarchical structure corresponding to the block chain network. And then according to the computing power sequence, grouping the block chain link points with the same computing power, and according to the computing power corresponding to the grouping, determining the level of the block chain link points in the grouping. For example, assuming that there are five blockchain nodes a-E in total, the computing capabilities thereof are respectively sorted to obtain a computing capability sequence A, C, E, D, B, where the computing capability of blockchain node a is 80% strongest, the computing capabilities of blockchain nodes C and E are both 50%, the computing capability of blockchain node D is 45%, and the computing capability of blockchain node B is 30%. Then, block chain node a is the root node of the block chain network, and block chain nodes C and E in the same group have the next calculation capability to the root node, and can be divided into the next level of the hierarchy of the root node, and since the block chain nodes C and E have the same calculation capability, they are siblings of each other.
Further, for adjacent block chain nodes in adjacent levels, according to the geographical distance between a superior block chain link point and a subordinate block chain link point in the adjacent block chain node, a connection link corresponding to the adjacent block chain link point is determined, and after a root node, the level where each block chain link point is located and the connection link corresponding to the adjacent block chain link point are determined, the hierarchical structure in the block chain network can be determined. For example, the hierarchy of the block link point D is located at the next level of the block chain nodes C and E, and whether the block chain node D is to be connected after the block chain node C or after the block chain node E depends on the geographical distance between the block link point D and its previous block chain node. The geographical distance refers to the actual distance between the block chain nodes, and the shorter the geographical distance is, the shorter the communication delay time is for the upper and lower block chain nodes, so that when determining the connection link, the lower block chain node should preferentially select the upper block chain node with the shortest geographical distance to connect.
The interconnection between local area blockchain nodes is realized by constructing a blockchain network, but for different blockchain networks, the blockchain networks are closed communication systems, and the blockchain nodes can only communicate and trade in the networks to which the blockchain nodes belong, so that an information isolated island is easily formed. Therefore, in order to implement communication between independent blockchain networks, the blockchain platform needs to determine, in other blockchain networks, a cross-chain node having an adjacent hierarchical relationship with a blockchain link point in the blockchain network according to a 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 as to generate a tree structure for the plurality of blockchain networks. The inter-link node may be a node on another blockchain network, or may be a node on the blockchain network, and any node that has an adjacent hierarchical relationship and can communicate by an inter-link protocol may be used as the inter-link node.
The logical communication between the block chain nodes is carried out by constructing the tree structure, so that the communication mode is more flexible, the communication paralysis can not be caused under the condition that individual block chain nodes fail, in addition, no loop exists in the tree structure, the block data can only be transmitted between adjacent nodes according to a path, the phenomenon of data repeated transmission can not occur, and the data transmission efficiency is improved.
S102: a plurality of paths in the tree structure where the user nodes are located are determined.
The multiple paths where the user nodes are located are generally obtained by taking the user nodes as starting points and traversing in the forward direction according to a preset tree structure. However, for the user node at the end node, the path where the user node is located may also be multiple paths obtained by performing reverse traversal according to a preset tree structure, or a path with an inflection point obtained by using the user node as a starting point and using any end node as an end point.
S103: and determining the trust and the geographical distance between the user node and each block link point on the path aiming at each path in the plurality of paths so as to obtain the accumulated trust and the accumulated geographical distance corresponding to the path.
The multiple paths corresponding to each user node all comprise at least one block chain node. In the block chain, different trust degrees exist between the user node and each block chain link point on the path where the user node is located, and the trust degrees are represented by whether the block chain node can tamper with information or not, whether a block chain network can be damaged maliciously or not and the like. The good trust level is a precondition for realizing data transmission, so in order to guarantee the communication performance and reliability of data transmission, when block data carried by a user node is uplink, performance evaluation and path selection need to be carried out through the accumulated trust level and the accumulated geographic distance of the path where the user node is located.
The trust degree comprises direct trust degree and indirect trust degree, the direct trust degree refers to a direct trust relationship between the user node and the block chain node on the path where the user node is located, and the trust degree can be determined by acquiring a historical evaluation sequence of the user node. Each block chain node corresponds to a self historical evaluation sequence, all evaluations initiated by the block chain node except the self are stored, and the evaluation indexes comprise communication time, communication congestion degree, communication reliability and the like. The indirect trust degree is embodied in the reliability degree of each block chain node on the path where the user node is located, for each block chain node, the total evaluated evaluation number of the block chain node can be determined by acquiring the historical evaluation sequence of other block chain nodes on the block chain network, and then the direct trust degree between the user node and the block chain node is weighted and summed through the ratio of the evaluation number of the block chain node to the total evaluated evaluation number of other block chain nodes, so that the indirect trust degree of the block chain node is obtained. It can be known that the more times the blockchain node is evaluated, the greater the indirect trust level. And respectively determining a first weighting coefficient and a second weighting coefficient corresponding to the direct trust and the indirect trust, carrying out weighted summation on the direct trust and the indirect trust according to the first weighting coefficient and the second weighting coefficient, and giving a time stamp to the standard trust obtained by the weighted summation, thereby obtaining the trust between the user node and each block link point on the path where the user node is located at different times. It should be noted that the trust level between the user node and other blockchain nodes is gradually decreased over time.
S104: and screening out a target path from the multiple paths according to the accumulated trust and the accumulated geographic distance, and taking the end node of the target path as a target node.
And summing the corresponding trust degrees of all block chain link points on the path where the user node is located to obtain the cumulative trust degree corresponding to the path, and summing the geographical distances between the user node and all block chain link points on the path where the user node is located to obtain the cumulative geographical distance corresponding to the path. For each path, the blockchain platform can determine a first priority value and a second priority value by sorting according to the accumulated trust and the accumulated geographic distance respectively corresponding to each path, wherein the first priority value corresponds to the accumulated trust of the path, and the second priority value corresponds to the accumulated geographic distance of the path. For example, the user nodes are located on five paths a-e, the accumulated trust degrees of the paths are sequentially arranged as a path c, a path d, a path b, a path e, and a path a from large to small, and the corresponding first priority values may be set to 5, 4, 3, 2, and 1; the cumulative communication distances are arranged in order of path e, path d, path a, path b, and path c from small to large, and the corresponding second priority values are also set to 5, 4, 3, 2, and 1 in order.
The block chain platform can determine a first weight and a second weight corresponding to the accumulated trust and the accumulated geographic distance according to the actual application requirements, when the user node needs to emphasize and ensure the data transmission quality, the first weight is larger, and similarly, when the user node emphasizes 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 to-be-selected path sequence according to the result of the weighted summation, screening the path with the maximum corresponding summation result in the to-be-selected path sequence as a target path, and enabling the accumulated trust degree of the target path to be maximum and the accumulated geographic distance to be minimum. It should be noted that, the path with the largest summation result is selected as the target path for the previously listed examples, and for the case that the accumulated confidence is smaller, the accumulated geographic distance is larger, and the priority value is larger, the path with the smallest summation result needs to be 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 and is used for uplink transmission of the block data carried by the user node. And other blockchain nodes except the user node and the target node on the target path are forwarding nodes and are used for forwarding the blockchain nodes to the target node.
S106: and determining each processing module contained in the target node, and performing 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 block chain provided by the embodiment of the application, for a target node, a block chain platform can uniformly slice the target node, so that different fragments corresponding to the target node are obtained, and each fragment has a data processing function carried 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. The fragments with the same corresponding value at the preset bit number of the hash value are divided into the same processing module, for example, the fragments with the same two-bit numerical value 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 the difference of the hash value, and the processing modules bear different data processing capabilities due to the difference of the number of the fragments. The inside of each block link point is divided into a plurality of processing modules, and based on the processing modules, each block link point can realize concurrent communication with different block link points, so that the data transmission efficiency is further improved, the fault tolerance is stronger, and the phenomenon of communication breakdown under the abnormal condition of a certain processing module is avoided.
After the block data of the user node is forwarded to the target node, random routing is performed on the block data 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 uplinked through the target processing module. And under the condition that the processing bandwidth value of the target processing module routed randomly is smaller than the transmission bandwidth value required by block data transmission, selecting other processing modules with the least number of communication connections 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 modules so as to ensure the integrity of the block data. It should be noted that the number of communication connections indicates the number of times of transfer between different processing modules, and is related to the number of transfer devices, and another processing module with the smallest number of communication connections is selected to perform the auxiliary uplink operation, so that the number of times 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 performs hash encryption on the blockdata carried by the user node to obtain a user digest, and encrypts the user digest through a private key of the user node to obtain a digest tag corresponding to the blockdata. And then determining a transmission key between the user node and the target node, packaging the block data through the transmission key to obtain appointed block data, and encrypting the transmission key through a public key of the target node to generate an encrypted multi-layer transmission key. When block data is transmitted, the digest label, the designated block data and the multi-layer transmission key are forwarded to the target node through the forwarding node, so that after the target node receives a corresponding data packet, the transmission key can be obtained through a private key of the target node, then the block data is obtained through decryption of the transmission key, a user digest is obtained through a public key of the user node, and whether the block data which is transmitted currently is tampered or not is determined through comparing a result obtained after the block data is subjected to hash encryption with the user digest. By encrypting the transmission key and secondarily encapsulating the block data, the data can be further prevented from being tampered, and the safety of data transmission is improved.
The above is the method embodiment proposed by the present application. Based on the same idea, some embodiments of the present application further 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 disclosure. As shown in fig. 2, includes:
at least one processor; and the number of the first and second groups,
a memory communicatively coupled to the at least one processor; wherein the content of the first and second substances,
the memory stores instructions executable by the at least one processor to cause 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 are divided into levels based on a preset tree structure;
determining a plurality of paths of user nodes in a tree structure;
determining the trust and the geographical distance between a user node and each block link point on the path aiming at each path in a plurality of paths so as to obtain the accumulated trust and the accumulated geographical distance corresponding to the path;
screening a target path from the multiple paths according to the accumulated trust 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 a target node through a forwarding node in a target path;
and determining each processing module contained in the target node, and performing 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.
A non-volatile computer storage medium provided in an embodiment of the present application stores computer-executable instructions 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 are divided into levels based on a preset tree structure;
determining a plurality of paths of user nodes in a tree structure;
determining the trust and the geographical distance between a user node and each block link point on the path aiming at each path in a plurality of paths so as to obtain the accumulated trust and the accumulated geographical distance corresponding to the path;
screening a target path from the multiple paths according to the accumulated trust 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 a target node through a forwarding node in a target path;
and determining each processing module contained in the target node, and performing 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 in the present application are described in a progressive manner, and the same and similar parts among the embodiments can be referred to each other, and each embodiment focuses on the differences from the other embodiments. In particular, for the device and media embodiments, the description is relatively simple as it is substantially similar to the method embodiments, and reference may be made to some descriptions of the method embodiments for relevant points.
The device and the medium provided by the embodiment of the application correspond to the method one to one, so the device and the medium also have the similar beneficial technical effects as the corresponding method, and the beneficial technical effects of the method are explained in detail above, so the beneficial technical effects of the device and the medium are not repeated herein.
As will be appreciated by one skilled in the art, 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 flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams 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 a typical configuration, a computing device includes one or more processors (CPUs), input/output interfaces, network interfaces, and memory.
The memory may include forms of volatile memory in a computer readable medium, Random Access Memory (RAM) and/or non-volatile memory, such as Read Only Memory (ROM) or flash memory (flash RAM). Memory is an example of a computer-readable medium.
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 computer storage media 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 that can be used to store information that can be accessed by a computing device. As defined herein, a computer readable medium does not include a transitory computer readable medium such as a modulated data signal and a carrier wave.
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 an … …" does not exclude the presence of other identical elements in the process, method, article, or apparatus that comprises the element.
The above description is only an example of the present application and is not intended to limit the present application. Various modifications and changes may occur to those skilled in the art. Any modification, equivalent replacement, improvement or the like made within the spirit and principle of the present application shall be included in the scope of the claims of the present application.
Claims (10)
1. A block chain-based block data transmission method, the method 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 are divided into levels based on a preset tree structure;
determining a plurality of paths in the tree structure where the user nodes are located;
determining the trust degree and the geographical distance between the user node and each block chain node on the path aiming at each path in the paths so as to obtain the accumulated trust degree and the accumulated geographical distance corresponding to the path;
screening a target path from the multiple paths according to the accumulated trust 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 a forwarding node in the target path;
determining each processing module contained in the target node, and performing 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.
2. The method according to 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;
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 the same corresponding value at the preset digit of the hash value into the same processing module to obtain each processing module contained in the target node.
3. The method according to claim 2, wherein the randomly routing the block data in the target node to obtain a target processing module comprises:
randomly routing the block data to any processing module in an idle state, and taking the processing module as a target processing module;
when the processing bandwidth value of the target processing module is smaller than the transmission bandwidth value required by the block data transmission, selecting, from other processing modules in an idle state included in the target node, the other processing module with the smallest number of communication connections with the target processing module 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 method according to claim 1, wherein after the target path is selected from the plurality of paths and the end node of the target path is used as the target node, the method further comprises:
carrying out Hash encryption on block data carried by the user node to obtain a user abstract, and encrypting the user abstract through a private key of the user node to obtain an abstract label corresponding to the block data;
determining a transmission key between the user node and the target node, and encapsulating the block data through the transmission key to obtain specified block data;
acquiring 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 designated block data, and the multi-layer transmission key to the target node.
5. A block chain-based block data transmission method according to claim 1, wherein the confidence level includes a direct confidence level and an indirect confidence level;
determining the trust level between the user node and each block chain node on the path to obtain the accumulated trust level corresponding to the path, specifically comprising:
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 block link point on the path;
according to the total evaluated number of each block chain node on the path, carrying out weighted summation on the direct trust to obtain the indirect trust of each block chain node;
determining a first weighting coefficient and a second weighting coefficient respectively corresponding to the direct trust and the indirect trust, and performing weighted summation on the direct trust and the indirect trust according to the first weighting coefficient and the second weighting coefficient to obtain standard trust;
and giving a time stamp to the standard trust level to obtain the trust levels between the user node and each block chain link point on the path at different times.
6. A block chain-based block data transmission method according to claim 1, wherein the step of screening out a target path from the plurality of paths according to the accumulated confidence 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 of the path, and the second priority value corresponds to the accumulated geographic distance of the path;
respectively determining a first weight and a second weight corresponding to the accumulated trust and the accumulated geographic distance, performing weighted summation on the accumulated trust and the accumulated geographic distance according to the first weight, the second weight, the first priority and the second priority, generating a path sequence to be selected according to a weighted summation result, and screening from the path sequence to be selected to obtain a target path.
7. A method for block chain based block data transmission according to claim 1, wherein before determining the pre-constructed block chain, the method further comprises:
determining communication domains of a plurality of block chain nodes, listing block chain link points with intersection in the communication domains into the same block chain network, and determining a hierarchical structure corresponding to the block chain network according to the calculation capacity of each block chain node in the block chain network;
in other block chain networks, determining cross-chain nodes having adjacent hierarchical relations with block chain link points in the block chain network according to the hierarchical structures corresponding to the other block chain networks;
and establishing cross-chain communication between the other blockchain networks and the blockchain network according to the cross-chain nodes so as to generate a tree structure aiming at a plurality of blockchain networks.
8. A method as claimed in claim 7, wherein determining the corresponding hierarchical structure of the blockchain network according to the computation capability of the blockchain node 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 maximum computing power from the computing power sequence as a root node in a hierarchical structure corresponding to the block chain network;
according to the computing power sequence, grouping the block chain link points with the same computing power, and according to the computing power corresponding to the grouping, determining the level of the block chain link points in the grouping; the block chain link points in the group are brother nodes;
aiming at adjacent block chain nodes in adjacent levels, determining connecting links corresponding to the adjacent block chain nodes according to the geographic distance between an upper-level block chain node and a lower-level block chain node in the adjacent block chain nodes;
and determining a hierarchical structure in the block chain network according to the root node, the hierarchy and the connecting links corresponding to the adjacent block chain links.
9. A block chain-based block data transmission apparatus, the apparatus comprising:
at least one processor; and the number of the first and second groups,
a memory communicatively coupled to the at least one processor; wherein the content of the first and second substances,
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 are divided into levels based on a preset tree structure;
determining a plurality of paths in the tree structure where the user nodes are located;
determining the trust degree and the geographical distance between the user node and each block chain node on the path aiming at each path in the paths so as to obtain the accumulated trust degree and the accumulated geographical distance corresponding to the path;
screening a target path from the multiple paths according to the accumulated trust 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 a forwarding node in the target path;
determining each processing module contained in the target node, and performing 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.
10. A non-transitory computer storage medium storing computer-executable instructions, the computer-executable instructions 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 are divided into levels based on a preset tree structure;
determining a plurality of paths in the tree structure where the user nodes are located;
determining the trust degree and the geographical distance between the user node and each block chain node on the path aiming at each path in the paths so as to obtain the accumulated trust degree and the accumulated geographical distance corresponding to the path;
screening a target path from the multiple paths according to the accumulated trust 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 a forwarding node in the target path;
determining each processing module contained in the target node, and performing 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.
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 true CN114520810A (en) | 2022-05-20 |
| CN114520810B 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) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115567542A (en) * | 2022-12-01 | 2023-01-03 | 杭州蚂蚁酷爱科技有限公司 | Node set maintenance method and device |
| CN116886404A (en) * | 2023-08-04 | 2023-10-13 | 中国电子信息产业集团有限公司第六研究所 | Satellite internet key management system and method |
| CN117093052A (en) * | 2023-10-17 | 2023-11-21 | 北京开源芯片研究院 | Clock signal transmission method, device, equipment and medium |
| CN117499017A (en) * | 2023-12-31 | 2024-02-02 | 湖南天河国云科技有限公司 | Block chain network transmission method, system, storage medium and terminal equipment |
Citations (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2019001131A1 (en) * | 2017-06-30 | 2019-01-03 | 华为技术有限公司 | Consensus based confirmation method and device for transaction information in block chain network |
| 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 |
| CN111695223A (en) * | 2020-06-11 | 2020-09-22 | Ut斯达康通讯有限公司 | Network topology layout method and system |
| CN111769958A (en) * | 2020-09-02 | 2020-10-13 | 百度在线网络技术（北京）有限公司 | Block chain cross-chain processing method, device, equipment and storage medium |
| US20210012336A1 (en) * | 2019-07-11 | 2021-01-14 | Advanced New Technologies Co., Ltd. | Shared blockchain data storage |
| US20210051011A1 (en) * | 2019-12-05 | 2021-02-18 | Alipay (Hangzhou) Information Technology Co., Ltd. | Performing map iterations in a blockchain-based system |
| US20210110493A1 (en) * | 2018-09-14 | 2021-04-15 | Advanced New Technologies Co., Ltd. | Method and system of storing record of copyright event based on blockchain |
| CN112860786A (en) * | 2019-11-27 | 2021-05-28 | 阿里健康信息技术有限公司 | Data processing method and device, computing node and storage medium |
| WO2021109735A1 (en) * | 2019-12-05 | 2021-06-10 | 深圳前海微众银行股份有限公司 | Cross-chain-network-based resource processing method, and device |
| CN113643078A (en) * | 2021-10-14 | 2021-11-12 | 北京华宜信科技有限公司 | Block chain-based information value marking method, device, equipment and medium |
| CN113810507A (en) * | 2021-11-18 | 2021-12-17 | 南京信息工程大学 | Block chain credible node partitioning method based on IDE |
| CN113872816A (en) * | 2021-09-30 | 2021-12-31 | 赵静 | Equipment management system for industrial internet |
-
2022
- 2022-01-27 CN CN202210103249.XA patent/CN114520810B/en active Active
Patent Citations (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2019001131A1 (en) * | 2017-06-30 | 2019-01-03 | 华为技术有限公司 | Consensus based confirmation method and device for transaction information in block chain network |
| US20210110493A1 (en) * | 2018-09-14 | 2021-04-15 | Advanced New Technologies Co., Ltd. | Method and system of storing record of copyright event based on blockchain |
| CN109635165A (en) * | 2018-12-06 | 2019-04-16 | 北京磁云数字科技有限公司 | Data summarization method, device, equipment and medium based on tree-like block chain network |
| US20210012336A1 (en) * | 2019-07-11 | 2021-01-14 | Advanced New Technologies Co., Ltd. | Shared blockchain data storage |
| CN110602148A (en) * | 2019-10-10 | 2019-12-20 | 深圳前海微众银行股份有限公司 | Method and device for generating state tree of block and verifying data on chain |
| WO2021068728A1 (en) * | 2019-10-10 | 2021-04-15 | 深圳前海微众银行股份有限公司 | Methods and apparatus for generating state tree of block and validating on-chain data |
| CN112860786A (en) * | 2019-11-27 | 2021-05-28 | 阿里健康信息技术有限公司 | Data processing method and device, computing node and storage medium |
| US20210051011A1 (en) * | 2019-12-05 | 2021-02-18 | Alipay (Hangzhou) Information Technology Co., Ltd. | Performing map iterations in a blockchain-based system |
| WO2021109735A1 (en) * | 2019-12-05 | 2021-06-10 | 深圳前海微众银行股份有限公司 | Cross-chain-network-based resource processing method, and device |
| CN111695223A (en) * | 2020-06-11 | 2020-09-22 | Ut斯达康通讯有限公司 | Network topology layout method and system |
| CN111769958A (en) * | 2020-09-02 | 2020-10-13 | 百度在线网络技术（北京）有限公司 | Block chain cross-chain processing method, device, equipment and storage medium |
| CN113872816A (en) * | 2021-09-30 | 2021-12-31 | 赵静 | Equipment management system for industrial internet |
| CN113643078A (en) * | 2021-10-14 | 2021-11-12 | 北京华宜信科技有限公司 | Block chain-based information value marking method, device, equipment and medium |
| CN113810507A (en) * | 2021-11-18 | 2021-12-17 | 南京信息工程大学 | Block chain credible node partitioning method based on IDE |
Non-Patent Citations (8)
| Title |
|---|
| MUHAMMAD SIDDIQI等: "Secure Opportunistic Contextual Logging for Wearable Healthcare Sensing Devices", 《 IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING》, 9 July 2019 (2019-07-09) * |
| ZHENG CHEN: "Fast botnet detection from streaming logs using online lanczos method", 《2017 IEEE INTERNATIONAL CONFERENCE ON BIG DATA》, 15 January 2018 (2018-01-15) * |
| 余珺瑞: "基于区块链技术信誉评价机制的研究与应用", 《硕士电子期刊出版信息》, 15 February 2021 (2021-02-15) * |
| 刘江;霍如;李诚成;邹贵今;黄韬;刘韵洁;: "基于命名数据网络的区块链信息传输机制", 通信学报, no. 01, 25 January 2018 (2018-01-25) * |
| 段靓;吕鑫;刘凡;: "基于信任委托的区块链分层共识优化", 计算机工程, no. 10, 15 October 2020 (2020-10-15) * |
| 王亮;贺朗月;牛敬华;: "基于区块链的地学大数据管理", 国防科技, no. 02, 20 April 2018 (2018-04-20) * |
| 翟峰;杨挺;曹永峰;李双全;: "基于区块链与K-means算法的智能电表密钥管理方法", 电力自动化设备, no. 08, 31 December 2020 (2020-12-31) * |
| 翟社平;李兆兆;段宏宇;高山;: "区块链关键技术中的数据一致性研究", 计算机技术与发展, no. 09, 28 April 2018 (2018-04-28) * |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115567542A (en) * | 2022-12-01 | 2023-01-03 | 杭州蚂蚁酷爱科技有限公司 | Node set maintenance method and device |
| 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 |
| CN117093052A (en) * | 2023-10-17 | 2023-11-21 | 北京开源芯片研究院 | Clock signal transmission method, device, equipment and medium |
| CN117093052B (en) * | 2023-10-17 | 2024-02-02 | 北京开源芯片研究院 | Clock signal transmission method, device, equipment and medium |
| CN117499017A (en) * | 2023-12-31 | 2024-02-02 | 湖南天河国云科技有限公司 | Block chain network transmission method, system, storage medium and terminal equipment |
| CN117499017B (en) * | 2023-12-31 | 2024-03-22 | 湖南天河国云科技有限公司 | Block chain network transmission method, system, storage medium and terminal equipment |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114520810B (en) | 2024-06-14 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN114520810B (en) | Block data transmission method, equipment and medium based on block chain | |
| Tanha et al. | Capacity-aware and delay-guaranteed resilient controller placement for software-defined WANs | |
| Dunn et al. | Comparison of k-shortest paths and maximum flow routing for network facility restoration | |
| Chowdhury et al. | Dedicated protection for survivable virtual network embedding | |
| Kumar | Approximating circular arc colouring and bandwidth allocation in all-optical ring networks | |
| CN105359442B (en) | Network Management System, processor and route symmetry method | |
| CN110690928B (en) | Quantum relay link virtualization method and device | |
| CN106416158B (en) | For the traffic engineered of large-scale data central site network | |
| CN110690962B (en) | Application method and device of service node | |
| CN110690960B (en) | Routing service method and device of relay node | |
| 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 | |
| Duarte et al. | Improved heuristics for the regenerator location problem | |
| Masri et al. | Metaheuristics for solving the biobjective single‐path multicommodity communication flow problem | |
| White et al. | Genetic algorithms and network ring design | |
| Davis et al. | Failure-aware protection for many-to-many routing in content centric networks | |
| CN115982246A (en) | Data query method, equipment, system and storage medium | |
| Wang et al. | Coding-aware virtual network mapping for surviving single link failure | |
| CN115221244A (en) | Block chain cross-chain method and device, computer equipment and storage medium | |
| CN112367124B (en) | Quantum relay node virtualization method and device | |
| CN112486895B (en) | FPGA chip and interconnection control method thereof | |
| Cho et al. | Priority assignment algorithms for shared mesh protection switching | |
| Cho et al. | Minimizing protection switching time in transport networks with shared mesh protection | |
| CN112367161A (en) | Relay node function virtualization method and device | |
| CN115567542B (en) | Method and device for maintaining node set |
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 |