一种简单路由算法下的全互连立方体网络性能分析

本文研究在一种简单路由算法条件下全互连立方体网络(FCCN，Fully Connected Cubic Network)的性能。研究结果表明在应用简单路由算法的条件下，至少在80％以上的情况下可以得到最短路径，而且这个比例是随着网络规模的扩大而增大的，进而得到网络最大结点间距离和平均结点距离的公式，而且网络性能在通信局部性的条件下可以显著提高。计算结果证明FCCN在信息局部性系统中具有比较高的并行处理效率。

Study on Performance of Fully Connected Cubic Network with a Simple Routing Algorithm

Fully Connected Cubic Network ( FCCN ) is a constant degree multi-level hierarchical interconnection network. It has many excellent properties, such as high scalability and modularity. In this paper, the performance of a simple routing algorithm for FCCN is extensively analyzed by exploiting its recursive property. It is shown that at least 80% of the routes obtained from this simple algorithm are shortest paths, and this percentage continues to increase with the network size. Based on this analysis, the formula to estimate the maximum distance and average distance between network nodes is deduced. Accordingly, the network performance can be noticeably improved under the condition of communication locality. It is shown from computer simulation that FCCN has rather high efficiency concerning concurrent processing in local information network systems.