Shortest routing algorithm of the Exchanged Crossed Cube based on adjacent subcube group

Routing algorithms determine the efficiency of the interconnection network communication and a lot of research have been made. As a promising interconnection network structure, the Exchange Crossed Cube (ECQ) is now drawing more and more research attention for its excellent topology properties and preferable network performance. However, research on routing strategies of ECQ is still to be studied at present. Based on the concept of adjacent nodes and local subcube group of ECQ, this paper deduces the condition of edge routing along different dimensions and proposes the ECQ-ALSR (ECQ-Adjacency local subcube routing) routing algorithm. Through analysis and calculation, the time complexity of the algorithm is O(n
²
), which provides an important basis for further research on fault tolerance of ECQ network. In the end, through theoretical analysis of the algorithm and a concrete example, it is proved that the proposed routing algorithm can achieve the shortest path routing of any two nodes in ECQ network.