首页    期刊浏览 2024年12月02日 星期一
登录注册

文章基本信息

  • 标题:An Efficient Algorithm to Calculate The Connectivity of Hyper-Rings Distributed Networks
  • 作者:Ashraf A. Aly ; Tom Altman
  • 期刊名称:International Journal of Information Technology Convergence and Services (IJITCS)
  • 印刷版ISSN:2231-1939
  • 电子版ISSN:2231-153X
  • 出版年度:2016
  • 卷号:6
  • 期号:2/3
  • 页码:1-12
  • 语种:English
  • 出版社:AIRCC
  • 摘要:The aim of this paper is develop a software module to test the connectivity of various odd-sized HRs a nd attempted to answer an open question whether the no de connectivity of an odd-sized HR is equal to its degree. We attempted to answer this question by exp licitly testing the node connectivity's of various odd- sized HRs. In this paper, we also study the propert ies, constructions, and connectivity of hyper-rings . We usually use a graph to represent the architecture o f an interconnection network, where nodes represent processors and edges represent communication links between pairs of processors. Although the number of edges in a hyper-ring is roughly twice that of a hy percube with the same number of nodes, the diameter and the connectivity of the hyper-ring are shorter and larger, respectively, than those of the correspondi ng hypercube. These properties are advantageous to hyp er-ring as desirable interconnection networks. This paper discusses the reliability in hyper-ring. One of the major goals in network design is to find the best way to increase the system’s reliability. The relia bility of a distributed system depends on the relia bilities of its communication links and computer elements.
  • 关键词:Hyper-ring Network; reliability; Network Connectivi ty; Network Conductivity
Loading...
联系我们|关于我们|网站声明
国家哲学社会科学文献中心版权所有