首页> 外文期刊>The Computer Journal >The g-Good-Neighbor Conditional Diagnosability of Locally Exchanged Twisted Cubes
【24h】

The g-Good-Neighbor Conditional Diagnosability of Locally Exchanged Twisted Cubes

机译:本地交换扭曲立方体的G-GEANY邻条件诊断性

获取原文
获取原文并翻译 | 示例
           

摘要

Connectivity and diagnosability are important parameters in measuring the fault tolerance and reliability of interconnection networks. The Rg-vertex-connectivity of a connected graph G is the minimum cardinality of a faulty set $X subseteq V (G)$ such that $G-X$ is disconnected and every fault-free vertex has at least g fault-free neighbors. The g-good-neighbor conditional diagnosability is defined as the maximum cardinality of a g-good-neighbor conditional faulty set that the system can guarantee to identify. The interconnection network considered here is the locally exchanged twisted cube $LeTQ,(s, mathrm{t})$. For $1 leq s leq t$ and $0 leq g leq s$, we first determine the Rg-vertex-connectivity of $LeTQ,(s, mathrm{t})$, then establish the g-good-neighbor conditional diagnosability of $LeTQ,(s, mathrm{t})$ under the PMC model and MM∗ model, respectively.
机译:连接和诊断性是测量互连网络的容错和可靠性的重要参数。 r. g - 连接图G的逆端连接是故障集的最小基数 $ x subseteq v(g )$ 这样 $ g-x $ 断开连接,每次无故障顶点都有至少G无故障邻居。 G-Good邻条件诊断性定义为系统可以保证识别的G-Good邻条件故障集的最大基数。这里考虑的互连网络是本地交换的扭曲立方体 $ letq ,(s, mathrm {t})$ 。为了 $ 1 leq s leq t $ $ 0 Leq G Leq S. $ ,我们首先确定r g - vertex-connectivity $ letq ,(s, mathrm {t})$ ,然后建立G-Good邻条件诊断 $ letq ,(s, mathrm {t})$ 在PMC模型和MM下 * 模型分别。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号