Torus routing in the presence of multicasts
Hiroki Ishibashi · CSUSB ScholarWorks (California State University, San Bernardino) · 1996
multicast-packet routing algorithms for torus ; , interconnection networks of arbitrary size and dimensipn are presented.Multicast algorithm 1 uses repeated unicasts to perform multicasts.Multicast algorithm 2 and Multicast Algorithm 3 are new algorithms.These two algorithms are fully adaptive for unicast packets and partially adaptive for multicast packets in the sense that all paths are minimal.Multicast Algorithm 2 requires only three central queues, an injection queue (input buffer), and a delivery queue (output buffer) per node.Multicast Algorithm 3 requires three more central queues and an extra re-injection queue per node.The number of required central queues per node for both Multicast Algorithms 2 and 3 are constant regardless of the size and dimension of the torus network.In the presence of a large number of multicasts on large , networks, the third multicast algorithm performs close to the unicast algorithm.Since these algorithms are based on small-sized packet switching method, they are applicable to both multicomputer and Asynchronous Transfer Mode (ATM) switch design.A new technique to build scalable torus networks is also presented.Ill I would like to thank all faculty members for the excellent education.