Study on Performance of Fully Connected Cubic Network with a Simple Routing Algorithm
Hongyu Wang · Journal of Circuits and Systems · 2003
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.