Matrix Star Graphs: A New Interconnection Networks Improving the Network Cost of Star Graphs

행렬 스타 그래프: 스타 그래프의 망 비용을 개선한 새로운 상호 연결망

In this paper, we propose a matrix star graph which improves the network cost of the well-known star grah as an interconnection network. We analyze its characteristics in terms of the network parameters, such as degree, scalability, routing, and diameter. The proposed matrix star graph MS2,n has the half degrees of a star graph S2n with the same number of nodes and is an interconnection network with the properties of node symmetry, maximum fault tolerance, and recursive structure. In network cost, a matrix star graph MS2,n and a star graph S2n are about 3.5n2 and 6n2 respectively which means that the former has a better value by a certain constant than the latter has.