Abstract: In the research of fault tolerance parallel computer systems，routing algorithm is a very important subject.In this paper，the performance of 3-D Mesh networks adaptive routing and deterministic routing under the model in which each network node has independent failure probability is studied.Develope a new technique that enables us to derive formally proven success probability for the two routing schemes，so the routings can be compared and analyzed.The study shows that adaptive routing algorithm has the clear advantage over deterministic routing algorithm.On the one hand，the adaptive algorithm which is based on partial information becomes more effective.On the other hand，adaptive algorithm is more robust to node failure and to network size，so it has higher success probability.

摘要： 在研究并行计算机系统容错时，路由算法是一个极为重要的研究课题。主要研究的是自适应路由算法和确定性路由算法在3D-Mesh网络上的性能。在每个结点具有独立的出错概率的模型下，提出的方法使得能够严格地推导出路由算法的成功概率，从而能够对算法进行分析和比较。研究结果表明，自适应路由算法具有明显的优势。一方面，自适应路由算法基于局部信息而变得高效；另一方面，自适应路由算法对于结点出错和网络规模具有更好的健壮性，而使其具有更高的成功概率。