Centrality of nodes in Federated Byzantine Agreement Systems

Abstract

The federated Byzantine agreement system (FBAS) is a consensus model introduced by Mazières in 2016 where the participating nodes conceptually form a network, with links between them being established by each node individually and thus in a decentralized way. An important question is whether these decentralized decisions lead to an overall decentralized network. The level of (de-)centralization in a network can be assessed using centrality measures. In this paper we consider three different approaches for obtaining centrality measures for the nodes in an FBAS. Two of them are based on adapting well-known measures based on graphs and hypergraphs to the FBAS context. Since the network structure of an FBAS can be more complex than (usual) graphs or hypergraphs, we also develop a new, problem-adapted centrality measure. This new measure is based on the intactness of nodes, which is an important ingredient of the FBAS model. We illustrate advantages and disadvantages of the three approaches on several computed examples. We have implemented all centrality measures and performed all computations in the Python package Stellar Observatory.

arXiv comment24 pages, 3 figures

References in corpus (9)

• Subgraph Centrality in Complex Networks
• Complex Networks as Hypergraphs
• The Sum of Its Parts: Analysis of Federated Byzantine Agreement Systems
• Complexity of the quorum intersection property of the Federated Byzantine Agreement System
• Mathematical Analysis and Algorithms for Federated Byzantine Agreement Systems
• Committee Selection is More Similar Than You Think: Evidence from Avalanche and Stellar
• SybilQuorum: Open Distributed Ledgers Through Trust Networks
• Deconstructing Stellar Consensus (Extended Version)
• Decentralization in Open Quorum Systems