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 Toms, and then we draw conclusions to the network diameter of the Hexagonal Torus.
Zhen Zhang Wenjun Xiao Mingxin He
Dept. of Computer Science, South China University of Technology Guangzhou, China 510641 Dept. of Com Dept. of Computer Science, South China University of Technology Guangzhou, China 510641
国际会议
7th International Symposium,APPT 2007(第7届高级并行处理技术大会)
广州
英文
241-250
2007-11-22（万方平台首次上网日期，不代表论文的发表时间）