CN113032484B - Block chain-based data system congestion management method and system - Google Patents
Block chain-based data system congestion management method and system Download PDFInfo
- Publication number
- CN113032484B CN113032484B CN202110282012.8A CN202110282012A CN113032484B CN 113032484 B CN113032484 B CN 113032484B CN 202110282012 A CN202110282012 A CN 202110282012A CN 113032484 B CN113032484 B CN 113032484B
- Authority
- CN
- China
- Prior art keywords
- node
- transaction
- rate
- neighbor
- nodes
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000007726 management method Methods 0.000 title claims abstract description 11
- 238000000034 method Methods 0.000 claims description 13
- 230000002452 interceptive effect Effects 0.000 claims description 3
- 230000003993 interaction Effects 0.000 claims description 2
- 230000005540 biological transmission Effects 0.000 abstract description 2
- 239000000306 component Substances 0.000 description 2
- 239000008358 core component Substances 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 230000007246 mechanism Effects 0.000 description 2
- 125000002015 acyclic group Chemical group 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 230000001934 delay Effects 0.000 description 1
- 230000001419 dependent effect Effects 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 230000007774 longterm Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000008569 process Effects 0.000 description 1
- 230000010076 replication Effects 0.000 description 1
Classifications
-
- 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
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/07—Responding to the occurrence of a fault, e.g. fault tolerance
- G06F11/14—Error detection or correction of the data by redundancy in operation
- G06F11/1402—Saving, restoring, recovering or retrying
- G06F11/1446—Point-in-time backing up or restoration of persistent data
- G06F11/1448—Management of the data involved in backup or backup restore
-
- 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/25—Integrating or interfacing systems involving database management systems
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/12—Avoiding congestion; Recovering from congestion
-
- 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
Abstract
The invention discloses a congestion management method and a congestion management system for a data system based on a blockchain, wherein the congestion management method comprises the following steps: generating a basic guarantee rate by each node according to the obtained reputation; when a node transmits a transaction, the node interacts with neighbor nodes to acquire the allowed rate of each neighbor node, and transmits the transaction to the neighbor nodes with the allowed rate not lower than the basic guaranteed rate until each node in the blockchain adds the transaction to the local ledger copy. The invention controls and optimizes the limited system resource by the parameter of the credit value, eliminates the data transmission congestion caused by the occupation of extra resources exceeding the processing capacity of the nodes in the system, simultaneously gives consideration to the fairness and transparency of the block chain system, has the characteristic of long-acting consistency of the data, and provides fairness and safety which are basically equal to the actual demands.
Description
Technical Field
The invention relates to the field of Internet, in particular to a congestion management method and system for a data system based on a blockchain.
Background
The distributed ledger technique (DistributedLedger Technologies) DLT architecture is a point-to-point (P2P) network without trust, where nodes store local copies of a database called ledger. One of the basic characteristics of DLT is that nodes must agree on the status of the ledger without the aid of a central entity. Here, non-trust means that a node does not need to trust any other node, but only needs to trust that the system as a whole is operating properly. The first generation DLTs were pure token type public blockchains represented by bitcoin and ethernet, but these DLTs were not suitable for general application scenarios. In particular, ledgers in blockchains are stored in blocks, each block being cryptographically linked to the previous one. The longest chain contains the correct blocks, and new blocks should be added to this chain. However, due to network latency, if several chunks are created at the same time, multiple forks are created, but only one can become part of the system data blockchain, so in a conventional blockchain system, chunks should be created only once and the generation time between generating each chunk should be large enough, at least greater than the network latency. This process is too slow and inefficient. In addition, due to the competition mechanism, no matter how many nodes the whole system has, only a specific single node meeting the conditions can create the blockchain in unit time, which is definitely not suitable for a high-concurrency large-scale network interaction scene.
Distributed systems based on Directed Acyclic Graphs (DAGs) are increasingly being proposed for use in various fields as efficient trusted distributed systems in which transactions are stored separately into the system rather than in blocks. Each new transaction is keyed to two or more existing transactions. Multiple nodes may write transactions at the same time, so there is no serial processing restriction corresponding to the blockchain. However, DAG-based DLT requires congestion control because the resources of the nodes are limited. In particular, network resources must be allocated to nodes based on their owned cryptographically verifiable resources. In blockchains, such as bitcoin and ethernet, this resource represents computing power. In addition, the resources that each node can allocate are also differentiated according to the associated index.
In DAG-based DLT, each node must verify each transaction, add it to the ledger, and then run some consensus algorithm, we call the bottleneck. The details of writing a DLT implementation will vary from DLT implementation to DLT implementation and possibly even node to node. For example, in some DLTs, some nodes may perform the most computationally intensive tasks, while other limited nodes perform lighter tasks when written. If there is no congestion control, non-idioted transactions may accumulate.
Minimizing delay while seeking maximum throughput is subject to write bottlenecks and meeting the following requirements:
consistency-if a transaction is written by one correct node, it should be written by all correct nodes within a certain delay.
Fairness-all nodes should get a fair share of bandwidth, the resources that each node can possess are allocated according to their reputation value.
Security-malicious nodes should not interfere with any of the above requirements.
Disclosure of Invention
Aiming at a DLT system needing to manage transaction throughput, the invention provides a data system congestion management method based on a blockchain, and the congestion problem of the system is solved through embedding and evaluating credibility parameters.
The technical content of the invention comprises:
a congestion management method of a data system based on a block chain comprises the following steps:
1) Each node in the block chain obtains respective reputation, and generates a basic guarantee rate according to the reputation;
2) When a node P in a blockchain m When issuing transaction, the node is connected with neighbor nodesInteractive, each neighbor node is acquired>Is set to be equal to the allowable rate of (1),and according to the node P m Is a basic guaranteed rate lambda of m Transmitting the transaction to the permission rate not lower than the basic guarantee rate lambda m Neighbor node of->
3) Each neighbor nodeWrite the transaction into the local ledger copy and +.>Interactive, obtaining each corresponding neighbor node +.>Wherein i.gtoreq.1, and according to each neighbor node + ->Is a basic guaranteed rate of (2)Transmitting the transaction to the permission rate not lower than the basic guarantee rate +.>Corresponding neighbor node->Until each node in the blockchain adds the transaction to the local ledger copy.
Further, the reputation comprises: directly to the reputation of the node's wealth or delegated form.
Further, network resources are fairly allocated to nodes in the blockchain.
Further, neighbor nodesNot sending the transaction to node P m 。
Further, each neighbor nodeSend transaction to neighbor node->The method of (1) comprises: flooding method.
Further, each node maintains an inbox buffer.
Further, each node filters the transaction in the inbox buffer before adding the transaction to the local ledger copy.
Further, each node generates a speed of writing the transaction into the local ledger copy according to the reputation and the resource idleness of the node.
Further, the method of writing local ledger copies is determined according to the underlying ledger structure and implementation details of the distributed ledger technology.
A blockchain-based data system congestion management system, comprising:
the nodes are used for acquiring respective reputations and generating basic guarantee rates according to the reputations;
wherein, when a node P in the block chain m When issuing transaction, the node is connected with neighbor nodesInteractive, each neighbor node is acquired>And according to the allowed rate of the node P m Is a basic guaranteed rate lambda of m Transmitting the transaction to the permission rate not lower than the basic guarantee rate lambda m Neighbor node of->Each neighbor node->Write the transaction into the local ledger copy and +.>Interactive, obtaining each corresponding neighbor node +.>Wherein i.gtoreq.1, and is dependent on neighbor node +.>Is>Transmitting the transaction to the permission rate not lower than the basic guarantee rate +.>Neighbor node of->Until each node in the blockchain adds the transaction to the local ledger copy.
Compared with the prior art, the method has the following advantages:
1) The limited system resources are controlled and optimized through the credit value, so that data transmission congestion caused by the fact that nodes in the system occupy extra resources exceeding the processing capacity of the nodes is eliminated, meanwhile, the fairness of the block chain system is considered, and the system has the characteristics of transparency and long-acting consistency of data;
2) The invention considers fairness (decentralization) and safety on the premise of mainly aiming at improving the system performance, and provides fairness and safety which are basically equal to actual requirements.
Drawings
FIG. 1 is a system frame diagram of the present invention.
Detailed Description
In order to make the objects and technical solutions of the present invention more apparent, embodiments of the present invention will be described in detail below with reference to the accompanying drawings.
The main work of the invention is as follows: 1) A node model is provided for capturing the main bottleneck of a write transaction. 2) A DLT system congestion control algorithm based on DAG is provided, which is suitable for any distributed database replication architecture. The algorithm has two core components, namely a scheduling algorithm, which ensures that all nodes can fairly obtain the reputation which they should obtain; a rate setting algorithm is used to solve bottleneck write problems by setting the associated rate while preventing delays.
Node and network model: the set of all participating network nodes is denoted as M. Each node M e M has a set of neighborsThey communicate directly through a secure bi-directional channel. The data shared by the nodes, referred to as transactions, may include signature updates of account balances or other data. When a transaction appears in all ledgers, it is referred to as a propagation. Those transactions that have been created but not yet distributed are defined as non-distributed transactions. The transaction propagation rate of node i is denoted as D i The propagation rate of all transactions is denoted d. The propagation rate may be a measure of the throughput of the network in dlt. Transaction propagation Rate in the long term +.>Is bounded in that the node has a write bottleneck, which will be the primary indicator used to evaluate the performance of the congestion control algorithm, n being the number of nodes in the node set M. Examples of reputation systems suitable for models include direct connection toReputation of the node wealth, reputation in delegated form. The reputation of node m is expressed as rep m And all nodes know the reputation distribution of the other nodes. Since the system is a common decision mechanism for decentralization, each node has decision weights, and the decision basis is that each node knows the reputation status of other nodes.
1) Issuing a transaction: the transaction is issued by the node and cryptographically signed, linking the transaction to the issuer. This means that the receiving node can identify the node that generated any transaction. Each node has a minimum score that is proportional to their reputation. In other words, node m has a substantially guaranteed rate lambda m . Receive and forward transactions: nodes receive transactions from their neighbors and forward the transactions to their neighbors, each node maintaining an Inbox buffer, denoted as an Inbox m It contains transactions received from neighbors and issued by themselves. Transactions may be filtered before being added to the inbox to prevent spam. By means of an Inbox m (i) Representing the set of transactions that node i issues in the inbox buffer of node m. Flooding is used here to forward the transaction, meaning that all new information is forwarded to all neighbors (except the source node) regardless of whether the neighbor already owns it. The size of each buffer is limited and each node M should ensure an Inbox at the other nodes i e M i (m) does not become too large as this would result in excessive queuing delay. Thus, the transaction flow from m to i consists of transactions issued by all nodes (except for transactions sent from i itself). We call the transaction sequence issued by node i the stream of i.
2) Write transaction: when a node is notified of a new transaction, a series of operations must be taken to add the transaction to the node's local ledger copy. The local ledger copy refers to data backup performed by a node in a self equipment system, is irrelevant to other nodes, and is mainly used for storing own data and data related to the node received in other systems. These steps are called writing, and the details required to write a transaction will depend on the underlying ledger structure, as well as the details specific to the DLT implementation.
Congestion control algorithm: congestion control algorithms strive to maximize the utilization of resources while ensuring that consistency, fairness, and safety requirements are met. The two core components of the solution are a scheduling algorithm and a rate setting algorithm:
1) Scheduling and distributing: the goal of this component is to schedule transactions, per rep by each node i ε M i Is published at a rate of (a). In other words, weighted upper and lower fairness is achieved on the write rate of the publishing node. For a node m, transactions can be issued at an appropriate rate with respect to its reputation, while the following requirements will be met:
a) m transactions will not backlog at any node, so the consistency of m transactions will be ensured;
b) Network resources are fairly distributed to m, and a malicious node with the sending rate exceeding the allowed rate can not interrupt the propagation rate of m, so that the safety requirement is met.
2) Rate setting: the rate setting component performs random allocation according to the reputation and resource idleness.
The test network of the invention consists of 15 nodes, which are arranged in a random 4-regular graph, namely, each node has 4 random neighbors. The channel delay is random between 50ms and 150ms and does not change over time. Consider first a set of 5 nodes in each non-malicious mode of operation. The node is identified by a letter representing the node's mode of operation and a number representing the node's reputation.
The rate of content nodes converges to their guaranteed problem rate and since each group has the same reputation, best effort nodes converge to twice their guaranteed rate, consuming unused resources left by inactive nodes.
The non-distributed transactions exhibit consistency, the protocol does not discard any transactions, and the number of non-distributed transactions remains limited. Meanwhile, while transactions must pass through each node, and different transactions have different start and end points, the average delay is bounded.
The above examples are provided for the purpose of describing the present invention only and are not intended to limit the scope of the present invention. The scope of the invention is defined by the appended claims. Various equivalents and modifications that do not depart from the spirit and principles of the invention are intended to be included within the scope of the invention.
Claims (7)
1. A congestion management method of a data system based on a block chain comprises the following steps:
1) Each node in the block chain obtains respective reputation, and generates a basic guarantee rate according to the reputation; wherein generating a basic assurance rate from the reputation comprises:
calculating a lowest score, said lowest score being proportional to said reputation;
obtaining a basic guaranteed rate according to the minimum score;
2) When a node P in a blockchain m When issuing transaction, the node is connected with neighbor nodesInteractive, each neighbor node is acquired>And according to the allowed rate of the node P m Is a basic guaranteed rate lambda of m Transmitting the transaction to the permission rate not lower than the basic guarantee rate lambda m Neighbor node of->
3) Each neighbor nodeWrite the transaction into the local ledger copy and +.>Interactive, obtaining each corresponding neighbor node +.>Wherein i.gtoreq.1, and according to each neighbor node + ->Is>Transmitting the transaction to the permission rate not lower than the basic guarantee rate +.>Corresponding neighbor node->Until each node in the blockchain adds the transaction to the local ledger copy.
2. The method of claim 1, wherein network resources are fairly allocated to nodes in a blockchain.
3. The method of claim 1, wherein a neighbor nodeNot sending the transaction to node P m 。
4. The method of claim 1, wherein each neighbor nodeTransmitting transaction transactions to neighbor nodesThe method of (1) comprises: flooding method.
5. The method of claim 1, wherein each node maintains an inbox buffer.
6. The method of claim 5, wherein each node filters the transaction in an inbox buffer before adding the transaction to a local ledger copy.
7. A blockchain-based data system congestion management system, comprising:
the nodes are used for acquiring respective reputations and generating basic guarantee rates according to the reputations; the generating a basic guaranteed rate according to the reputation comprises:
calculating a lowest score, said lowest score being proportional to said reputation;
obtaining a basic guaranteed rate according to the minimum score;
wherein, when a node P in the block chain m When issuing transaction, the node is connected with neighbor nodesInteractive, each neighbor node is acquired>And according to the allowed rate of the node P m Is a basic guaranteed rate lambda of m Transmitting the transaction to the permission rate not lower than the basic guarantee rate lambda m Neighbor node of->
Each neighbor nodeWrite the transaction into the local ledger copy and +.>Interaction, acquisitionEach corresponding neighbor node->Wherein i.gtoreq.1, and according to each neighbor node + ->Is>Transmitting the transaction to the permission rate not lower than the basic guarantee rate +.>Neighbor node of->Until each node in the blockchain adds the transaction to the local ledger copy.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110282012.8A CN113032484B (en) | 2021-03-16 | 2021-03-16 | Block chain-based data system congestion management method and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110282012.8A CN113032484B (en) | 2021-03-16 | 2021-03-16 | Block chain-based data system congestion management method and system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113032484A CN113032484A (en) | 2021-06-25 |
| CN113032484B true CN113032484B (en) | 2024-01-02 |
Family
ID=76471059
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110282012.8A Active CN113032484B (en) | 2021-03-16 | 2021-03-16 | Block chain-based data system congestion management method and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113032484B (en) |
Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109462631A (en) * | 2018-08-31 | 2019-03-12 | 腾讯科技（深圳）有限公司 | Data processing method, device, storage medium and electronic device |
| CN109949033A (en) * | 2018-11-15 | 2019-06-28 | 陕西医链区块链集团有限公司 | A kind of affaris safety trade system and method based on block chain |
| CN110362272A (en) * | 2019-06-03 | 2019-10-22 | 阿里巴巴集团控股有限公司 | A kind of block chain date storage method and device |
| WO2020000708A1 (en) * | 2018-06-29 | 2020-01-02 | 北京金山安全软件有限公司 | Blockchain node synchronization method and device using trust mechanism |
| CN110998631A (en) * | 2017-07-17 | 2020-04-10 | Dlt基数公司 | Distributed account book technology |
| CN110992177A (en) * | 2019-10-31 | 2020-04-10 | 中国科学院计算技术研究所 | Block chain flux improving method and system based on off-chain channel route evaluation mechanism |
| CN111127013A (en) * | 2019-12-24 | 2020-05-08 | 深圳大学 | Decentralized data transaction method, device, equipment and medium based on block chain |
| CN111837101A (en) * | 2019-09-12 | 2020-10-27 | 创新先进技术有限公司 | Log structure storage system |
| CN112149181A (en) * | 2020-09-29 | 2020-12-29 | 合肥城市云数据中心股份有限公司 | Hybrid cloud data center data transmission method with credit value analysis function |
| CN112381542A (en) * | 2020-11-18 | 2021-02-19 | 深圳源中瑞科技有限公司 | Transaction payment method, device, equipment and storage medium based on block chain |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20200348662A1 (en) * | 2016-05-09 | 2020-11-05 | Strong Force Iot Portfolio 2016, Llc | Platform for facilitating development of intelligence in an industrial internet of things system |
-
2021
- 2021-03-16 CN CN202110282012.8A patent/CN113032484B/en active Active
Patent Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110998631A (en) * | 2017-07-17 | 2020-04-10 | Dlt基数公司 | Distributed account book technology |
| WO2020000708A1 (en) * | 2018-06-29 | 2020-01-02 | 北京金山安全软件有限公司 | Blockchain node synchronization method and device using trust mechanism |
| CN109462631A (en) * | 2018-08-31 | 2019-03-12 | 腾讯科技（深圳）有限公司 | Data processing method, device, storage medium and electronic device |
| CN109949033A (en) * | 2018-11-15 | 2019-06-28 | 陕西医链区块链集团有限公司 | A kind of affaris safety trade system and method based on block chain |
| CN110362272A (en) * | 2019-06-03 | 2019-10-22 | 阿里巴巴集团控股有限公司 | A kind of block chain date storage method and device |
| CN111837101A (en) * | 2019-09-12 | 2020-10-27 | 创新先进技术有限公司 | Log structure storage system |
| CN110992177A (en) * | 2019-10-31 | 2020-04-10 | 中国科学院计算技术研究所 | Block chain flux improving method and system based on off-chain channel route evaluation mechanism |
| CN111127013A (en) * | 2019-12-24 | 2020-05-08 | 深圳大学 | Decentralized data transaction method, device, equipment and medium based on block chain |
| CN112149181A (en) * | 2020-09-29 | 2020-12-29 | 合肥城市云数据中心股份有限公司 | Hybrid cloud data center data transmission method with credit value analysis function |
| CN112381542A (en) * | 2020-11-18 | 2021-02-19 | 深圳源中瑞科技有限公司 | Transaction payment method, device, equipment and storage medium based on block chain |
Non-Patent Citations (5)
| Title |
|---|
| Blockchain-based platforms: Decentralized infrastructures and its boundary conditions;Joana Pereira等;Technological Forecasting and Social Change;94-102 * |
| DAG链上的共识机制与均衡;江航;中国优秀硕士学位论文全文数据库 (信息科技辑)(第2期);I138-1012 * |
| On Congestion Control for Distributed Ledgers in Adversarial IoT Networks;Andrew Cullen等;https://arxiv.org/pdf/2005.07778v1.pdf;1-7 * |
| PoRX: A reputation incentive scheme for blockchain consensus of IIoT;Eric Ke Wang等;Future Generation Computer Systems;第102卷;140-151 * |
| 基于分布式账本的去中心化存储系统框架;符纯浩;中国优秀硕士学位论文全文数据库 (信息科技辑);I137-72 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113032484A (en) | 2021-06-25 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| JP7114629B2 (en) | System and method for parallel verification of blockchain transactions | |
| Miller et al. | The honey badger of BFT protocols | |
| US6205119B1 (en) | Adaptive bandwidth sharing | |
| US8325761B2 (en) | System and method for establishing sufficient virtual channel performance in a parallel computing network | |
| CN112769550B (en) | Load balancing quantum key resource distribution system facing data center | |
| WO2020155653A1 (en) | Virtual optical network-oriented spectrum resource trading method and system | |
| CN114071582A (en) | Service chain deployment method and device for cloud-edge collaborative Internet of things | |
| JP2016208195A (en) | Packet relay device, copy function distribution method in packet relay device | |
| CN112737776B (en) | Data center-oriented quantum key resource allocation method for load balancing | |
| Müller et al. | Stability of local tip pool sizes | |
| CN111970149B (en) | Shared bandwidth implementation method based on hardware firewall QOS | |
| CN113032484B (en) | Block chain-based data system congestion management method and system | |
| CN113946455A (en) | Multi-stage feedback queue flow scheduling method based on bottleneck perception | |
| WO2024092993A1 (en) | Service function chain profit maximization mapping method and system | |
| Xu et al. | Curb: Trusted and scalable software-defined network control plane for edge computing | |
| CN115114009A (en) | Data query method, master node and slave nodes | |
| CN116261839A (en) | Operation of a distributed deterministic network | |
| Zhang et al. | RICH: Strategy-proof and efficient coflow scheduling in non-cooperative environments | |
| KR20220082898A (en) | Read access to computational results in distributed networks | |
| Liu et al. | Efficient coflow scheduling of multi-stage jobs with isolation guarantee | |
| Huang et al. | LWSBFT: Leaderless weakly synchronous BFT protocol | |
| Jeong et al. | A General and Robust Blockchain Storage System based on External Storage Service | |
| Cullen et al. | Access control in adversarial environments for IoT-oriented distributed ledgers | |
| Li et al. | Background traffic optimization for meeting deadlines in data center storage | |
| Podiatchev et al. | Survivable Payment Channel Networks |
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 |