Study of general incomplete star interconnection networks

Authors:
Shi Yuntao;Hou Zifeng;Song Jianping
Affiliations:
Institute of Computing Technology, The Chinese Academy of Sciences, Beijing 100080, P.R. China;Institute of Computing Technology, The Chinese Academy of Sciences, Beijing 100080, P.R. China;Institute of Computing Technology, The Chinese Academy of Sciences, Beijing 100080, P.R. China
Venue:
Journal of Computer Science and Technology
Year:
2002

Citing 8
Cited 0

A Group-Theoretic Model for Symmetric Interconnection Networks

IEEE Transactions on Computers
An Optimal Broadcasting Algorithm without Message Redundancy in Star Graphs

IEEE Transactions on Parallel and Distributed Systems
Broadcasting on incomplete WK-recursive networks

Journal of Parallel and Distributed Computing
A Routing and Broadcasting Scheme on Faulty Star Graphs

IEEE Transactions on Computers
Optimal Broadcasting on the Star Graph

IEEE Transactions on Parallel and Distributed Systems
A Comparative Study of Topological Properties of Hypercubes and Star Graphs

IEEE Transactions on Parallel and Distributed Systems
Incomplete Star: An Incrementally Scalable Network Based on the Star Graph

IEEE Transactions on Parallel and Distributed Systems
Communication Aspects of the Star Graph Interconnection Network

IEEE Transactions on Parallel and Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

The star networks, which were originally proposed by Akers and Harel, have suffered from a rigorous restriction on the number of nodes. The general incomplete star networks (GISN) are proposed in this paper to relieve this restriction. An efficient labeling scheme for GISN is given, and routing and broadcasting algorithms are also presented for GISN. The communication diameter of GISN is shown to be bounded by 4n - 7. The proposed single node broadcasting algorithm is optimal with respect to time complexity O(n log2 n).