An optimal message routing algorithm for circulant networks

A k-circulant network G(n;h1,h2, . . . ,hk) is an undirected graph where the node set is Zn 1⁄4 f0; 1; . . . ; n 1g and the edge set is the union of sets of unordered pairs Ei 1⁄4 fðu; uþ signðiÞ hjijðmodnÞÞju 2 Zng, for i 2 { k, . . . , 1,1, . . . ,k}. We present an optimal (i.e. using shortest paths) dynamic two-terminal message routing algorithm for k… CONTINUE READING