A parallel algorithm for constructing multiple independent spanning trees in bubble-sort networks

The use of multiple independent spanning trees (ISTs) for data broadcasting in networks provides a number of advantages, including the increase of fault-tolerance and secure message distribution. Thus, the designs of multiple ISTs on several classes of networks have been widely investigated. Kao et al. (2019) [18] proposed an algorithm to construct independent spanning trees in bubble-sort networks. The algorithm is executed in a recursive function and thus is hard to parallelize. In this paper, we focus on the problem of constructing ISTs in bubble-sort networks Bn and present a non-recursive algorithm. Our approach can be fully parallelized, i.e., every vertex can determine its parent in each spanning tree in constant time. This solves the open problem from the paper by Kao et al. Furthermore, we show that the total time complexity O(n⋅n!) of our algorithm is asymptotically optimal, where n is the dimension of Bn and n! is the number of vertices of the network. •We present an algorithm for constructing multiple independent spanning trees in bubble-sort networks.•Our approach can be fully parallelized, thus solving an open problem from Kao et al. (2019).•We show that the total time complexity of our algorithm is asymptotically optimal.