Efficient topology control of blockchain peer to peer network based on SDN paradigm

Abstract

Blockchain allows to securely store, using cryptography functions, validated transactions and other data across its peer to peer (P2P) network. This P2P network is generated and maintained by the participating peers in a distributed manner through peer discovery, neighbor selection and managing inbound/outbound connections. As these tasks require extra consumption of network bandwidth, energy, memory and CPU usage, resource-limited devices may not support inherent blockchain applications. Further, changes in the topology control functions or reconfiguration should be considered by all peers to fully benefit from the new performance, which can take time. The aim of this paper is to build a blockchain network in a manner that greatly reduce topology control overhead while guaranteeing the properties such as high flexibility, fast reconfigurability, connectivity, small diameter and clustering. For this, we propose to use the Software-Defined Networking (SDN) paradigm to manage the blockchain P2P network. This way, the topology control tasks are moved off the peers to a secure overlay layer composed of multiple servers having synchronized databases. This new layer is responsible for building and managing the topological structure of the P2P network layer based on random r-out digraphs. Next, we mathematically discuss r-out digraphs generation using binomial distribution and preferential attachment models. Then, and in order to reduce the number of connections per peer, we establish lower and minimum upper bounds on outbound and inbound connections respectively that still guarantee the P2P network feasibility and connectivity. Further, we investigate topological properties of blockchain P2P network such as connectivity, diameter and clustering. Finally, we provide extensive simulation and numerical results to verify the efficiency of our approach and illustrate the effects of centralized topology control on network performance.

An Efficient Blockchain Neighbor Selection Framework Based on Agglomerative Clustering

“…This method leads to excessive dependence on the nodes that have the shortest total propagation time, which can reduce node performance. Deshpande et al [44] proposed a centralized solution. This solution utilizes the principles of Software-Defined Networking (SDN) to reduce the excessive overhead in managing a distributed network for blockchains.…”

Blockchain technology, methodology behind it, and its most extensively used encryption techniques.

“…Some bootstrap nodes complete the otherwise empty peers' lists. The remainder is progressively filled by peers identified using a distributed peer discovery method, such as Peers' list Exchange Protocol (PEX) and a modified Kademlia DHT protocol [22].A blockchain system must quickly distribute freshly created blocks to maintain a consistent global picture independent of the network's representation. A routing protocol may not be needed, but a synchronization protocol.…”

A Survey on Network Optimization Techniques for Blockchain Systems

“…Deshpande et al [83] used a centralized approach, as shown in Figure 7, to reduce the overhead incurred by the distributed network management of a vanilla blockchain. Dedicated servers generated the P2P topology and assigned neighbors to each peer.…”