计算机工程与应用Issue(22)：3-6,4.DOI:10.3778/j.issn.1002-8331.1303-0169
k元n方体网络的可靠性
Reliability of k-ary n-cube networks
摘要
Abstract
The k-ary n-cube Qkn is one of the most popular interconnection networks in large-scale multiprocessor systems. For 1≤m≤n-1 , let F be a faulty set in Qkn consisting of a nonempty node set VF and a nonempty link set EF such that there does not exist a Qkn-m in Qkn-F and the set of Qkn-m ’s damaged by VF and the set of Qkn-m's damaged by EF do not contain each other. Let f*(n,m) be the minimum cardinality of the faulty set F required to damage all the Qkn-m ’s in Qkn . In this paper, the following results are proved. For odd k≥3 , f*(n,1) is k+1 and f*(n,n-1) is k n-1-1+n . The lower and upper bounds on f*(n,m) are km and Cm-1n-1km+C m-1n-2k m-1 , respectively. Finally, the example shows that the upper bound Cm-1n-1km+Cm-1n-2km-1 is optimal.关键词
可靠性/互连网络/k元n方体/故障集Key words
reliability/interconnection networks/k-ary n-cubes/faulty sets分类
信息技术与安全科学引用本文复制引用
张国珍..k元n方体网络的可靠性[J].计算机工程与应用,2013,(22):3-6,4.基金项目
国家自然科学基金（No.61070229）；教育部博士点基金（No.20111401110005）。 （）
