Subnetworks in BlockDAG

Abstract

In the article, we study the horizontal scaling of the Waterfall or similar blockDAG networks by partitioning them into subnetworks by applying hierarchical and graph-based clustering algorithms. It leads to the reducing the network load and, in addition, to the increasing of the potential performance parameters of the underlying protocol. We consider methods of topology construction, propose clustering algorithms, and perform a simulation of a network partitioning into subnetworks.