Fault-tolerant routing algorithm based on disjoint paths in 3-ary n-cube networks with structure faults

Zhang, Yujie; Fan, Weibei; Han, Zhijie; Song, Yunfei; Wang, Ruchuan

doi:10.1007/s11227-021-03799-0

Cited by 4 publications

(1 citation statement)

References 40 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…By now, there have been several proposals for interconnection networks, concluding the BC graph 3 , k-ary n-cubes 4 and etc. A 3-ary n-cube's characteristics have been researched extensively [5][6][7] and the results showed that this interconnection network has appealing properties. We explore the diagnosability of the 3-ary n-cube 3 n Q under the SPMC model in this study.…”

mentioning

confidence: 99%

The diagnosability of 3-ary n-cubes under the symmetric PMC model

Lv,

Zhu

2023

Fourth International Conference on Computer Science and Communication Technology (ICCSCT 2023)

View full text Add to dashboard Cite

The diagnosability of many interconnection networks under the well-known PMC model and MM* has been examined as a gauge of the multiprocessor systems' diagnosis capacity. The symmetric PMC model (SPMC model), a variation of the famous PMC model, is recently proposed by Zhu et al. Based on the PMC model, the SPMC model is obtained by adding two assumptions: (1) Each pair of neighboring nodes is believed to test each other; (2) For a given syndrome, only its minimal consistent faulty sets are to be located in 1-step diagnosis. As well-known interconnection networks, a number of characteristics of the 3-ary n-cubes have been examined. In this paper, the diagnosability of 3-ary n-cubes under the symmetric PMC model is determined. The result shows that the diagnosability of a 3-ary n-cube under the SPMC model is almost double that of the PMC model.

show abstract

mentioning

confidence: 99%