具有大量错误结点的超立方体网络容错模型和容错路由算法研究.pptVIP

Algorithmic Analysis The parallel routing algorithm can find at least K=min(Dk(u),Dk(v)) parallel paths, each of which is either crossing through only ONE k-subcube sequence in which the subcubes are neighboring to each other, or crossing through TWO k-subcube sequences which are themselves neighboring to one another. Therefore, the total time complexity is O(K(Hn-k(u, v)+3)2k)，or O(Kn2k)，or O(n22k). Research Achievements – Parallel/Multipath Routing n k pf k-sc PF1 PF2 P1 P2 P3 PL NE TNE 10 3 0.1 100.0 99.8 69.9 7 6 7.0 120.0 132.4 132.4 10 3 0.5 100.0 99.1 69.4 7 5 6.9 120.1 132.3 132.3 10