CN111782350A - Service processing method and device - Google Patents
Service processing method and device Download PDFInfo
- Publication number
- CN111782350A CN111782350A CN201910557462.6A CN201910557462A CN111782350A CN 111782350 A CN111782350 A CN 111782350A CN 201910557462 A CN201910557462 A CN 201910557462A CN 111782350 A CN111782350 A CN 111782350A
- Authority
- CN
- China
- Prior art keywords
- node
- channel
- request
- transaction
- priority
- 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
- 238000003672 processing method Methods 0.000 title claims abstract description 29
- 238000000034 method Methods 0.000 claims abstract description 72
- 230000008569 process Effects 0.000 claims abstract description 38
- 238000012163 sequencing technique Methods 0.000 claims description 105
- 238000012545 processing Methods 0.000 claims description 49
- 230000004044 response Effects 0.000 claims description 16
- 238000004590 computer program Methods 0.000 claims description 7
- 238000013461 design Methods 0.000 description 27
- 238000004891 communication Methods 0.000 description 6
- 238000010586 diagram Methods 0.000 description 6
- 230000003287 optical effect Effects 0.000 description 4
- 230000008878 coupling Effects 0.000 description 3
- 238000010168 coupling process Methods 0.000 description 3
- 238000005859 coupling reaction Methods 0.000 description 3
- 239000012634 fragment Substances 0.000 description 2
- 238000002955 isolation Methods 0.000 description 2
- 230000001360 synchronised effect Effects 0.000 description 2
- 238000012790 confirmation Methods 0.000 description 1
- 238000013500 data storage Methods 0.000 description 1
- 239000004744 fabric Substances 0.000 description 1
- 239000000835 fiber Substances 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 230000000977 initiatory effect Effects 0.000 description 1
- 238000013507 mapping Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000002093 peripheral effect Effects 0.000 description 1
- 239000004065 semiconductor Substances 0.000 description 1
- 239000007787 solid Substances 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 238000012795 verification Methods 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/48—Program initiating; Program switching, e.g. by interrupt
- G06F9/4806—Task transfer initiation or dispatching
- G06F9/4812—Task transfer initiation or dispatching by interrupt, e.g. masked
- G06F9/4818—Priority circuits therefor
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/27—Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2209/00—Indexing scheme relating to G06F9/00
- G06F2209/48—Indexing scheme relating to G06F9/48
- G06F2209/484—Precedence
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Software Systems (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Databases & Information Systems (AREA)
- Computing Systems (AREA)
- Data Mining & Analysis (AREA)
- Computer And Data Communications (AREA)
Abstract
The embodiment of the invention provides a service processing method and a device. The first node is any node in the blockchain network, that is, any node in the blockchain network processes the service request according to the priority of the channel after receiving the service request, so as to ensure that the transaction request in the channel with high priority is processed first, and ensure that the service of the channel with high priority is guaranteed.
Description
Technical Field
The embodiment of the invention relates to the technical field of block chains, in particular to a service processing method and a service processing device.
Background
Hyper ledger (hyper ledger Fabric) is a very popular block chain solution at present, and a plurality of organizations can form a block chain network of an alliance through the hyper ledger. In a block chain network based on a super account book, a concept of a channel is introduced, wherein the channel refers to a private sub-network for communication between two or more nodes in the block chain network and is used for transactions needing data confidentiality.
In a block chain network based on a super account book, isolation of data, business logic and the like can be realized by supporting multiple channels. However, since computer resources, such as computing resources and storage resources, are not isolated, resource contention exists among multiple channels in the same super-account blockchain network, and thus, services in some channels transmitting important services cannot be processed in time. For example, a superbugt based blockchain network supports 10 channels, one for real-time services such as fund flow, and nine for other low-urgency services. When the network load is high, it cannot be guaranteed that enough computer resources are allocated to the channel with high real-time requirement, and the service reliability is low.
Disclosure of Invention
The embodiment of the invention provides a service processing method and a service processing device, which are used for setting priorities for a plurality of channels supported by a block chain network based on a super account book and processing each channel service according to the priorities so as to improve the reliability of high-priority channel services.
In a first aspect, an embodiment of the present invention provides a service processing method, where the method is applied to a first node in a blockchain network, and the method includes:
a first node receives a service request, wherein the service request carries a channel identifier;
and the first node processes the service request according to the priority of the channel corresponding to the channel identifier.
In a feasible design, before the first node processes the service request according to the priority of the channel corresponding to the channel identifier, the method further includes:
and the first node determines the priority of the channel according to the channel identifier.
In a feasible design, the first node is a peer node in the blockchain network, the service request is a first proposal request, the first proposal request is used for requesting to initiate a transaction, and the first proposal request also carries a transaction proposal of the transaction;
the first node processes the service request according to the priority of the channel corresponding to the channel identifier, including:
and the first node endorses the transaction proposal according to the priority.
In one possible design, before the first node endorses the transaction proposal according to the priority, the method further includes:
and the first node receives a second proposal request sent by the electronic equipment, wherein the second proposal request carries the channel identifier, and the second proposal request is used for requesting to add the first node to the channel corresponding to the channel identifier.
In one possible design, before the first node endorses the transaction proposal according to the priority, the method further includes:
the first node receives a channel joining request sent by the sequencing node, wherein the channel joining request carries a channel identifier and a channel priority.
In one possible design, the first node is a sequencing node in the blockchain network, and the service request is a transaction request;
the first node processes the service request according to the priority of the channel corresponding to the channel identifier, including:
and the first node sends the transaction request to a sequencing service node according to the priority.
In one possible design, after the first node sends the transaction request to a ranking service node according to the priority, the method further includes:
the first node receives a transaction queue sent by the sequencing service node, wherein the transaction queue is obtained by sequencing the transaction request of the channel by the sequencing service node;
the first node processes the transaction requests in the transaction queue according to a first-in first-out principle to obtain a block;
and the first node sends the block to each peer node contained in the channel.
In one possible design, the method further includes:
the first node receives a data synchronization request sent by a first peer node, wherein the data synchronization request carries a channel identifier, and the first peer node is a node which is added into the channel after the channel is established;
the first node determines a block of a channel corresponding to the channel identifier according to the channel identifier and the priority;
and the first node sends a data synchronization response to the first peer node according to the priority, wherein the data synchronization response carries the block corresponding to the channel.
In one possible design, before the sequencing node receives the transaction request, the method further includes:
and the first node receives a channel creating request sent by the electronic equipment, wherein the channel creating request carries the priority of a channel and the identification of a peer node in the channel.
In a feasible design, the first node is a sequencing service node in the blockchain network, the service request is a transaction request, and the transaction request also carries the priority of the channel;
the first node processes the service request according to the priority of the channel corresponding to the channel identifier, including:
the first node sorts the transaction requests corresponding to the channel identification according to the priority and a first-in first-out principle to obtain a transaction queue;
the first node sends the transaction queue to the sorting node.
In a second aspect, an embodiment of the present invention provides a service processing apparatus, where the service processing apparatus is disposed on a first node in a blockchain network, and the apparatus includes:
a receiving unit, configured to receive a service request, where the service request carries a channel identifier;
and the processing unit is used for processing the service request according to the priority of the channel corresponding to the channel identifier.
In a feasible design, the processing unit is further configured to determine the priority of the channel according to the channel identifier before processing the service request according to the priority of the channel corresponding to the channel identifier.
In a feasible design, the first node is a peer node in the blockchain network, the service request is a first proposal request, the first proposal request is used for requesting to initiate a transaction, and the first proposal request also carries a transaction proposal of the transaction;
and the processing unit is used for endorsing the transaction proposal according to the priority.
In a feasible design, before the processing unit endorses the transaction proposal according to the priority, the receiving unit is further configured to receive a second proposal request sent by the electronic device, where the second proposal request carries the channel identifier, and the second proposal request is used to request that the first node is added to the channel corresponding to the channel identifier.
In a feasible design, the receiving unit is further configured to receive a channel join request sent by a sequencing node before the processing unit endorses the transaction proposal according to the priority, where the channel join request carries a channel identifier and a channel priority.
In one possible design, the first node is a sorting node in the blockchain network, the service request is a transaction request, and the apparatus further includes: and the sending unit is used for sending the transaction request to a sequencing service node according to the priority.
In a feasible design, the receiving unit is further configured to receive a transaction queue sent by the ranking service node after the sending unit sends the transaction request to the ranking service node according to the priority, where the transaction queue is obtained by the ranking service node by ranking the transaction request of the channel;
the processing unit is further configured to process the transaction requests in the transaction queue according to a first-in first-out principle to obtain a block;
the sending unit is further configured to send the block to each peer node included in the channel.
In a feasible design, the receiving unit is further configured to receive a data synchronization request sent by a first peer node, where the data synchronization request carries a channel identifier, and the first peer node is a node that joins the channel after the channel is established;
the processing unit is further configured to determine, according to the channel identifier and the priority, a block of a channel corresponding to the channel identifier;
the sending unit is further configured to send a data synchronization response to the first peer node according to the priority, where the data synchronization response carries the block corresponding to the channel.
In a possible design, before receiving the transaction request, the receiving unit is further configured to receive a create path request sent by the electronic device, where the create path request carries a priority of a path and an identifier of a peer node in the path.
In a feasible design, the first node is a sequencing service node in the blockchain network, the service request is a transaction request, and the transaction request also carries the priority of the channel;
the processing unit is further configured to sort, according to the priority, the transaction requests corresponding to the channel identifiers according to a first-in first-out principle, so as to obtain a transaction queue;
the sending unit is further configured to send the transaction queue to the sorting node.
In a third aspect, an embodiment of the present invention provides a service processing apparatus, which includes a processor, a memory, and a computer program stored in the memory and executable on the processor, where the processor executes the program to implement the method according to the first aspect or various possible implementations of the first aspect.
In a fourth aspect, embodiments of the present invention provide a storage medium having stored therein instructions that, when executed on a node of a blockchain network, cause the node of the blockchain network to perform a method as described in the first aspect or various possible implementations of the first aspect.
In a fifth aspect, embodiments of the present invention provide a computer program product, which when run on a node of a blockchain network, causes the node of the blockchain network to perform the method according to the first aspect or the various possible implementations of the first aspect.
According to the service processing method and device provided by the embodiment of the invention, the first node receives the service request, the service request carries the channel identifier, and the service request is processed according to the priority of the channel corresponding to the channel identifier. The first node is any node in the blockchain network, that is, any node in the blockchain network processes the service request according to the priority of the channel after receiving the service request, so as to ensure that the transaction request in the channel with high priority is processed first, and ensure that the service of the channel with high priority is guaranteed.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings needed to be used in the description of the embodiments or the prior art will be briefly introduced below, and it is obvious that the drawings in the following description are some embodiments of the present invention, and for those skilled in the art, other drawings can be obtained according to these drawings without creative efforts.
Fig. 1 is a schematic diagram of an operating environment of a service processing method to which an embodiment of the present invention is applied;
fig. 2 is a flowchart of a service processing method according to an embodiment of the present invention;
fig. 3 is a flowchart of another service processing method provided in an embodiment of the present invention;
fig. 4 is a flowchart of creating a new channel in a service processing method according to an embodiment of the present invention;
fig. 5 is a flowchart of adding a new peer node to a created channel in a service processing method according to an embodiment of the present invention;
fig. 6 is a flowchart for data synchronization in a service processing method according to an embodiment of the present invention
Fig. 7 is a schematic structural diagram of a service processing apparatus according to an embodiment of the present invention;
fig. 8 is a schematic structural diagram of a node of a block chain network according to an embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are some, but not all, embodiments of the present invention. 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 invention.
In a block chain network based on a super account book, isolation of data, business logic and the like can be realized through support of multiple channels. However, the computer resources, such as CPU, storage resources, and other underlying resources are not isolated, which results in resource contention among multiple channels, and thus the resources of some channels with higher service importance cannot be guaranteed. For example, a superbugt based blockchain network supports 10 channels, one for real-time services such as fund flow, and nine for other low-urgency services. When the network load is high, it cannot be guaranteed that enough computer resources are allocated to the channel with high real-time requirement, and the service reliability is low.
In view of this, an embodiment of the present invention provides a service processing method, which sets priorities for multiple channels supported by a block chain network based on a super ledger, and processes each channel service according to the priorities, so as to improve reliability of a high-priority channel service.
Terms involved in the embodiments of the present invention are explained first:
channel (Channel): a private sub-network for communication between two or more nodes in a blockchain network for transactions requiring data privacy.
A peer node: and the basic nodes in the block chain network are used for executing chain codes, reading and writing the account book and the like. The peer nodes can be divided into endorsement nodes and execution nodes according to whether an endorsement policy is set. In the embodiment of the application, a channel can be understood as a block chain sub-network consisting of a client, a peer node, a sequencing node and a sequencing service node, and is specially designed for protecting data privacy of participants. The transaction data for each channel constitutes a blockchain that is visible only to the channel internal members. It is understood that one peer node may join multiple channels at the same time to conduct different services with different participants. It is also understood that each peer node may be connected to the sequencing node through one or more channels, so as to receive the block data transmitted on one or more channels and maintain the ledger corresponding to one or more channels.
Endorsement node (Endorser): and the endorsement node receives the generated blocks from the sequencing node, and maintains and updates the local account book.
Executive node (commit): the generated blocks are received from the sequencing node, and the local ledger is maintained and updated, but the endorsements of the transaction proposal are not participated in.
Sort node (Orderer): and the system is responsible for receiving endorsement transactions submitted by the client, sequencing the endorsement transactions and generating blocks.
And the sequencing service node is used for sequencing the transactions to obtain a transaction queue.
Fig. 1 is a schematic diagram of an operating environment of a service processing method to which an embodiment of the present invention is applied. Referring to fig. 1, in the present embodiment, a blockchain network includes a sorting node, a sorting service node, and at least one peer node. Network connection is established between the sequencing node and each peer node, network connection is established between the sequencing node and the sequencing service node, and network connection is established between the electronic equipment loaded with the client and the sequencing node. Wherein, at least one peer node is, for example, peer 1-peer 8, peer1, peer2 and peer3 form a channel 1, peer1, peer5 and peer6 form a channel 2, and peer7 and peer8 form a channel 3. The priority of channel 1, channel 2 and channel 3 is high, medium and low in sequence.
It should be noted that, in the above architecture, the entity corresponding to the peer node is an electronic device or a server, and the entity corresponding to the sequencing node is an electronic device or a server. For convenience, only one sort node is illustrated, however, in practice, the number of sort nodes may be one or more. For example, there are two sequencing nodes, where one sequencing node is a master node and the other sequencing node is a slave backup node, and the backup node is enabled only when the slave node fails; for another example, there are four sort nodes, the peer nodes are divided into four groups, and the sort nodes connected by the peer nodes in different groups are different.
It should be further noted that, in the foregoing architecture, the sequencing node and the sequencing service node may be deployed on the same entity, or may be separately deployed.
It should be further noted that, although in the above architecture, the electronic device that can be loaded by the client is a device independent of each peer node of the blockchain. However, the embodiment of the present invention is not limited, and in other possible implementations, the client may also be loaded on a certain peer node in the blockchain.
Next, a service processing method according to an embodiment of the present invention is described in detail based on the architecture shown in fig. 1. For example, see fig. 2.
Fig. 2 is a flowchart of a service processing method according to an embodiment of the present invention. In this embodiment, the service processing method according to the embodiment of the present invention is described in detail from the perspective of a first node, where the first node may be a peer node, a ranking node, or a ranking service node. The embodiment comprises the following steps:
101. the first node receives a service request, wherein the service request carries a channel identifier.
102. And the first node processes the service request according to the priority of the channel corresponding to the channel identifier.
In the above steps 101 and 102, after receiving the service request, the first node in the block chain network processes the service request according to the priority of the channel corresponding to the channel identifier carried in the service request. The first node may be a peer node, a sequencing node, or a sequencing service node in the blockchain network, that is, any one node in the blockchain network processes the service request according to the priority of the channel after receiving the service request. For example, the first node is an endorsement node, the service request is a proposal request for initiating a transaction, and the channel identifiers carried by the service requests may be the same or different, and then the first node processes the service requests in the order of priority from high to low according to the priority of the channels. If the first node is a sequencing node and the service request is a transaction request, the first node sends the transaction request to a sequencing service node according to the priority of the channel and the sequence of the priority from high to low; for another example, if the first node is a sequencing service node, and the service request is a transaction request sent by the sequencing service node, the sequencing service sequences the transaction requests of each priority level in the order of priority levels from high to low to obtain a message queue corresponding to each priority level and sends the message queue to the sequencing node, so that the sequencing node processes the services in the message queue corresponding to each priority level according to the priority levels and a first-in first-out principle to obtain a block.
In the service processing method provided by the embodiment of the present invention, the first node receives a service request, where the service request carries a channel identifier, and processes the service request according to a priority of a channel corresponding to the channel identifier. The first node is any node in the blockchain network, that is, any node in the blockchain network processes the service request according to the priority of the channel after receiving the service request, so as to ensure that the transaction request in the channel with high priority is processed first, and ensure that the service of the channel with high priority is guaranteed.
The following describes the service processing method according to the embodiment of the present invention in detail with a complete service processing flow. For example, referring to fig. 3, fig. 3 is a flowchart of another service processing method provided in the embodiment of the present invention. In this embodiment, an endorsement node, a ranking node, and a ranking service node are used to respectively execute the method embodiments shown in the first node to implement an example description of a service processing method in a blockchain network. The embodiment comprises the following steps:
201. the electronic equipment sends a first proposal request to a first peer node through a client.
The first proposal request carries a channel identifier and a transaction proposal, the first proposal request is used for requesting to initiate a transaction, and the first peer node is any one of the at least one peer node;
accordingly, the first peer node receives the first proposal request.
In the embodiment of the present application, the first peer node may also be referred to as an endorsement node. Illustratively, peer nodes may be divided into endorsement nodes and execution nodes according to whether an endorsement policy is set. The endorsement node can sign the transaction proposal according to the setting of the endorsement strategy, the endorsement node is dynamic, the peer node is the endorsement node only when the client initiates an endorsement request to the peer node, otherwise, the peer node is a common execution node. For example, if the client sends an endorsement request to peer1 in channel 1, peer1 is the endorsement node, and peer2 and peer3 are the execution nodes; if the client sends an endorsement request to the peer2 in channel 1, the peer2 is an endorsement node, and the peers 1 and 3 are execution nodes.
202. And the first peer node determines the priority of the channel according to the channel identifier.
Illustratively, when the first peer node, i.e. the endorsement node, stores the priority of the joining channel in advance. For example, when creating channel 1, setting the priority of channel 1 to be high priority, where channel 1 includes peer1, peer2, and peer3, and peer1, peer2, and peer3 respectively store the correspondence between the priorities of channel 1 and channel 1, that is, channel 1 corresponds to high priority; when creating the channel 2, setting the priority of the channel 2 as a medium priority, wherein the channel 2 comprises a peer1, a peer5 and a peer6, and the peer1, the peer5 and the peer6 respectively store the corresponding relation between the priority of the channel 2 and the priority of the channel 2, namely the channel 2 corresponds to the medium priority.
Therefore, the endorsement node can determine the priority of the channel according to the channel identifier.
203. The first peer node endorses the transaction proposal according to the priority to obtain proposal response;
because one endorsement node may belong to a plurality of channels at the same time, if the client initiates transaction proposals to the plurality of channels through the endorsement node at the same time, the endorsement node can process each transaction proposal according to the priority. For example, in the architecture shown in fig. 1, peer1 is in channel 1 and channel 2 at the same time, if a client initiates a transaction proposal to channel 1 and channel 2 through peer1 at the same time, peer1 serves as an endorsement node, and since the priority of channel 1 is higher than that of channel 2, peer1 endorses the transaction proposal of channel 1 first and then endorses the transaction day of channel 2.
204. And the first peer node sends the proposal response to a client of the electronic equipment.
In this step, the endorsement node sends a proposal response to the client of the electronic device according to the priority, wherein the proposal response is also called endorsement acknowledgement.
The steps 201-204 can be referred to as an endorsement stage. In this stage, the first peer node is the above-mentioned first node, and for the first peer node, the service request is a first proposal request, the first proposal request is used for requesting to initiate a transaction, and the first proposal request also carries a transaction proposal of the transaction
205. The electronic device sends a transaction request to the sequencing node through the client.
Wherein, the transaction request carries the channel identifier.
Accordingly, the sequencing node receives the transaction request.
In the step, after receiving enough endorsement confirmation, the electronic equipment constructs a transaction request and sends the transaction request to a sequencing node; accordingly, the sequencing node receives the transaction request.
206. And the sequencing node determines the priority of the channel according to the channel identifier.
For example, one sequencing node may receive a plurality of transaction requests, each of which carries a channel identifier, so that the sequencing node may determine the priority of a channel according to the channel identifier, and then send the transaction requests to the sequencing service node according to the priority.
207. And the sequencing node sends the transaction request to a sequencing service node according to the priority.
Correspondingly, the sequencing service node receives a transaction request sent by the sequencing node, wherein the transaction request carries the channel identifier and the priority of the channel.
208. And the sequencing service node sequences the services corresponding to the channel identification according to a first-in first-out principle to obtain a transaction queue.
In this step, the ordering service node orders the received transaction requests according to a first-in first-out principle to obtain a transaction queue. That is, for each priority, there is one transaction queue.
209. And the sequencing service node sends the transaction queue to the sequencing node.
210. And the sequencing node processes the transaction requests in the transaction queue according to a first-in first-out principle to obtain a block.
In this step, the sequencing node firstly determines the transaction queue to be processed firstly according to the priority, and then processes the transaction requests in the transaction queue according to the first-in first-out principle. And after the transaction request in the transaction queue with the highest priority is processed, processing the transaction request in the transaction queue corresponding to the channel with the second priority, and so on. In the processing process, the transaction queues are processed according to the sequence of the priority from high to low, and the transaction requests in each transaction queue are processed according to the first-in first-out principle, so that the transaction requests in the high-priority channel can be guaranteed to be processed firstly, and the service of the high-priority channel is guaranteed.
211. And the sorting node sends the blocks to each peer node contained in the channel.
The above steps 205 to 211 can be referred to as transaction phase or business processing phase. In this stage, the first node is, for example, a sequencing node and a sequencing service node, for the sequencing node, the service request is a transaction request received by the sequencing node from the electronic device, and for the sequencing service node, the service request is a transaction request received by the sequencing service node from the sequencing node.
According to the service processing method provided by the embodiment of the invention, the endorsement node preferentially endorses the transaction proposal in the high-priority channel in the endorsement stage according to the priority of the channel from high to low; in the transaction stage, the sequencing node sends the transaction requests to the sequencing service node according to the sequence of the priorities from high to low, so that the sequencing node sequences the transaction requests of the channel corresponding to the priority according to a first-in first-out principle to obtain a transaction queue and sends the transaction queue to the sequencing node, and the sequencing node processes the transaction requests in the transaction queue according to the first-in first-out principle to obtain blocks and sends the blocks to each peer node contained in the channel. In the process, in the endorsement stage, the endorsement node carries out endorsement priority on the transaction proposal in the channel with high priority, and in the transaction stage, the sequencing node processes the transaction requests in the transaction queue of the channel with high priority according to a first-in first-out principle, so that the transaction requests in the channel with high priority are guaranteed to be processed firstly, and the service of the channel with high priority is guaranteed.
In the above embodiment, the priority of the channel may be set at the time of initially creating the channel. However, a channel is created, and if a new peer node needs to be added to the channel, the priority of the channel needs to be notified to the new peer node, and the existing data on the channel needs to be synchronized to the new peer node. In the following, how to create a new channel, how to add a new peer node to the created channel, and how to implement data synchronization in the new peer node will be described in detail.
First, a new channel is created. For example, referring to fig. 4, fig. 4 is a flowchart of creating a new channel in a service processing method according to an embodiment of the present invention. The embodiment comprises the following steps:
301. a client of the electronic device receives a create channel request input by a user.
302. The electronic equipment sends a channel creating request to the sequencing node through the client, wherein the channel creating request carries a channel identifier, the priority of the channel and the identifier of a peer node in the channel.
Accordingly, the sequencing node receives the create channel request.
In this step, the electronic device packages the request for creating the channel into a transaction and sends the transaction to the sequencing node.
303. The sorting node verifies the create channel request.
In this step, after the sorting node allocates a channel identifier (channel ID) to the newly created channel, the Priority i corresponding to the newly created channel is placed in a data structure channel _ Priority [ channel ], and mapping of the correspondence between the channel identifier and the Priority i is performed. And then, the sequencing node and the sequencing service node are communicated, and a theme and a fragment are created for the newly created channel, wherein the theme corresponds to a product queue, and the fragment corresponds to a cumuser queue. In this process, if the ranking service node supports the theme priority, the theme priority also needs to be transmitted to the ranking service node as a parameter when creating the corresponding body.
304. The ranking node sends the transaction to the ranking service node.
In this step, the sequencing node sends the transaction to the sequencing service node through the product queue.
305. The sequencing service node sends a transaction acknowledgement to the sequencing node.
306. The sort node pulls the sort transaction from the cusumer queue.
307. And the sequencing service node returns the sequenced transactions to the sequencing node.
It should be noted that, after the step 303, the sorting node needs to send a channel join request to each peer node (including an endorsement node) in the channel, where the channel join request carries a channel identifier and a channel priority. In this way, the corresponding relationship between the channel identifier and the priority of the channel is stored on all peer nodes of one channel.
Secondly, adding a new peer node to the created channel. For example, referring to fig. 5, fig. 5 is a flowchart of adding a new peer node to a created channel in a service processing method according to an embodiment of the present invention. The embodiment comprises the following steps:
501. the client of the electronic equipment receives a channel joining request input by a user.
For example, assuming that a created channel does not include a first peer node, when a user wants to join the first peer node to the created channel, a channel join request is input on a client of the electronic device, and the channel join request carries an identifier of the first peer node and a channel identifier.
502. The electronic device sends a second proposal request to the first peer node.
Accordingly, the first peer node receives the second proposal request.
And the second proposal request carries the channel identifier, and is used for requesting to add the first peer node to the channel corresponding to the channel identifier.
503. The first peer node processes the second proposal request.
In this step, the first peer node processes the second proposal request, such as verification, initialization operation, registration of correspondence between the channel identifier and the channel priority, and the like. When registering the correspondence between the Channel identifier and the Channel Priority, the first peer node places the Priority i of the Channel in the data structure Channel _ Priority [ Channel ID ], and registers the correspondence between the Channel ID and the Priority i.
504. And the first peer node performs data synchronization with the second peer node.
Wherein the second peer node is an existing node in the channel. For example, referring to fig. 1, when initially creating channel 2, channel 2 contains peer1, peer5, and peer 6. If it is desired to add peer9 to channel 2, peer9 is the first peer node and peer1, peer5, and peer6 are the second peer nodes. When all members join the channel, the transaction on the channel can be processed normally.
Finally, the data in the new peer node is synchronized.
In fig. 4, after the first peer node joins the channel, the first peer node and the second peer node communicate with each other to synchronize data between the first peer node and the second peer node. However, the embodiment of the present invention is not limited, and in other possible implementation manners, the first peer node may actively communicate with the sequencing node to implement data synchronization between the first peer node and the second peer node. For example, referring to fig. 6, fig. 6 is a flowchart for data synchronization in a service processing method according to an embodiment of the present invention. The embodiment comprises the following steps:
601. the first peer node sends a data synchronization request to the sequencing node.
Correspondingly, the sequencing node receives the data synchronization request sent by the first peer node.
The data synchronization request carries a channel identifier, and the first peer node is a node added into the channel after the channel is established.
602. And the sequencing node determines the priority of the channel corresponding to the channel identifier according to the channel identifier.
In this step, after receiving the data synchronization request, the sequencing node finds the Priority i corresponding to the channel identifier from the channel _ Priority [ channel ] structure registered when the channel is created previously according to the channel identifier in the data synchronization request, and places the data synchronization request in a message queue to wait for processing.
603. And the sequencing node determines the blocks of each channel in sequence according to the priority of the channel.
In this step, the sequencing node processes the data synchronization requests in the message queue in sequence according to the sequence of the priority from high to low, and ensures that the request with high priority is processed first.
604. And the sequencing node sends a data synchronization response to the first peer node according to the priority, wherein the data synchronization response carries the blocks corresponding to the channels.
The following are embodiments of the apparatus of the present invention that may be used to perform embodiments of the method of the present invention. For details which are not disclosed in the embodiments of the apparatus of the present invention, reference is made to the embodiments of the method of the present invention.
Fig. 7 is a schematic structural diagram of a service processing apparatus according to an embodiment of the present invention, where the service processing apparatus is disposed on a first node in a blockchain network, and the service processing apparatus may be implemented in a software and/or hardware manner. As shown in fig. 7, the service processing apparatus 100 includes:
a receiving unit 11, configured to receive a service request, where the service request carries a channel identifier;
and the processing unit 12 is configured to process the service request according to the priority of the channel corresponding to the channel identifier.
In a feasible design, the processing unit 12 is further configured to determine the priority of the channel according to the channel identifier before processing the service request according to the priority of the channel corresponding to the channel identifier.
In a feasible design, the first node is a peer node in the blockchain network, the service request is a first proposal request, the first proposal request is used for requesting to initiate a transaction, and the first proposal request also carries a transaction proposal of the transaction;
the processing unit 12 is configured to endorse the transaction proposal according to the priority.
In a feasible design, before the processing unit 12 endorses the transaction proposal according to the priority, the receiving unit 11 is further configured to receive a second proposal request sent by the electronic device, where the second proposal request carries the channel identifier, and the second proposal request is used to request that the first node is added to the channel corresponding to the channel identifier.
In a possible design, the receiving unit 11 is further configured to receive a channel join request sent by a sequencing node before the processing unit 12 endorses the transaction proposal according to the priority, where the channel join request carries a channel identifier and a channel priority.
Referring again to fig. 7, in a possible design, the first node is a sorting node in the blockchain network, the service request is a transaction request, and the apparatus 100 further includes: and the sending unit 13 is configured to send the transaction request to a sequencing service node according to the priority.
In a feasible design, the receiving unit 11 is further configured to receive a transaction queue sent by the ranking service node after the sending unit 13 sends the transaction request to the ranking service node according to the priority, where the transaction queue is obtained by the ranking service node by ranking the transaction request of the channel;
the processing unit 12 is further configured to process the transaction requests in the transaction queue according to a first-in first-out principle to obtain a block;
the sending unit 13 is further configured to send the block to each peer node included in the channel.
In a feasible design, the receiving unit 11 is further configured to receive a data synchronization request sent by a first peer node, where the data synchronization request carries a channel identifier, and the first peer node is a node that joins the channel after the channel is established;
the processing unit 12 is further configured to determine, according to the channel identifier and the priority, a block of a channel corresponding to the channel identifier;
the sending unit 13 is further configured to send a data synchronization response to the first peer node according to the priority, where the data synchronization response carries the block corresponding to the channel.
In a possible design, the receiving unit 11, before receiving the transaction request, is further configured to receive a create path request sent by the electronic device, where the create path request carries a priority of a path and an identifier of a peer node in the path.
In a feasible design, the first node is a sequencing service node in the blockchain network, the service request is a transaction request, and the transaction request also carries the priority of the channel;
the processing unit 12 is further configured to sort, according to the priority, the transaction requests corresponding to the channel identifiers according to a first-in first-out principle, so as to obtain a transaction queue;
the sending unit 13 is further configured to send the transaction queue to the sorting node.
Fig. 8 is a schematic structural diagram of a node of a block chain network according to an embodiment of the present invention. As shown in fig. 8, the node 200 of the blockchain network includes:
at least one processor 21 and memory 22;
the memory 22 stores computer-executable instructions;
the at least one processor 21 executes computer-executable instructions stored by the memory 22 to cause the at least one processor 21 to perform the business process methods as described above.
Optionally, the electronic device 200 further comprises a communication component 23. The processor 21, the memory 22, and the communication unit 23 may be connected by a bus 24.
An embodiment of the present invention further provides a storage medium, where a computer executing instruction is stored in the storage medium, and the computer executing instruction is used to implement the service processing method described above when being executed by a processor of a node of a blockchain network.
An embodiment of the present invention further provides a computer program product, which, when running on a node of a blockchain network, causes the node of the blockchain network to execute the above service processing method.
In the above embodiments, it should be understood that the described apparatus and method may be implemented in other ways. For example, the above-described device embodiments are merely illustrative, and for example, the division of the modules is only one logical division, and other divisions may be realized in practice, for example, a plurality of modules may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, devices or modules, and may be in an electrical, mechanical or other form.
The modules described as separate parts may or may not be physically separate, and parts displayed as modules may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of the present embodiment.
In addition, functional modules in the embodiments of the present invention may be integrated into one processing unit, or each module may exist alone physically, or two or more modules are integrated into one unit. The unit formed by the modules can be realized in a hardware form, and can also be realized in a form of hardware and a software functional unit.
The integrated module implemented in the form of a software functional module may be stored in a computer-readable storage medium. The software functional module is stored in a storage medium and includes several instructions to enable an electronic device (which may be a personal computer, a server, or a network device) or a processor (processor) to execute some steps of the method according to various embodiments of the present invention.
It should be understood that the processor may be a Central Processing Unit (CPU), other general purpose processor, a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), etc. A general purpose processor may be a microprocessor or the processor may be any conventional processor or the like. The steps of a method disclosed in connection with the present invention may be embodied directly in a hardware processor, or in a combination of the hardware and software modules within the processor.
The memory may comprise a high-speed RAM memory, and may further comprise a non-volatile storage NVM, such as at least one disk memory, and may also be a usb disk, a removable hard disk, a read-only memory, a magnetic or optical disk, etc.
The bus may be an Industry Standard Architecture (ISA) bus, a Peripheral Component Interconnect (PCI) bus, an Extended ISA (EISA) bus, or the like. The bus may be divided into an address bus, a data bus, a control bus, etc. For ease of illustration, the buses in the figures of the present invention are not limited to only one bus or one type of bus.
The storage medium may be implemented by any type or combination of volatile or non-volatile memory devices, such as Static Random Access Memory (SRAM), electrically erasable programmable read-only memory (EEPROM), erasable programmable read-only memory (EPROM), programmable read-only memory (PROM), read-only memory (ROM), magnetic memory, flash memory, magnetic or optical disks. A storage media may be any available media that can be accessed by a general purpose or special purpose computer.
An exemplary storage medium is coupled to the processor such the processor can read information from, and write information to, the storage medium. Of course, the storage medium may also be integral to the processor. The processor and the storage medium may reside in an Application Specific Integrated Circuits (ASIC). Of course, the processor and the storage medium may reside as discrete components in a terminal or server.
In the above embodiments, the implementation may be wholly or partially realized by software, hardware, firmware, or any combination thereof. When implemented in software, may be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer instructions. The procedures or functions according to the embodiments of the present application are all or partially generated when the computer program instructions are loaded and executed on a computer. The computer may be a general purpose computer, a special purpose computer, a network of computers, or other programmable device. The computer instructions may be stored in a computer readable storage medium or transmitted from one computer readable storage medium to another, for example, the computer instructions may be transmitted from one website, computer, server, or data center to another website, computer, server, or data center by wire (e.g., coaxial cable, fiber optic, Digital Subscriber Line (DSL)) or wirelessly (e.g., infrared, wireless, microwave, etc.). The computer-readable storage medium can be any available medium that can be accessed by a computer or a data storage device, such as a server, a data center, etc., that incorporates one or more of the available media. The usable medium may be a magnetic medium (e.g., floppy Disk, hard Disk, magnetic tape), an optical medium (e.g., DVD), or a semiconductor medium (e.g., Solid State Disk (SSD)), among others.
The term "plurality" herein means two or more. The term "and/or" herein is merely an association describing an associated object, meaning that three relationships may exist, e.g., a and/or B, may mean: a exists alone, A and B exist simultaneously, and B exists alone. In addition, the character "/" herein generally indicates that the former and latter related objects are in an "or" relationship; in the formula, the character "/" indicates that the preceding and following related objects are in a relationship of "division".
Those of ordinary skill in the art will understand that: all or a portion of the steps of implementing the above-described method embodiments may be performed by hardware associated with program instructions. The program may be stored in a computer-readable storage medium. When executed, the program performs steps comprising the method embodiments described above; and the aforementioned storage medium includes: various media that can store program codes, such as ROM, RAM, magnetic or optical disks.
Finally, it should be noted that: the above embodiments are only used to illustrate the technical solution of the present invention, and not to limit the same; while the invention has been described in detail and with reference to the foregoing embodiments, it will be understood by those skilled in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some or all of the technical features may be equivalently replaced; and the modifications or the substitutions do not make the essence of the corresponding technical solutions depart from the scope of the technical solutions of the embodiments of the present invention.
Claims (22)
1. A traffic processing method applied to a first node in a blockchain network, the method comprising:
a first node receives a service request, wherein the service request carries a channel identifier;
and the first node processes the service request according to the priority of the channel corresponding to the channel identifier.
2. The method of claim 1, wherein before the first node processes the service request according to the priority of the channel corresponding to the channel identifier, the method further comprises:
and the first node determines the priority of the channel according to the channel identifier.
3. The method according to claim 1 or 2, wherein the first node is a peer node in the blockchain network, the service request is a first proposal request, the first proposal request is used for requesting to initiate a transaction, and the first proposal request also carries a transaction proposal of the transaction;
the first node processes the service request according to the priority of the channel corresponding to the channel identifier, including:
and the first node endorses the transaction proposal according to the priority.
4. The method of claim 3, wherein prior to endorsement of the transaction proposal by the first node in accordance with the priority, further comprising:
and the first node receives a second proposal request sent by the electronic equipment, wherein the second proposal request carries the channel identifier, and the second proposal request is used for requesting to add the first node to the channel corresponding to the channel identifier.
5. The method of claim 3, wherein prior to endorsement of the transaction proposal by the first node in accordance with the priority, further comprising:
the first node receives a channel joining request sent by the sequencing node, wherein the channel joining request carries a channel identifier and a channel priority.
6. The method according to claim 1 or 2, wherein the first node is a sequencing node in the blockchain network, and the service request is a transaction request;
the first node processes the service request according to the priority of the channel corresponding to the channel identifier, including:
and the first node sends the transaction request to a sequencing service node according to the priority.
7. The method of claim 6, wherein after the first node sends the transaction request to a ranking service node according to the priority, further comprising:
the first node receives a transaction queue sent by the sequencing service node, wherein the transaction queue is obtained by sequencing the transaction request of the channel by the sequencing service node;
the first node processes the transaction requests in the transaction queue according to a first-in first-out principle to obtain a block;
and the first node sends the block to each peer node contained in the channel.
8. The method of claim 6, further comprising:
the first node receives a data synchronization request sent by a first peer node, wherein the data synchronization request carries a channel identifier, and the first peer node is a node which is added into the channel after the channel is established;
the first node determines a block of a channel corresponding to the channel identifier according to the channel identifier and the priority;
and the first node sends a data synchronization response to the first peer node according to the priority, wherein the data synchronization response carries the block corresponding to the channel.
9. The method of claim 6, wherein prior to the sequencing node receiving the transaction request, further comprising:
the first node receives a channel creating request sent by electronic equipment, wherein the channel creating request carries the priority of a channel and the identification of a peer node in the channel.
10. The method according to claim 1, wherein the first node is a service node in the block chain network, the service request is a transaction request, and the transaction request further carries the priority of the channel;
the first node processes the service request according to the priority of the channel corresponding to the channel identifier, including:
the first node sorts the transaction requests corresponding to the channel identification according to the priority and a first-in first-out principle to obtain a transaction queue;
the first node sends the transaction queue to the sorting node.
11. A traffic processing apparatus, wherein the traffic processing apparatus is disposed at a first node in a blockchain network, the apparatus comprising:
a receiving unit, configured to receive a service request, where the service request carries a channel identifier;
and the processing unit is used for processing the service request according to the priority of the channel corresponding to the channel identifier.
12. The apparatus of claim 11,
and the processing unit is further configured to determine the priority of the channel according to the channel identifier before processing the service request according to the priority of the channel corresponding to the channel identifier.
13. The apparatus according to claim 11 or 12, wherein the first node is a peer node in the blockchain network, the service request is a first proposal request, the first proposal request is used for requesting to initiate a transaction, and the first proposal request also carries a transaction proposal of the transaction;
and the processing unit is used for endorsing the transaction proposal according to the priority.
14. The apparatus of claim 13,
the receiving unit is further configured to receive a second proposal request sent by the electronic device before the processing unit endorses the transaction proposal according to the priority, where the second proposal request carries the channel identifier, and the second proposal request is used to request that the first node is added to the channel corresponding to the channel identifier.
15. The apparatus of claim 13,
and the receiving unit is used for receiving a channel adding request sent by the sequencing node before the processing unit endorses the transaction proposal according to the priority, wherein the channel adding request carries a channel identifier and a channel priority.
16. The apparatus according to claim 11 or 12, wherein the first node is a sequencing node in the blockchain network, and the service request is a transaction request, the apparatus further comprising: and the sending unit is used for sending the transaction request to a sequencing service node according to the priority.
17. The apparatus of claim 16,
the receiving unit is used for receiving a transaction queue sent by the sequencing service node after the sending unit sends the transaction request to the sequencing service node according to the priority, wherein the transaction queue is obtained by sequencing the transaction request of the channel by the sequencing service node;
the processing unit is further configured to process the transaction requests in the transaction queue according to a first-in first-out principle to obtain a block;
the sending unit is further configured to send the block to each peer node included in the channel.
18. The apparatus of claim 16,
the receiving unit is further configured to receive a data synchronization request sent by a first peer node, where the data synchronization request carries a channel identifier, and the first peer node is a node that joins the channel after the channel is established;
the processing unit is further configured to determine, according to the channel identifier and the priority, a block of a channel corresponding to the channel identifier;
the sending unit is further configured to send a data synchronization response to the first peer node according to the priority, where the data synchronization response carries the block corresponding to the channel.
19. The apparatus of claim 16,
the receiving unit is further configured to receive a channel creation request sent by the electronic device before receiving the transaction request, where the channel creation request carries a priority of a channel and an identifier of a peer node in the channel.
20. The apparatus of claim 11, further comprising: a sending unit, where the first node is a sequencing service node in the blockchain network, the service request is a transaction request, and the transaction request also carries the priority of the channel;
the processing unit is further configured to sort, according to the priority, the transaction requests corresponding to the channel identifiers according to a first-in first-out principle, so as to obtain a transaction queue;
the sending unit is used for sending the transaction queue to the sorting node.
21. A node of a blockchain network comprising a processor, a memory and a computer program stored on the memory and executable on the processor, characterized in that the processor implements the method according to any of the claims 1 to 10 when executing the program.
22. A storage medium having stored therein instructions which, when run on a node of a blockchain network, cause the node of the blockchain network to perform the method according to any one of claims 1 to 10.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910557462.6A CN111782350B (en) | 2019-06-25 | 2019-06-25 | Service processing method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910557462.6A CN111782350B (en) | 2019-06-25 | 2019-06-25 | Service processing method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111782350A true CN111782350A (en) | 2020-10-16 |
| CN111782350B CN111782350B (en) | 2024-06-14 |
Family
ID=72754908
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910557462.6A Active CN111782350B (en) | 2019-06-25 | 2019-06-25 | Service processing method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111782350B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116016689A (en) * | 2022-12-28 | 2023-04-25 | 蚂蚁区块链科技(上海)有限公司 | Message routing method, device and system based on chain codes |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2018059334A1 (en) * | 2016-09-29 | 2018-04-05 | 腾讯科技（深圳）有限公司 | Blockchain network, branch node, blockchain network application method and storage medium |
| CN109242681A (en) * | 2018-08-21 | 2019-01-18 | 北京京东金融科技控股有限公司 | Storage method, device, equipment and the system of asset data |
| WO2019024161A1 (en) * | 2017-08-04 | 2019-02-07 | 平安科技（深圳）有限公司 | Block chain-based data management method, block chain system, server and readable storage medium |
| CN109376020A (en) * | 2018-09-18 | 2019-02-22 | 中国银行股份有限公司 | Data processing method, device and the storage medium multi-tiling chain interaction and given |
| CN109508243A (en) * | 2018-07-27 | 2019-03-22 | 江西贪玩信息技术有限公司 | Service request processing method, device, computer equipment and storage medium |
| US20190190896A1 (en) * | 2017-12-18 | 2019-06-20 | International Business Machines Corporation | Protecting sensitive data in a distributed ledger system using a blockchain channel hierarchy |
-
2019
- 2019-06-25 CN CN201910557462.6A patent/CN111782350B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2018059334A1 (en) * | 2016-09-29 | 2018-04-05 | 腾讯科技（深圳）有限公司 | Blockchain network, branch node, blockchain network application method and storage medium |
| WO2019024161A1 (en) * | 2017-08-04 | 2019-02-07 | 平安科技（深圳）有限公司 | Block chain-based data management method, block chain system, server and readable storage medium |
| US20190190896A1 (en) * | 2017-12-18 | 2019-06-20 | International Business Machines Corporation | Protecting sensitive data in a distributed ledger system using a blockchain channel hierarchy |
| CN109508243A (en) * | 2018-07-27 | 2019-03-22 | 江西贪玩信息技术有限公司 | Service request processing method, device, computer equipment and storage medium |
| CN109242681A (en) * | 2018-08-21 | 2019-01-18 | 北京京东金融科技控股有限公司 | Storage method, device, equipment and the system of asset data |
| CN109376020A (en) * | 2018-09-18 | 2019-02-22 | 中国银行股份有限公司 | Data processing method, device and the storage medium multi-tiling chain interaction and given |
Non-Patent Citations (1)
| Title |
|---|
| "超级账本Fabric的架构与设计", 电脑编程技巧与维护, no. 18 * |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116016689A (en) * | 2022-12-28 | 2023-04-25 | 蚂蚁区块链科技(上海)有限公司 | Message routing method, device and system based on chain codes |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111782350B (en) | 2024-06-14 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109426949B (en) | Cross-chain transaction method and device | |
| CN112153085B (en) | Data processing method, node and block chain system | |
| US11769150B2 (en) | Transaction scheduling for block space on a blockchain | |
| CN111091429A (en) | Electronic bill identification distribution method and device and electronic bill generation system | |
| CN111163130B (en) | Network service system and data transmission method thereof | |
| CN110069346B (en) | Method and device for sharing resources among multiple processes and electronic equipment | |
| WO2022134797A1 (en) | Data fragmentation storage method and apparatus, a computer device, and a storage medium | |
| CN109462508B (en) | Node deployment method, device and storage medium | |
| CN110740057B (en) | Service deployment method and block chain platform | |
| CN109104368B (en) | Connection request method, device, server and computer readable storage medium | |
| CN109819023B (en) | Distributed transaction processing method and related product | |
| CN111461763A (en) | Resource allocation method and device | |
| CN112015811A (en) | Method, node and computing device for node management of blockchain system | |
| CN108733457A (en) | The implementation method and device of distributed transaction | |
| US20190372825A1 (en) | Communication apparatus, communication method, and recording medium | |
| CN111782350A (en) | Service processing method and device | |
| CN107045452B (en) | Virtual machine scheduling method and device | |
| CN112764897B (en) | Task request processing method, device and system and computer readable storage medium | |
| CN115314375A (en) | Block chain network cross-domain networking method, device, storage medium and program product | |
| CN112001800B (en) | Method and device for processing business in block chain system | |
| CN106559454B (en) | Resource access method, device and system | |
| CN113949632A (en) | Dynamic node configuration method and device for block chain | |
| CN110290215B (en) | Signal transmission method and device | |
| CN109905446B (en) | Service processing method, server and computer storage medium | |
| US9184996B2 (en) | Thin client system, management server, client environment management method and program |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |