Path-based multicast routing for 2D and 3D mesh networks

Abstract

In this chapter, we address how to implement unicast and multicast routing algorithms efficiently in 2D and 3D mesh networks. To do this, we present several partitioning methods for the path-based multicast approach with different levels of efficiency. In path-based methods, a multicast message is routed along a path and the message is transferred to the destinations along this path. Partitioning methods divide the network into several logical partitions and assign destinations to different sets; one set for each partition covering destinations that belong to that partition. Smart partitioning methods must balance the sets and reduce the path length within each partition. All of the partitioning methods can be supported by a deterministic routing algorithm. However, in order to increase the performance, we design a general minimal and adaptive routing algorithm which is based on the Hamiltonian path and can be applied to all partitioning methods. The algorithm is simple and does not require any virtual channel for neither unicast nor multicast messages.