ON OPTIMIZING DIAMETER AND AVERAGE DISTANCE OF DIRECTED INTERCONNECTED NETWORKS

被引：2
作者：
BRAUN, H
STEPHAN, FC
机构：
来源：
IEEE TRANSACTIONS ON COMPUTERS | 1993年 / 42卷 / 03期
关键词：
DIRECTED NETWORKS; GRAPH THEORY; INTERCONNECTION; MULTIPROCESSING; NETWORK DIAMETER; ROUTING; TOPOLOGY;
D O I：
10.1109/12.210177
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
This paper proposes a generic approach of constructing the topology of fixed degree directed networks for given node degree and size. Our topology has minimum diameter and allows us to answer Maekawa's problem partially. In addition, we provide an expansion operator Ex(X, n) to scale the network size. Furthermore we present fast routing algorithms for these networks, having logarithmic time complexity while using constant buffer size.
引用
收藏
页码：353 / 358
页数：6
相关论文
共 23 条
[1]  
BATCHER KE, 1976 P INT C PAR PRO, P65
[2]  
BRAUN H, 1990, 5TH P INT S COMP INF
[3]  
BRAUN H, 1990, THESIS KARLSRUHE
[4]  
BRAUN H, 1989, 1289 U KARLSR FAK IN
[5]  
BURTON FW, 1984, IEEE T COMPUT, V33, P278, DOI 10.1109/TC.1984.1676425
[6]  
de Bruijn N. G., 1946, P KONINKLIJKE NEDERL, V49, P758
[7]  
ELSPAS B, 1964, SWITCHING CIRCUIT TH, VS164, P133
[8]  
FIOL MA, 1987, IEEE T COMPUT, V36
[9]  
GOKE LR, 1973, 1ST P ANN S COMP ARC, P21
[10]  
KIENHOFER J, 1989, RUCKGEKOPPELTE BAUMR, P143
123