An　emerging　datacenter　network　(DCN)　with　high　scalability　called　HSDC　is　a　server-centric　DCN　that　can　help　cloud　computing　in　supporting　many　inherent　cloud　services.　For　example,　a　server-centric　DCN　can　initiate　routing　for　data　transmission.　This　paper　investigates　the　construction　of　independent　spanning　trees　(ISTs　for　short),　a　set　of　the　rooted　spanning　trees　associated　with　the　disjoint-path　property,　in　HSDC.　Regarding　multiple　spanning　trees　as　routing　protocol,　ISTs　have　applications　in　data　transmission,　e.g.,　fault-tolerant　broadcasting　and　secure　message　distribution.　We　first　establish　the　vertex-symmetry　of　HSDC.　Then,　by　the　structure　that　n-dimensional　HSDC　is　a　compound　graph　of　an　n-dimensional　hypercube　Qn　and　n-clique　Kn,　we　amend　the　algorithm　constructing　ISTs　for　Qn　to　obtain　the　algorithm　required　by　HSDC.　Unlike　most　algorithms　of　recursively　constructing　tree　structures,　our　algorithm　can　find　every　node＇s　parent　in　each　spanning　tree　directly　via　an　easy　computation　relied　upon　only　the　node　address　and　tree　index.　Consequently,　we　can　implement　the　algorithm　for　constructing　n　ISTs　in　O(nN)　time,　where　N=n2n　is　the　number　of　vertices　of　n-dimensional　HSDC;　or　parallelize　the　algorithm　in　O(n)　time　using　N　processors.　Remarkably,　the　diameter　of　the　constructed　ISTs　is　about　twice　the　diameter　of　Qn.　©　2021　Elsevier　Inc.