Three-round adaptive diagnosis schemes under the PMC model have been demonstrated to be effective in undirected n-cubes. However, existing local diagnosis approaches under the MM model cannot be directly applied to directed graphs due to the constraints imposed by directed edges. In this work, we consider a vertex u in a digraph D, and propose a directed local diagnosis structure \(\mathcal {T}(u,m)\) along with a corresponding three-round adaptive algorithm \(\texttt {ThrDiag}(\mathcal {T}(u, m), m)\) under the MM model. The proposed method ensures accurate identification of the faulty or fault-free status of u, provided that the total number of faulty vertices in the network does not exceed m.

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Three-Round Adaptive Local Diagnosis for Digraph Under MM Model

  • Xiawei Zhang,
  • Yihong Wang,
  • Eddie Cheng,
  • László Lipták,
  • Cheng-Kuan Lin

摘要

Three-round adaptive diagnosis schemes under the PMC model have been demonstrated to be effective in undirected n-cubes. However, existing local diagnosis approaches under the MM model cannot be directly applied to directed graphs due to the constraints imposed by directed edges. In this work, we consider a vertex u in a digraph D, and propose a directed local diagnosis structure \(\mathcal {T}(u,m)\) along with a corresponding three-round adaptive algorithm \(\texttt {ThrDiag}(\mathcal {T}(u, m), m)\) under the MM model. The proposed method ensures accurate identification of the faulty or fault-free status of u, provided that the total number of faulty vertices in the network does not exceed m.