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.　©　1990-2012　IEEE.