scholarly journals Rapid Consensus Structure: Continuous Common Knowledge in Asynchronous Distributed Systems

Mathematics ◽  
2020 ◽  
Vol 8 (10) ◽  
pp. 1673
Author(s):  
Sang-Min Choi ◽  
Jiho Park ◽  
Kiyoung Jang ◽  
Chihyun Park
Keyword(s):  
Distributed Systems ◽  
Directed Acyclic Graph ◽  
Search Algorithm ◽  
Common Knowledge ◽  
Distributed Networks ◽  
Communication Overhead ◽  
Consensus Structure ◽  
Byzantine Fault Tolerance ◽  
Gossip Protocol ◽  
Share Information

A distributed system guarantees the acceptance of Byzantine fault tolerance (BFT) for information transmission. Practical BFT (pBFT) and asynchronous BFT (aBFT) are among the various available forms of BFT. Distributed systems generally share information with all participating nodes. After information is shared, the systems reshare it. Thus, ensuring BFT consumes a considerable amount of time. Herein, we propose Decision search protocols that apply the gossip protocol, denoted by DecisionBFT, for distributed networks with guaranteed BFT. Each protocol in DecisionBFT is completely asynchronous and leaderless; it has an eventual consensus but no round-robin or proof-of-work. The core concept of the proposed technology is the consensus structure, which is based on the directed acyclic graph (DAG) and gossip protocol. In the most general form, each node in the algorithm has a set of k neighbors of most preference. When receiving transactions, a node creates and connects an event block with all its neighbors. Each event block is signed by the hashes of the creating node and its k peers. The consensus structure of the event blocks utilizes a DAG, which guarantees aBFT. The proposed framework uses Lamport timestamps and concurrent common knowledge. Further, an example of a Decision search algorithm, based on the gossip protocol DecisionBFT, is presented. The proposed DecisionBFT protocol can reach a consensus when 2/3 of all participants agree to an event block without any additional communication overhead. The DecisionBFT protocol relies on a cost function to identify the k peers and generate the DAG-based consensus structure. By creating a dynamic flag table that stores connection information between blocks, the gossip protocol achieves a consensus in fewer steps than that in the case of the existing aBFT protocol.

Optimal election winning search algorithm for distributed systems

2017 ◽  
Author(s):  
Apurvanand Sahay ◽  
Tripty Singh ◽  
G. Karthik ◽  
Sunil Angadi
Keyword(s):  
Distributed Systems ◽  
Search Algorithm

scholarly journals Improved PBFT Algorithm For High-Frequency Trading Scenarios of Alliance Blockchain

2022 ◽  
Author(s):  
Song Tang ◽  
Zhiqiang Wang ◽  
Jian Jiang ◽  
Suli Ge ◽  
GaiFang Tan
Keyword(s):  
High Frequency ◽  
Communication Overhead ◽  
Byzantine Fault Tolerance ◽  
Consensus Process ◽  
Network Nodes ◽  
Consensus Algorithms ◽  
Blockchain Technology ◽  
Information Interaction ◽  
Simple Selection ◽  
Selection Of

Abstract With the continuous development of blockchain technology and the emergence of application scenarios, consensus algorithms are still the bottleneck restricting the number of network nodes and data writing efficiency that blockchain can support. How to improve the performance of alliance blockchains safely and efficiently has become an urgent problem to be solved at present. For the practical Byzantine fault tolerance algorithm (PBFT) commonly used in alliance blockchains, there are some problems, such as large communication overhead, simple selection of master nodes, and inability to expand and exit nodes dynamically in the network. This paper proposes an improved algorithm tPBFT (trust-based practical Byzantine algorithm), which is suitable for the high-frequency transaction scenario of alliance chains and introduces a trust interest scoring mechanism between network nodes to adjust the list of consensus nodes dynamically, simplify the PBFT consensus process and reduce the interaction overhead between network nodes. Theoretical analysis and experiments show that the improved tPBFT algorithm can effectively reduce the amount of information interaction between nodes, improve consensus efficiency and support more network nodes.

Dynamic Knowledge Discovery in Open, Distributed and Multi-Ontology Systems

2006 ◽  
pp. 226-258 ◽  
Author(s):  
Silvana Castano ◽  
Alfio Ferrara ◽  
Stefano Montanelli
Keyword(s):  
Distributed Systems ◽  
Knowledge Discovery ◽  
Resource Discovery ◽  
Peer To Peer ◽  
Information Resources ◽  
Information Resource ◽  
Peer To Peer Networks ◽  
Open Distributed Systems ◽  
Ontology Metadata ◽  
Share Information

In open distributed systems like peer-to-peer networks and Grids, many independent peers, possibly spanned across multiple organizations, need to share information resources (e.g., data, documents, services) provided by other nodes. By dynamic knowledge discovery we mean the capability of each node of finding knowledge in the system about information resources that, at a given moment, best match the requirements of a request for given target resource(s). The chapter will focus on describing models and techniques for ontology metadata management and ontology-based dynamic knowledge discovery in open distributed systems, by describing the architecture of a toolkit for information resource discovery and sharing developed in the Helios peer-based system.

UNIVERSAL ROUTING AND PERFORMANCE ASSURANCE FOR DISTRIBUTED NETWORKS

2007 ◽  
Vol 08 (01) ◽  
pp. 1-28
Author(s):  
KEVIN F. CHEN ◽  
EDWIN H.-M. SHA
Keyword(s):  
Distributed Systems ◽  
Large Scale ◽  
Distributed Networks ◽  
Distributed Network ◽  
Graph Layout ◽  
Universal Network ◽  
Wire Delay ◽  
And Performance ◽  
The Way

We show that universal routing can be achieved with low overhead in distributed networks. The validity of our results rests on a new network called the fat-stack. We show that from a routing perspective the fat-stack is efficient and is suitable for use as a baseline distributed network and as a crucial benchmark architecture for evaluating the performance of specific distributed networks. We show that the fat-stack is efficient by proving it is universal. A requirement for the fat-stack to be universal is that link capacities double up the levels of the network. We use methods developed in the areas of VLSI and processor interconnect for much of our analysis. We then show how to scale the fat-stack from a VLSI graph layout to a large-scale distributed topology and how the network can be an effective benchmark architecture. Our universality proofs show that a fat-stack of area Θ(A) can simulate any competing network of area A with [Formula: see text] overhead independently of wire delay. The universality result implies that the fat-stack of a given size is nearly the best routing network of that size. The fat-stack is also the minimal universal network for an [Formula: see text] overhead in terms of number of links. Actual simulations show that the fat-stack outperforms a mesh-based distributed network of comparable hardware usage. Our work helps explain why some deployed networks function in the way they do in terms of routing. It also provides an exemplary network of proven efficiency and scalability for building new distributed systems.

scholarly journals Applying Prolog to develop distributed systems

2010 ◽  
Vol 10 (4-6) ◽  
pp. 691-707 ◽  
Author(s):  
NUNO P. LOPES ◽  
JUAN A. NAVARRO ◽  
ANDREY RYBALCHENKO ◽  
ATUL SINGH
Keyword(s):  
Distributed Systems ◽  
Control Mechanism ◽  
Hash Table ◽  
Distributed Hash Table ◽  
Programming System ◽  
Byzantine Fault Tolerance ◽  
Distributed Software ◽  
Software Model ◽  
Programming Techniques ◽  
Table Data

AbstractDevelopment of distributed systems is a difficult task. Declarative programming techniques hold a promising potential for effectively supporting programmer in this challenge. While Datalog-based languages have been actively explored for programming distributed systems, Prolog received relatively little attention in this application area so far. In this paper we present a Prolog-based programming system, called DAHL, for the declarative development of distributed systems. DAHL extends Prolog with an event-driven control mechanism and built-in networking procedures. Our experimental evaluation using a distributed hash-table data structure, a protocol for achieving Byzantine fault tolerance, and a distributed software model checker—all implemented in DAHL—indicates the viability of the approach.

scholarly journals When Are Two Gossips the Same?

10.29007/ww65 ◽  
2018 ◽  
Author(s):  
Krzysztof Apt ◽  
Davide Grossi ◽  
Wiebe Van-Der-Hoek
Keyword(s):  
Common Knowledge ◽  
Gossip Protocol ◽  
Different Types ◽  
Depth Study ◽  
Gossip Protocols

We provide an in-depth study of the knowledge-theoretic aspects of communication in so-called gossip protocols. Pairs of agents communicate by means of calls in order to spread information—so-called secrets—within the group. Depending on the nature of such calls knowledge spreads in different ways within the group. Systematizing existing literature, we identify 18 different types of communication, and model their epistemic effects through corresponding indistinguishability relations. We then provide a classification of these relations and show its usefulness for an epistemic analysis in presence of different communication types. Finally, we explain how to formalise the assumption that the agents have common knowledge of a distributed epistemic gossip protocol.

CLUSTERING PROTOCOL FOR SENSOR NETWORKS

2006 ◽  
Vol 07 (04) ◽  
pp. 423-436 ◽  
Author(s):  
ARJAN DURRESI ◽  
VAMSI PARUCHURI ◽  
MIMOZA DURRESI ◽  
LEONARD BAROLLI
Keyword(s):  
Sensor Networks ◽  
Data Aggregation ◽  
Distributed Networks ◽  
Network Size ◽  
Covering Problem ◽  
Communication Overhead ◽  
Clustering Protocol ◽  
Minimum Number ◽  
Efficient Data ◽  
Present Simulation

In this paper we present Clustering Protocol for Sensor networks (CPS). Clustering techniques are used by different protocols and applications to increase scalability and reduce delays in sensor networks. Examples include routing protocols, and applications requiring efficient data aggregation. Our approach is based on the Covering Problem that aims at covering an area with minimum number of circular disks. CPS is a lightweight protocol that does not require any neighborhood information and imposes low communication overhead. We present simulation results to show the efficiency of CPS in both ideal cases and randomly distributed networks. Moreover, CPS is scalable with respect to density and network size.

An Adaptive Search Algorithm for Distributed Systems

2008 ◽  
Author(s):  
Li Sa ◽  
Lihui Shang ◽  
Jun Hou
Keyword(s):  
Distributed Systems ◽  
Search Algorithm ◽  
Adaptive Search

A MULTIPROCESSOR NETWORK ARRANGING REPLICATED OBJECTS IN PAIRWISE BALANCED COMBINATORIAL DESIGNS

1996 ◽  
Vol 06 (01) ◽  
pp. 85-91 ◽  
Author(s):  
SIMON Y. BERKOVICH ◽  
LIN-CHING CHANG
Keyword(s):  
Distributed Systems ◽  
Simulation Study ◽  
Object Oriented ◽  
Communication Overhead ◽  
Combinatorial Designs ◽  
Pairwise Balanced Design ◽  
Balanced Design ◽  
Direct Support ◽  
Design Property ◽  
New Type

The paper investigates a new type of computer interconnection structure using a combinatorial arrangement with pairwise balanced design property in which the interconnection is organized through replication of corresponding objects. The suggested system provides low access latency and reduces the communication overhead. A simulation study to evaluate the performance of this system is presented. The considered organization provides a direct support of object-oriented constructs in distributed systems.

Sign in / Sign up

Export Citation Format

Share Document