Toward the completely independent spanning trees problem on BCube

Completely independent spanning trees (CISTs) are important construct which can be used in data center networks for multi-node broadcasting, one-to-all broadcasting, reliable broadcasting, and secure message distribution, etc. As a recently proposed server-centric data center network, BCube has many good properties. By focusing on the connections between servers, we define the logic graph of BCube as L-BCube. We study the construction of CISTs with small diameter on BCubek and show that there are n/2 [(n-1)/2 if n is odd] CISTs with the diameter 2k + 3 on L-BCubek by presenting a recursive algorithm.