Optimal doublecast path in hexagonal honeycomb mesh

Abstract

The performance of a multicomputer is greatly dependent on the multicast strategy, i.e., how to deliver the same message from a source node to a number of destination nodes. Building an optimal multicast path is suited for multicast wormhole routing. A doublecast path is a multicast path with exactly two destination nodes. Hexagonal honeycomb mesh is a promising candidate for interconnection networks. This paper addresses the building of an optimal doublecast path on hexagonal honeycomb mesh. A theorem concerned with the length of an optimal doublecast path is established, and a time-optimal algorithm for building an optimal doublecast path is proposed.