| Study of General Icomplete Star Interconnection Networks |
| |
| 作者姓名： | 史云涛 侯紫峰 |
| |
| 作者单位： | InstituteofComputingTechnology,TheChineseAcademyofSciences,Beijing100080,P.R.China |
| |
| 摘 要： | 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 GIS.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(nlog2n).
|
| 关 键 词： | 计算机网络 星形互连网络 路由 |
Study of general incomplete star interconnection networks |
| |
| Yuntao Shi,Zifeng Hou,Jianping Song.Study of General Icomplete Star Interconnection Networks[J].Journal of Computer Science and Technology,2002,17(3):356-361. |
| |
| Authors: | Yuntao Shi Zifeng Hou Jianping Song |
| |
| Affiliation: | (1) Institute of Computing Technology, The Chinese Academy of Sciences, 100080 Beijing, P.R. China |
| |
| 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 complexityO(nlog2
n).
The work of this paper is supported by the National Natural Science Foundation of China under Grant No.698962505. |
| |
| Keywords: | interconnection network expandability incomplete star graph routing and broadcasting algorithm |
| 本文献已被 维普 SpringerLink 等数据库收录！ |
