Edge-disjoint spanning trees in the Möbius cube

In a network (Formula presented.), a set of spanning trees of (Formula presented.) that do not have any common edges is called the edge-disjoint spanning trees (EDSTs). EDSTs in a network can facilitate many network functionalities such as improving the rate of data broadcasting, secure message distribution, fault-tolerant broadcasting, etc., and have inspired many researchers’ interest. In this paper, we construct the optimal number of EDSTs in the Möbius cube (denoted (Formula presented.), (Formula presented.) being the dimension)–one of the most well-known, well-studied variants of the classical hypercube network. Leveraging the recursive structure of Möbius cube, we first introduce an algorithm to construct the optimal number (i.e. (Formula presented.)) of EDSTs in (Formula presented.). We then present the result of simulating the scenario of multiple edge failures in (Formula presented.), and evaluate the performance of edge-fault tolerant broadcasting using EDSTs.