Multicast routing algorithms for the WDM Shufflenet local optical network

We propose an efficient algorithm for constructing multicast trees in the Shufflenet. Although the Shufflenet has been shown to be an important network topology for wavelength division multiplexed (WDM) local optical networks, no algorithm has previously been proposed for multicasting in this network. We present a single-pass algorithm that constructs minimum-delay multicast trees, and show how a second pass can be added to reduce tree cost while maintaining very low delay