Subnetworks in BlockDAG

Abstract

In this article, we study the horizontal scaling of the Waterfall network or similar blockDAG networks by applying hierarchical and graph-based clustering algorithms to partition them into subnetworks. This results in a reduction of network load and an increase in potential performance parameters of the underlying protocol. We consider methods of topology construction, propose clustering algorithms, and perform a simulation of the partitioning of a network into subnetworks.