Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userStability and Scalability of Blockchain Systems
75
0
0.0
(
0
)
Added by
Aditya Gopalan
Publication date
2020
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
The blockchain paradigm provides a mechanism for content dissemination and distributed consensus on Peer-to-Peer (P2P) networks. While this paradigm has been widely adopted in industry, it has not been carefully analyzed in terms of its network scaling with respect to the number of peers. Applications for blockchain systems, such as cryptocurrencies and IoT, require this form of network scaling. In this paper, we propose a new stochastic network model for a blockchain system. We identify a structural property called emph{one-endedness}, which we show to be desirable in any blockchain system as it is directly related to distributed consensus among the peers. We show that the stochastic stability of the network is sufficient for the one-endedness of a blockchain. We further establish that our model belongs to a class of network models, called monotone separable models. This allows us to establish upper and lower bounds on the stability region. The bounds on stability depend on the connectivity of the P2P network through its conductance and allow us to analyze the scalability of blockchain systems on large P2P networks. We verify our theoretical insights using both synthetic data and real data from the Bitcoin network.
rate research
Read More
Large-scale computational experiments, often running over weeks and over large datasets, are used extensively in fields such as epidemiology, meteorology, computational biology, and healthcare to understand phenomena, and design high-stakes policies affecting everyday health and economy. For instance, the OpenMalaria framework is a computationally-intensive simulation used by various non-governmental and governmental agencies to understand malarial disease spread and effectiveness of intervention strategies, and subsequently design healthcare policies. Given that such shared results form the basis of inferences drawn, technological solutions designed, and day-to-day policies drafted, it is essential that the computations are validated and trusted. In particular, in a multi-agent environment involving several independent computing agents, a notion of trust in results generated by peers is critical in facilitating transparency, accountability, and collaboration. Using a novel combination of distributed validation of atomic computation blocks and a blockchain-based immutable audits mechanism, this work proposes a universal framework for distributed trust in computations. In particular we address the scalaibility problem by reducing the storage and communication costs using a lossy compression scheme. This framework guarantees not only verifiability of final results, but also the validity of local computations, and its cost-benefit tradeoffs are studied using a synthetic example of training a neural network.
Wireless blockchain network is proposed to enable a decentralized and safe wireless networks for various blockchain applications. To achieve blockchain consensus in wireless network, one of the important steps is to broadcast new block using wireless channel. Under wireless network protocols, the block transmitting will be affected significantly. In this work, we focus on the consensus process in blockchain-based wireless local area network (B-WLAN) by investigating the impact of the media access control (MAC) protocol, CSMA/CA. With the randomness of the backoff counter in CSMA/CA, it is possible for latter blocks to catch up or outpace the earlier one, which complicates blockchain forking problem. In view of this, we propose mining strategies to pause mining for reducing the forking probability, and a discard strategy to remove the forking blocks that already exist in CSMA/CA backoff procedure. Based on the proposed strategies, we design Block Access Control (BAC) approaches to effectively schedule block mining and transmitting for improving the performance of B-WLAN. Then, Markov chain models are presented to conduct performance analysis in B-WLAN. The results show that BAC approaches can help the network to achieve a high transaction throughput while improving block utilization and saving computational power. Meanwhile, the trade-off between transaction throughput and block utilization is demonstrated, which can act as a guidance for practical deployment of blockchain.
In recent years, many DHT-based P2P systems have been proposed, analyzed, and certain deployments have reached a global scale with nearly one million nodes. One is thus faced with the question of which particular DHT system to choose, and whether some are inherently more robust and scalable. Toward developing such a comparative framework, we present the reachable component method (RCM) for analyzing the performance of different DHT routing systems subject to random failures. We apply RCM to five DHT systems and obtain analytical expressions that characterize their routability as a continuous function of system size and node failure probability. An important consequence is that in the large-network limit, the routability of certain DHT systems go to zero for any non-zero probability of node failure. These DHT routing algorithms are therefore unscalable, while some others, including Kademlia, which powers the popular eDonkey P2P system, are found to be scalable.
In the past decade, blockchain has shown a promising vision greatly to build the trust without any powerful third party in a secure, decentralized and salable manner. However, due to the wide application and future development from cryptocurrency to Internet of Things, blockchain is an extremely complex system enabling integration with mathematics, finance, computer science, communication and network engineering, etc. As a result, it is a challenge for engineer, expert and researcher to fully understand the blockchain process in a systematic view from top to down. First, this article introduces how blockchain works, the research activity and challenge, and illustrates the roadmap involving the classic methodology with typical blockchain use cases and topics. Second, in blockchain system, how to adopt stochastic process, game theory, optimization, machine learning and cryptography to study blockchain running process and design blockchain protocol/algorithm are discussed in details. Moreover, the advantage and limitation using these methods are also summarized as the guide of future work to further considered. Finally, some remaining problems from technical, commercial and political views are discussed as the open issues. The main findings of this article will provide an overview in a methodology perspective to study theoretical model for blockchain fundamentals understanding, design network service for blockchain-based mechanisms and algorithms, as well as apply blockchain for Internet of Things, etc.
Blockchain is a popular method to ensure security for trusted systems. The benefits include an auditable method to provide decentralized security without a trusted third party, but the drawback is the large computational resources needed to process and store the ever-expanding chain of security blocks. The promise of blockchain for edge devices (e.g., internet of things) poses a variety of challenges and strategies before adoption. In this paper, we explore blockchain methods and examples, with experimental data to determine the merits of the capabilities. As for an aerospace example, we address a notional example for Automatic dependent surveillance-broadcast (ADS-B) from Flight24 data (https://www.flightradar24.com/) to determine whether blockchain is feasible for avionics systems. The methods are incorporated into the Lightweight Internet of Things (IoT) based Smart Public Safety (LISPS) framework. By decoupling a complex system into independent sub-tasks, the LISPS system possesses high flexibility in the design process and online maintenance. The Blockchain-enabled decentralized avionics services provide a secured data sharing and access control mechanism. The experimental results demonstrate the feasibility of the approach.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
