Aiming at solving the security issue in multi-domain edge optical networks, we propose a trusted consensus solution based on blockchain and design a high-efficient consensus algorithm to meets the low-latency requirem...
详细信息
ISBN:
(纸本)9781957171005
Aiming at solving the security issue in multi-domain edge optical networks, we propose a trusted consensus solution based on blockchain and design a high-efficient consensus algorithm to meets the low-latency requirements of optical networks.
The main study focuses on the shortcomings of the traditional PBFT consensus algorithm and the DPOS consensus algorithm, and then combines the two algorithms to form a new consensus algorithm from the perspective of o...
详细信息
ISBN:
(纸本)9781665426060
The main study focuses on the shortcomings of the traditional PBFT consensus algorithm and the DPOS consensus algorithm, and then combines the two algorithms to form a new consensus algorithm from the perspective of optimising the consensus performance of the blockchain, which can achieve several advantages in terms of node reduction view switching, node dynamics, bandwidth overhead reduction, transaction throughput and lower system latency performance. The advantages of the improved PBFT algorithm are illustrated by the experimental data on throughput, system latency of account creation and bandwidth overhead, which are compared to illustrate the effect of the improved PBFT algorithm.
Data-driven algorithm design is a promising, learning-based approach for beyond worst-case analysis of algorithms with tunable parameters. An important open problem is the design of computationally efficient data-driv...
详细信息
We study deterministic and randomized streaming algorithms for word problems of finitely generated groups. For finitely generated groups that can be obtained from linear groups using the following operations we show t...
详细信息
This note describes a very simple O(1) query time algorithm for finding level ancestors. This is basically a serial (re)-implementation of the parallel algorithm of Berkman and Vishkin (*** and ***, Finding level-ance...
详细信息
This paper proposes an algorithm that decides if two simply connected spaces represented by finite simplicial sets of finite k-type and finite dimension d are homotopy equivalent. If the spaces are homotopy equivalent...
详细信息
Blockchain technology has become a popular technology since the introduction of WWW. With the introduction of Blockchain 2.0 and Blockchain 3.0 the limited applications of Blockchain increased exponentially. The effic...
详细信息
ISBN:
(纸本)9781665454025
Blockchain technology has become a popular technology since the introduction of WWW. With the introduction of Blockchain 2.0 and Blockchain 3.0 the limited applications of Blockchain increased exponentially. The efficient implementation of blockchain requires a lot of energy and computational resources, wherein the backend of the consensus algorithm implementation makes it power hungry. In this paper, we have introduced a new programming environment for the implementation of a consensus algorithm with requires less power and computational devices. The RUST-based implementation of the consensus algorithm makes it more power efficient
One of the most essential characteristics of Blockchain is the ability to validate the integrity of new transactions added to the blockchain. And one of the most essential consensus algorithms, Proof of Work, performs...
详细信息
One of the most essential characteristics of Blockchain is the ability to validate the integrity of new transactions added to the blockchain. And one of the most essential consensus algorithms, Proof of Work, performs this job. In this work, we implemented the Proof of Work consensus method on the block formed by performing the transaction using Ganache. The primary goal of this implementation is to understand the process and record how Proof of Work works in reality on newly created blocks.
Federated learning (FL) is a machine learning framework for collaborative data mining in many scenarios (e.g. Internet of Things) due to its privacy-preserving feature. However, various attacks arise security concerns...
详细信息
ISBN:
(纸本)9781665473316
Federated learning (FL) is a machine learning framework for collaborative data mining in many scenarios (e.g. Internet of Things) due to its privacy-preserving feature. However, various attacks arise security concerns of FL, such as poisoning, backdoor, and DDoS attacks. Several blockchain-based FL schemes strengthen credibility and security without considering the increased communication overhead. Some existing work compresses local updated gradients to sign vectors to lower communication overhead at the expense of model accuracy. To address the above concerns, this paper offers a blockchain-based asynchronous SignSGD (BASS) scheme. A novel asynchronous sign aggregation algorithm is introduced to ensure model accuracy even if the local updated gradients are compressed to sign vectors. Considering the unstable network connection on IoT, a consensus algorithm that elects multiple leader nodes enables reliable global model aggregation. The introduced blockchain improves credibility and security without downgrading efficiency. Empirical studies show that BASS outperforms other schemes in efficiency, model accuracy, and security.
consensus algorithms constitute a powerful tool for computing average values or coordinating agents in many distributed applications. Unfortunately, the same property that allows this computation (i.e., the nontrivial...
详细信息
ISBN:
(纸本)9781538613955
consensus algorithms constitute a powerful tool for computing average values or coordinating agents in many distributed applications. Unfortunately, the same property that allows this computation (i.e., the nontrivial nullspace of the state matrix) leads to unbounded state variance in the presence of measurement errors. In this work, we explore the trade-off between relative and absolute communication (feedback) in the presence of measurement errors. We evaluate the robustness of first and second order integrator systems under a parameterized family of controllers (homotopy), that continuously trade between relative and absolute feedback interconnections, in terms of the H-2 norm of an appropriately defined input-output system. Our approach extends the previous H-2 norm based analysis to systems with directed feedback interconnections whose underlying weighted graph Laplacians are diagonalizable. Our results indicate that any level of absolute communication is sufficient to achieve a finite H-2 norm, but purely relative feedback can only achieve finite norms when the measurement error is not exciting the subspace associated with the consensus state. Numerical examples demonstrate that smoothly reducing the proportion of absolute feedback in double integrator systems smoothly decreases the system performance (increases the H-2 norm) and that this performance degradation is more rapid in systems with relative feedback in only the first state (position).
暂无评论