Study on routing algorithms of fully connected cubic network
Wang Hong · Journal of Zhejiang University(Engineering Science) · 2001
Fully Connected Cubic Network(FCCN) is a multi\|level hierarchical interconnection network with constant degree for massive parallel processing systems. FCCN has a number of excellent properties, such as high scalability and modularity. An \%m\% level FCCN is constructed by \!fully connecting 8 (\%m\%-1)\|FCCNs. The diameter is in the order of the cubic root of the number of nodes. Owing to the highly scalable structure, the routing algorithm proposed for FCCN is very simple to implement, although the self\|routing algorithm is not optimal. We showed that in more than 85% case the minimum distance is obtained. By using the self\|routing algorithm the average internodal distance is also in order of the cubic root of the number of nodes.