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

Authors

Ran Libeskind-Hadas, Harvey Mudd CollegeFollow
Dominic Mazzoni '99, Harvey Mudd College
Ranjith Rajagopalan '99, Harvey Mudd College

Student Co-author

HMC Undergraduate

Document Type

Conference Proceeding

Department

Computer Science (HMC), Mathematics (HMC)

Publication Date

1998

Abstract

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.

Comments

Published in the proceedings of WORLDCOMP ( http://www.world-academy-of-science.org/ ) World Academy of Sciences, Las Vegas, USA.

Rights Information

© 1998 World Academy of Science

Recommended Citation

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.