Optimal Contention-Free Unicast-Based Multicasting in Switch-Based Networks of Workstations

A unicast-based multicasting algorithm is presented for arbitrary interconnection networks arising in switchbased networks of workstations. The algorithm is optimal with respect to the number of startups incurred and is provably free from depth contention. Speci cally, 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.

• Type: Conference
• Year: 1998
• Where: IPPS
• Authors: Ran Libeskind-Hadas, Dominic Mazzoni, Ranjith Rajagopalan
• Keywords: Algorithm, Distributed And Parallel Computing, IPPS 1998, Unicast Routing Algorithm, Unicast-based Multicasting Algorithm