A constant time optimal routing algorithm for undirected double-loop networks

Authors:
Bao-Xing Chen;Ji-Xiang Meng;Wen-Jun Xiao
Affiliations:
College of Mathematics & System Science, XinJiang University, P.R. China;College of Mathematics & System Science, XinJiang University, P.R. China;Dept. of Computer Science, South China University of Technology, P.R. China
Venue:
MSN'05 Proceedings of the First international conference on Mobile Ad-hoc and Sensor Networks
Year:
2005

Citing 11
Cited 0

Discrete Optimization Problem in Local Networks and Data Alignment

IEEE Transactions on Computers
Diameters of weighted double loop networks

Journal of Algorithms
An efficient algorithm to find optimal double loop networks

Selected papers of the 14th British conference on Combinatorial conference
An optimal message routing algorithm for double-loop networks

Information Processing Letters
Finding shortest paths in distributed loop networks

Information Processing Letters
A Combinatorial Problem Related to Multimodule Memory Organizations

Journal of the ACM (JACM)
The Minimum Distance Diagram of Double-Loop Networks

IEEE Transactions on Computers
A complementary survey on double-loop networks

Theoretical Computer Science
Fault-Tolerant Routing in Distributed Loop Networks

IEEE Transactions on Computers
A survey on multi-loop networks

Theoretical Computer Science
Optimal designs of directed double-loop networks

CIS'04 Proceedings of the First international conference on Computational and Information Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Undirected double-loop networks G(n; ± s1, ± s2), where n is the number of its nodes, s1 and s2 are its steps, 1≤s1s2n / 2 and gcd(n, s1, s2)=1, are important interconnection networks. In this paper, by using the four parameters of the L-shape tile and a solution (x̄,ȳ) of a congruence equation s1x+s2y≡1 (modn), we give a constant time optimal routing algorithm for G(n; ± s1, ± s2).