Computer Science (HMC), Mathematics (HMC)
A unicast-based multicasting algorithm is presented for arbitrary interconnection networks arising in switch-based networks of workstations. The algorithm is optimal with respect tot he number of startups incurred and is provably free from depth contention. Specifically, no two constituent unicasts for the same multicast contend for a common channel, even if some unicasts are delayed due to unpredictable variations in latencies. The algorithm uses an underlying partially adaptive deadlock-free unicast routing algorithm. Simulation results indicate that the algorithm behaves as predicted by its theoretical properties and provides a promising approach to unicast-based multicasting.
© 1998 World Academy of Science
R. Libeskind-Hadas, D. Mazzoni, and R. Rajagopalan, “Optimal Contention-Free Unicast-Based Multicasting in Switch-Based Networks of Workstations,” Proceedings of the Merged 12th International Parallel Processing Symposium and the 9th Symposium on Parallel and Distributed Processing, April 1998, Orlando, Florida, pp. 358-364.