期刊文献+

Restricted Fault Diameter of Hypercube Networks 被引量:1

Restricted Fault Diameter of Hypercube Networks
原文传递
导出
摘要 Abstract This paper studies restricted fault diameter of the n-dimensional hypercube networks Qn (n S 2). It is shown that for arbitrary two vertices x and y with the distance d in Qn and any set F with at most 2nm3 vertices in Qn m {x,y}, if F contains neither of neighbor-sets of x and y in Qn, then the distance between x and y in Qn m F is vigen byFurthermore, the upper bounds are tight. As an immediately consequence, Qn can tolerate up to 2nm3 vertices failures and remain diameter 4 if n=3 and n+2 if nS4 provided that for each vertex x in Qn, all the neighbors of x do not fail at the same time. This improves Esfahanian's result. Abstract This paper studies restricted fault diameter of the n-dimensional hypercube networks Qn (n S 2). It is shown that for arbitrary two vertices x and y with the distance d in Qn and any set F with at most 2nm3 vertices in Qn m {x,y}, if F contains neither of neighbor-sets of x and y in Qn, then the distance between x and y in Qn m F is vigen byFurthermore, the upper bounds are tight. As an immediately consequence, Qn can tolerate up to 2nm3 vertices failures and remain diameter 4 if n=3 and n+2 if nS4 provided that for each vertex x in Qn, all the neighbors of x do not fail at the same time. This improves Esfahanian's result.
出处 《Acta Mathematicae Applicatae Sinica》 SCIE CSCD 2003年第2期247-254,共8页 应用数学学报(英文版)
基金 Supported by ANSF (No.01046102) and NNSF of China (No.10271114).
关键词 Keywords Restricted connectivity restricted fault diameter HYPERCUBES Keywords Restricted connectivity, restricted fault diameter, hypercubes
  • 相关文献

参考文献14

  • 1Bond, J.B., Peyrat, C. Diameter vulnerability of some large interconnection networks. Cong. Numer.,66, 267-282 (1988).
  • 2Bondy, J.A., Murty, U.S.R. Graph theory with applications. MacMillan Press, London, 1976.
  • 3Esfahanian, A.H. Generalized measures of fault tolerance with application to N-cube networks. IEEE Trans. Comput., 38(11): 1586-1591 (1989).
  • 4Esfahanian, A.H., Hakimi, S.L. On computer a conditional edge-connectivity of a graph. Information Processing Letters, 27:195-199 (1988).
  • 5Harary, F. Recent results and unsolved problems on hypercube theory. Graph Theory, Combinatorics and Applications (edited by Alavi, Y., Chartrand, G., Oellermann, O.R. and Schwenk, A.J.), H, John Wiley Sons, Inc., 621-632, 1991.
  • 6Hayes, J.P., Mudge, T.N. Hypercube supercomputers. Proc. IEEE, 77(12): 1829-1841 (1989).
  • 7Hsu, D.F., Lyuu, Y.D. A graph-theoretical study of transmission delay and fault tolerance. International J. Mini and Microcomputers, 16(1): 35-42 (1994).
  • 8Krishnamoorthy, M.S., Krishnamurthy, B. Fault diameter of interconnection networks. Comput. Math.Applic. 13:557-582 (1987).
  • 9Latifi, S. Combinatorial analysis of the fault-diameter of the n-cube. IEEE Trans. Comput., 42(1): 27-33(1993).
  • 10Li, Q., Sotteau, D., Xu, J.M. 2-diameter of de Bruijn graphs. Networks, 28(1): 7-14 (1996).

同被引文献7

  • 1罗予频,郑晓,杨士元.双向双环局域网上最优容错路由选择的构成[J].电子器件,1997,20(1):503-507. 被引量:1
  • 2Akers S B ,Krishnamurthy B. A group-theoretic model for symmetric interconnection networks[J]. IEEE Trans. Comput. 1989,38: 555-566.
  • 3Lakshmivarahan S,Jwo J S,Dhall S K. Symmetry in interconnection networks based on Cayley graphs of permutations:A survey [J]. Parallel Comput. 1993,19:361-407.
  • 4Chalamaiah N ,Ramamurty B. Finding shortest paths in distributed loop networks[J]. Information Process- ing Letters 1998,67:157-161.
  • 5Rouskov Y ,Latifi S,Srimani P K. Conditional fault diameter of star graph networks[J]. J of Parallel and Distributed Computing,1996,33:91-97.
  • 6刘焕平,杨义先,胡铭曾.两类新的无向双环网络紧优无限族[J].系统工程理论与实践,2002,22(1):75-78. 被引量:13
  • 7陈协彬.一类双环网络的最优路由算法[J].漳州师范学院学报(自然科学版),2002,15(3):1-5. 被引量:6

引证文献1

二级引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部