Abstract
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. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
Zhang, Z., Xiao, W., & He, M. (2007). Optimal routing algorithm and diameter in hexagonal torus networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4847 LNCS, pp. 241–250). Springer Verlag. https://doi.org/10.1007/978-3-540-76837-1_28
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
