The fault diameter and wide diameter are commonly used to measure the fault tolerance and transmission delay of interconnection networks beyond traditional diameter. The $\alpha$-wide diameter of graph $G$, denoted by $D_{\alpha }(G)$, is the minimum integer $l$ such that there exist at least $\alpha$ internally vertex disjoint paths of length at most $l$ for any two distinct vertices in $G$. The $\beta$-fault diameter of graph $G$, denoted by $D_{\beta }^f(G)$, is the maximum diameter of the survival graph obtained by deleting at most $\beta$ vertices in $G$. The exchanged crossed cube, as a compounded interconnection network denoted by $ECQ(s,t)$, holds the desirable properties of both crossed cube and exchanged hypercube, while achieving a better balanced between cost and performance of the parallel computing systems. In this paper, we construct $s+1$ internally vertex disjoint paths between any two distinct vertices of $ECQ(s,t)$. Moreover, we determine the upper and lower bounds of $(s+1)$-wide diameter and $s$-fault diameter of $ECQ(s,t)$, i.e., $\lceil \frac{s}{2}\rceil +\lceil \frac{t+1}{2}\rceil +4\le D_s^f(ECQ(s,t))\le D_{s+1}(ECQ(s,t))\le \lceil \frac{s+1}{2}\rceil +\lceil \frac{t+1}{2}\rceil +5$, which shows that the exchanged crossed cube has better efficiency and reliability than that of the exchanged hypercube.

故障直径和宽直径通常用来衡量超出传统直径的互连网络的容错能力和传输延迟。这$\alpha$-图形的宽直径$G$，表示为$D_{\alpha }（G）$, 是最小整数$我$使得至少存在$\alpha$内部顶点不相交路径的长度最多$我$对于任意两个不同的顶点$G$。这$\beta$-图断层直径$G$，表示为$D_{\beta }^F（G）$，是最多删除得到的生存图的最大直径$\beta$顶点在$G$。交换的交叉立方体，作为复合互连网络，表示为$乙C问（s,t）$，同时保留了交叉立方体和交换超立方体的理想属性，同时实现了并行计算系统的成本和性能之间的更好平衡。在本文中，我们构建$s+1$任意两个不同顶点之间的内部顶点不相交路径$乙C问（s,t）$。此外，我们还确定了$（s+1）$- 宽直径和$s$- 断层直径$乙C问（s,t）$， IE，$\lceil \frac{s}{2}\rceil +\lceil \frac{t+1}{2}\rceil +4\le D_s^F（乙C问（s,t））\le D_{s+1}（乙C问（s,t））\le \lceil \frac{s+1}{2}\rceil +\lceil \frac{t+1}{2}\rceil +5$，这表明交换的交叉立方体比交换的超立方体具有更好的效率和可靠性。