研究了加总线超立方网络的容错寻径问题．设 ＢＨｎ为一个已加总线的ｎ维超立方网络， Ｆ为其故障结点集合，｜Ｆ｜≤ｎ．研究了ＢＨｎ上任意两个非故障结点间的容错寻径问题．对于小规模的超立方网络，其直径由ｎ＋２降为３，而对于较大规模的超立方网络而言，其直径降到≤（ｎ／３）＋６．显然，当ｎ＞６时，ｎ＋２＞（ｎ／３）＋６．因此，加总线后的超立方网络同时具有更好的容错性能． The problem of fault-tolerant routing of additive hypercube networks is studied. Let BHn be an n-dimensional hypercube with bus added, F be its fault node set, | F | ≤n. The fault-tolerant routing problem between any two non-fault nodes on BHn is studied. For small-scale hypercube networks, its diameter is reduced from n + 2 to 3, whereas for larger-scale supra-cubic networks its diameter is reduced to ≤ (n / 3) +6. Obviously, n + 2> (n / 3) +6 when n> 6. Therefore, the bus after the hypercube network at the same time has a better fault tolerance.