An Efficient Algorithm to Calculate The Connectivity of Hyper-Rings Distributed Networks

摘要

The aim of this paper is develop a software module to test the connectivity of various odd-sized HRs andattempted to answer an open question whether the node connectivity of an odd-sized HR is equal to itsdegree. We attempted to answer this question by explicitly testing the node connectivity's of various oddsizedHRs. In this paper, we also study the properties, constructions, and connectivity of hyper-rings. Weusually use a graph to represent the architecture of an interconnection network, where nodes representprocessors and edges represent communication links between pairs of processors. Although the number ofedges in a hyper-ring is roughly twice that of a hypercube with the same number of nodes, the diameter andthe connectivity of the hyper-ring are shorter and larger, respectively, than those of the correspondinghypercube. These properties are advantageous to hyper-ring as desirable interconnection networks. Thispaper discusses the reliability in hyper-ring. One of the major goals in network design is to find the bestway to increase the system’s reliability. The reliability of a distributed system depends on the reliabilities ofits communication links and computer elements.