Multicast Scheduling for Switches with Multiple Input-Queues
HOTI '02 Proceedings of the 10th Symposium on High Performance Interconnects HOT Interconnects
Multicast traffic in input-queued switches: optimal scheduling and maximum throughput
IEEE/ACM Transactions on Networking (TON)
Multicast scheduling for input-queued switches
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
It is known that single-stage IQ based switch can provide 100% throughput guarantee for any admissible unicast traffic pattern. However, due to particular characteristics of multicast traffic, the performance of IQ switches in the case of general mutlicast traffic partterns is inferior to its performance in the case of unicast traffic, which motives us to find new architectures to provide better performance guarantee for multicast traffic. In this paper, we propose a Two-Stage Multicast Switch (TSMS) which is a serial combination of a Multicast To Unicast (MTU) switch to copy input cells from various sources simultaneously and a Combined Input and Output Queueing (CIOQ) switch to deliver copies of multicast cells to their final destinations. Based on MTU switch, we design a novel LFCNF-UMBA scheduling algorithm to determine how to copy multicast cells into unicast cells. By coordinately using Maximal Matching scheduling algorithm in CIOQ switch, we prove that speedup of 2-2/ (N + 1) is necessary and 2 is sufficient for a M × N TSMS to achieve 100% throughput under any admissible multicast traffic pattern, which is also verified by our simulation results.