分层立方网络在MM~*模型下的g好邻条件诊断度  

The g-good-neighbor Conditional Diagnosability of Hierarchical Cubic Networks Under MM~* Model

作　　者：赵昳 原军[1] 

机构地区：[1]太原科技大学应用科学学院,太原030024

出　　处：《太原科技大学学报》2018年第1期63-68,共6页Journal of Taiyuan University of Science and Technology

基　　金：国家自然科学基金(61402317);国家数学天元基金(11126076);山西省青年自然科学基金(2012021001-2)

摘　　要：诊断度在衡量互联网络可靠性方面有着重要的作用。许多著名网络的诊断度已被研究。g好邻条件诊断度扩展了传统诊断度的概念,它要求每个非故障处理器至少有g个非故障邻点。本文证明了分层立方网络HCNn在MM*模型下的1-好邻条件诊断度为2n+1,2-好邻条件诊断度为4n-1.Diagnosability has an important effect on the reliability of an interconnection network, and the diagnosability of many well-known networks has been explored. The g-good-neighbor conditional diagnosability is the popularization of the classical diagnosability. It restricts every healthy vertex and has at least g fault-free neighboring vertices. In this paper,we show that the g-good-neighbor conditional diagnosability of HCNnunder the MM*model is 2 n + 1,4 n-1 respectively for g = 1,g = 2.

关 键 词：故障诊断 MM＊模型 分层立方网络 条件诊断度 g好邻条件诊断度 

分 类 号：O157.5[理学—数学]