Multicast routing in datagram internetworks and extended LANs
ACM Transactions on Computer Systems (TOCS)
Improving the performance of input-queued ATM packet switches
IEEE INFOCOM '92 Proceedings of the eleventh annual joint conference of the IEEE computer and communications societies on One world through communications (Vol. 1)
High speed switch scheduling for local area networks
ASPLOS V Proceedings of the fifth international conference on Architectural support for programming languages and operating systems
Communications of the ACM
Tiny Tera: A Packet Switch Core
IEEE Micro
Design and Performance Analysis of a Growable Multicast ATM Switch
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Multicast traffic in input-queued switches: optimal scheduling and maximum throughput
IEEE/ACM Transactions on Networking (TON)
FIFO-Based Multicast Scheduling Algorithm for Virtual Output Queued Packet Switches
IEEE Transactions on Computers
Multicast support in multi-chip centralized schedulers in Input Queued switches
Computer Networks: The International Journal of Computer and Telecommunications Networking
Scheduling multicast traffic in input-buffered ATM switch
Computer Communications
A high speed scheduler/controller for unbuffered banyan networks
Computer Communications
| Hi-index | 0.00 |
In this paper we consider policies for scheduling cells in an input-queued multicast switch. It is assumed that each input maintains a single queue for arriving multicast cells and that only the cell at the head of line (HOL) can be observed and scheduled at one time. The policies are assumed to be work-conserving, which means that cells may be copied to the outputs that they request over several cell times. When a scheduling policy decides which cells to schedule, contention may require that it leave a residue of cells to be scheduled in the next cell time. The selection of where to place the residue uniquely defines the scheduling policy. We prove that for a 2 × N switch, a policy that always concentrates the residue, subject to a natural fairness constraint, always outpegorms all other policies. Simulation results indicate that this policy also performs well for more general M×N switches. We present a heuristic round-robin policy called mRRM that is simple to implement in hardware, fair, and performs almost as well as the concentrating policy.