Efficient Degree Constrained Broadcast Method on P2P Networks

In this paper, we propose two algorithms for broadcasting a large data set with limited loads of all nodes on a DHT-based P2P network using a de Bruijn graph. One of the broadcast algorithms is applied to de Bruijn graphs with the restricted number of nodes. We prove that this algorithm broadcasts a data set along a degree-constrained spanning tree without global knowledge of a P2P network and that the ratio of the delay time by the algorithm to the minimum delay time is bounded by a constant factor. The other algorithm can be applied to all de Bruijn graphs. We show that this algorithm performs well in numerical experiments.