Kwong et al. (2011) proposed a reactive routing scheme using the multi-paths technique for integrating two mechanisms of route discovery and route maintenance in intra-domain IP networks. They further defined a route to be a protection routing if there is a loop-free alternate path for packet forwarding when a single failed component (including link or node) occurs. Later on, Tapolcai (2013) showed that a network possessing two completely independent spanning trees (CISTs for short) suffices to configure a protection routing. A set of $k(⩾2)$ spanning trees in a network is called CISTs if they are pairwise edge-disjoint and inner-node-disjoint. Particularly, if $k=2$, such a set of CISTs is called a dual-CIST. In the early stage, Hasunuma (2002) already pointed out that the problem of determining whether there exists a dual-CIST in a graph is NP-complete. In this paper, we investigate how to construct CISTs in a kind of hypercube-variant networks, called crossed cubes, and obtain the following results:

1) We develop a tree searching algorithm to find three CISTs of the crossed cube ${\mathit{CQ}}_6$, and then extend the result to the high-dimensional crossed cube ${\mathit{CQ}}_n$ for $n⩾7$ by induction.

2) We demonstrate that protection routing is also suitable for relatively large (static) network topologies with scalability, such as interconnection networks with recursive structure.

3) We configure a routing scheme called secure-protection routing as an application of CISTs in crossed cubes such that the routing is not only protected but also secure (i.e., no other node except the destination in the network can receive the complete message).

4) We provide simulation results to show the performance evaluation of the proposed routing.

w等。（2011年）提出了一种使用多路径技术的反应性路由方案，用于整合域内IP网络中的路由发现和路由维护两种机制。他们还定义了一个路由，如果在发生单个故障组件（包括链路或节点）时存在无环路的备用包转发路径，则该路由将成为保护路由。后来，Tapolcai（2013）证明，拥有两个完全独立的生成树（简称CIST）的网络足以配置保护路由。一套$ķ（⩾2）$如果网络中的生成树是成对的边不相交和内部节点不相交，则称为CIST。特别是如果$ķ=2$，这样的一组CIST称为双重CIST。Hasunuma（2002）在早期阶段已经指出，确定图中是否存在双重CIST的问题是NP完全的。在本文中，我们研究了如何在一种称为交叉立方体的超立方体变量网络中构造CIST，并获得以下结果：

1）我们开发了一种树搜索算法来查找交叉立方体的三个CIST ${\mathit{CQ}}_6$，然后将结果扩展到高维交叉立方体 ${\mathit{CQ}}_{ñ}$ 对于 $ñ⩾7$ 通过归纳。

2）我们证明保护路由也适用于具有可伸缩性的较大（静态）网络拓扑，例如具有递归结构的互连网络。

3）我们配置了一种称为安全保护路由的路由方案，作为CIST在交叉多维数据集中的应用，这样不仅可以保护路由而且可以保护路由（即，除了网络中的目的地之外，没有其他节点可以接收完整的消息）。

4）我们提供了仿真结果，以显示所建议路由的性能评估。