The　scale　of　data　center　networks　(DCNs)　has　grown　rapidly　with　the　increasing　popularity　of　cloud　computing,　data　explosion,　and　the　dramatic　drop　in　setup　costs.　Thus,　inevitable　component　failures　(including　switches　and　servers)　will　become　more　frequent.　A　DCN　requires　maintaining　regular　and　reliable　operation　and　providing　efficient　routing　algorithms　for　transmitting　data　between　servers.　Particularly,　fault-tolerant　routing　is　necessary.　Recently,　constructing　completely　independent　spanning　trees　(CISTs)　on　DCNs　has　received　much　attention　as　a　dual-CIST　(i.e.,　two　CISTs)　suffices　to　configure　protection　routing,　which　is　a　fault-tolerant　routing.　Moreover,　the　protection　routing　can　additionally　realize　a　secure　mechanism　if　it　is　configured　by　more　CISTs.　BCube　is　a　server-centric　DCN　with　many　advantages,　and　many　variations　were　deformed　from　BCube　with　application　requirements,　such　as　RCube　and　RRect.　In　this　paper,　we　provide　a　unified　framework　called　BCube-based　DCN　(BDCN)　that　integrates　the　representation　of　the　logic　graphs　of　DCNs　mentioned　above,　facilitating　consistent　algorithms＇　design.　Then,　we　develop　efficient　algorithms　to　construct　multiple　CISTs　on　BDCN　under　the　consideration　of　switch　failures.　Note　that　this　is　the　first　study　that　constructs　multiple　CISTs　in　DCNs　with　switch　failures.　Finally,　using　standard　metrics,　such　as　average　path　length　(APL)　and　transmission　failure　rate　(TFR),　we　evaluate　the　performance　of　the　fault-tolerant　routing　through　experiments.　©　1968-2012　IEEE.