Multicast ATM switches: survey and performance evaluation
ACM SIGCOMM Computer Communication Review
IEEE/ACM Transactions on Networking (TON)
Analysis of nonblocking ATM switches with multiple input queues
IEEE/ACM Transactions on Networking (TON)
Queueing analysis of scheduling policies in copy networks of space-based multicast packet switches
IEEE/ACM Transactions on Networking (TON)
An efficient cell-scheduling algorithm for multicast ATM switching systems
IEEE/ACM Transactions on Networking (TON)
Tiny Tera: A Packet Switch Core
IEEE Micro
The Least Choice First Scheduling Method for High-Speed Network Switche
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Fair Scheduling for Input Buffered Switches
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Integrated Provision of QoS Guarantees to Unicast and Multicast Traffic in Packet Switches
IWDC '01 Proceedings of the Thyrrhenian International Workshop on Digital Communications: Evolutionary Trends of the Internet
FIFO-Based Multicast Scheduling Algorithm for Virtual Output Queued Packet Switches
IEEE Transactions on Computers
Switch fabric design for high performance IP routers: a survey
Journal of Systems Architecture: the EUROMICRO Journal
Integration of unicast and multicast scheduling in input-queued packet switches
Computer Networks: The International Journal of Computer and Telecommunications Networking
Scheduling and performance analysis of multicast interconnects
The Journal of Supercomputing
Multicast support in multi-chip centralized schedulers in Input Queued switches
Computer Networks: The International Journal of Computer and Telecommunications Networking
Bandwidth guaranteed multicast scheduling for virtual output queued packet switches
Journal of Parallel and Distributed Computing
Performance analysis of large multicast switches with multicast virtual output queues
Computer Communications
Integration of unicast and multicast scheduling in input-queued packet switches
Computer Networks: The International Journal of Computer and Telecommunications Networking
Achieving 100% throughput in a two-stage multicast switch
ICOIN'09 Proceedings of the 23rd international conference on Information Networking
A traffic manager for integrated queuing and scheduling of unicast and multicast IP traffic
ICT'09 Proceedings of the 16th international conference on Telecommunications
Integrated scheduling algorithm of unicast and multicast for pakect switches implemented with QoS
ASID'09 Proceedings of the 3rd international conference on Anti-Counterfeiting, security, and identification in communication
Practical network coding approach for multicast packet switching
GIIS'09 Proceedings of the Second international conference on Global Information Infrastructure Symposium
Look-ahead adaptive routing on k-ary n-trees
APPT'07 Proceedings of the 7th international conference on Advanced parallel processing technologies
Efficient multicast support in buffered crossbars using networks on chip
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
A new integrated unicast/multicast scheduler for input-queued switches
AusPDC '10 Proceedings of the Eighth Australasian Symposium on Parallel and Distributed Computing - Volume 107
HiPC'05 Proceedings of the 12th international conference on High Performance Computing
Scheduling multicast traffic in a combined input separate output queued switch
NPC'05 Proceedings of the 2005 IFIP international conference on Network and Parallel Computing
Scheduling multicast traffic in input-buffered ATM switch
Computer Communications
Hi-index | 0.08 |
We design a scheduler for an M×N input-queued multicast switch. It is assumed that: 1) each input maintains a single queue for arriving multicast cells and 2) only the cell at the head of line (HOL) can be observed and scheduled at one time. The scheduler needs to be: 1) work-conserving (no output port may be idle as long as there is an input cell destined to it) and 2) fair (which means that no input cell may be held at HOL for more than a fixed number of cell times). The aim is to find a work-conserving, fair policy that delivers maximum throughput and minimizes input queue latency, and yet is simple to implement. 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. Subject to a fairness constraint, we argue that a policy which always concentrates the residue on as few inputs as possible generally outperforms all other policies. We find that there is a tradeoff among concentration of residue (for high throughput), strictness of fairness (to prevent starvation), and implementational simplicity (for the design of high-speed switches). By mapping the general multicast switching problem onto a variation of the popular block-packing game Tetris, we are able to analyze various scheduling policies which possess these attributes in different proportions. We present a novel scheduling policy, called TATRA, which performs extremely well and is strict in fairness. We also present a simple weight-based algorithm, called WBA