Optimal Routing Algorithm and Diameter in Hexagonal Torus Networks

Nodes in the hexagonal mesh and torus network are placed at the vertices of a regular triangular tessellation, so that each node has up to six neighbors. The routing algorithm for the Hexagonal Torus is very complicated, and it is an open problem by now. Hexagonal mesh and torus are known to belong to the class of Cayley digraphs. In this paper, we use Cayley-formulations for the hexagonal torus, along with some result on subgraphs and Coset graphs, to develop the optimal routing algorithm for the Hexagonal Torus, and then we draw conclusions to the network diameter of the Hexagonal Torus.

[1]  Wenjun Xiao,et al.  Hexagonal and Pruned Torus Networks as Cayley Graphs , 2004, Communications in Computing.

[2]  Ivan Stojmenovic,et al.  Addressing and Routing in Hexagonal Networks with Applications for Tracking Mobile Users and Connection Rerouting in Cellular Networks , 2002, IEEE Trans. Parallel Distributed Syst..

[3]  Marie-Claude Heydemann,et al.  Cayley graphs and interconnection networks , 1997 .

[4]  N. Biggs.  Algebraic Graph Theory , 1974 .

[5]  David Semé,et al.  3D hexagonal network: modeling, topological properties, addressing scheme, and optimal routing algorithm , 2005, IEEE Transactions on Parallel and Distributed Systems.

[6]  Jurij Silc,et al.  High-Performance Computing on a Honeycomb Architecture , 1993, ACPC.

[7]  Ivan Stojmenovic,et al.  Enumeration of Polyhex Hydrocarbons to h = 17 , 1995, J. Chem. Inf. Comput. Sci..

[8]  Wenjun Xiao,et al.  Structural properties of Cayley digraphs with applications to mesh and pruned torus interconnection networks , 2007, J. Comput. Syst. Sci..

[9]  Wenjun Xiao,et al.  A Group Construction Method with Applications to Deriving Pruned Interconnection Networks , 2007, IEEE Transactions on Parallel and Distributed Systems.

[10]  Ming-Syan Chen,et al.  Addressing, Routing, and Broadcasting in Hexagonal Mesh Multiprocessors , 1990, IEEE Trans. Computers.

[11]  F. Leighton,et al.  Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes , 1991 .

[12]  Kang G. Shin.  HARTS: A Distributed Real-Time Architecture , 1991, Computer.

[13]  Wenjun Xiao,et al.  Some mathematical properties of cayley digraphs with applications to interconnection network design , 2005, Int. J. Comput. Math..

[14]  Julio Solano-González,et al.  Higher dimensional hexagonal networks , 2003, J. Parallel Distributed Comput..

[15]  Ivan Stojmenovic,et al.  Honeycomb Networks: Topological Properties and Communication Algorithms , 1997, IEEE Trans. Parallel Distributed Syst..

[16]  Parameswaran Ramanathan,et al.  Performance Analysis of Virtual Cut-Through Switching in HARTS: A Hexagonal Mesh Multicomputer , 1991, IEEE Trans. Computers.

[17]  Behrooz Parhami.  Introduction to Parallel Processing , 2002, Series in Computer Science.

[18]  Behrooz Parhami,et al.  Introduction to Parallel Processing: Algorithms and Architectures , 1999 .

[19]  Wenjun Xiao,et al.  Further mathematical properties of Cayley digraphs applied to hexagonal and honeycomb meshes , 2007, Discret. Appl. Math..

[20]  Wenjun Xiao,et al.  A Unified Addressing Schema for Hexagonal and Honeycomb Networks with Isomorphic Cayley Graphs , 2006, First International Multi-Symposiums on Computer and Computational Sciences (IMSCCS'06).