A Constant Time Optimal Routing Algorithm for Undirected Double-Loop Networks.

Undirected double-loop networks G(n; ± s1, ± s2), where n is the number of its nodes, s1 and s2 are its steps, and =1, are important interconnection networks. In this paper, by using the four parameters of the L-shape tile and a solution of a congruence equation , we give a constant time optimal routing algorithm for G(n; ± s1, ± s2). Keywords: Distributed systems; undirected double-loop networks; optimal routing; shortest path; algorithm. [ABSTRACT FROM AUTHOR]