Completely Independent Spanning Trees on BCCC Data Center Networks with an Application to Fault-Tolerant Routing

Xiao Yan Li, Wanling Lin, Ximeng Liu, Cheng Kuan Lin, Kung Jui Pai, Jou Ming Chang*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

14 Scopus citations


A set of k spanning trees in a graph G are called completely independent spanning trees (CISTs for short) if the paths joining every pair of vertices x and y in any two trees have neither vertex nor edge in common, except for x and y. The existence of multiple CISTs in the underlying graph of a network has applications in fault-tolerant broadcasting and secure message distribution. In this paper, we investigate the construction of CISTs in a server-centric data center network called BCube connected crossbars (BCCC), which can provide good network performance using inexpensive commodity off-the-shelf switches and commodity servers with only two network interface card (NIC) ports. The significant advantages of BCCC are its good expandability, lower communication latency, and higher robustness in component failure. Based on the structure of compound graphs of BCCC, we provide efficient algorithms to construct\lceil\frac{n}{4}\rceil$⌈n4⌉ CISTs in the logical graph of BCCC, denoted by LL-BCCC(n,k)BCCC(n,k), for n ≥ 5. As a by-product, we obtain a fault-tolerant routing that takes the constructed CISTs as its routing table. We then evaluate the performance of the fault-tolerant routing through simulation results.

Original languageEnglish
Pages (from-to)1939-1952
Number of pages14
JournalIEEE Transactions on Parallel and Distributed Systems
Issue number8
StatePublished - 1 Aug 2022


  • BCube connected crossbars (BCCC)
  • Completely independent spanning trees (CISTs)
  • compound graphs
  • data center networks (DCNs)
  • server-centric DCNs


Dive into the research topics of 'Completely Independent Spanning Trees on BCCC Data Center Networks with an Application to Fault-Tolerant Routing'. Together they form a unique fingerprint.

Cite this