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 switch-based networks of workstations. The algorithm is optimal with respect to the number of startups incurred and is provably free from depth contention. Specifically, no two constituent unicasts...

Full description

Saved in:
Bibliographic Details
Main Authors: Libeskind-Hadas, R., Mazzoni, D., Rajagopalan, R.
Format: Conference Proceeding
Language:English
Subjects:
Communication switching
Delay
Hardware
Intelligent networks
Multicast algorithms
Routing
Switches
System recovery
Unicast
Workstations
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:A unicast-based multicasting algorithm is presented for arbitrary interconnection networks arising in switch-based networks of workstations. The algorithm is optimal with respect to the 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.
ISSN:1063-7133
DOI:10.1109/IPPS.1998.669940