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, 1≤s1

Keywords:

• Discrete mathematics
• Distributed computing
• Telecommunications network
• Dijkstra's algorithm
• Interconnection
• Wireless ad hoc network
• Shortest path problem
• Algorithm
• Mathematics
• Congruence (geometry)
• routing algorithm
• double loop
• Combinatorics
• time optimal

• Correction
• Source
• Cite
• Save
• Machine Reading By IdeaReader