High-speed switch scheduling for local-area networks
ACM Transactions on Computer Systems (TOCS)
The iSLIP scheduling algorithm for input-queued switches
IEEE/ACM Transactions on Networking (TON)
Multicast Scheduling for Switches with Multiple Input-Queues
HOTI '02 Proceedings of the 10th Symposium on High Performance Interconnects HOT Interconnects
Achieving 100% throughput in an input-queued switch
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
Performance of shared-memory switches under multicast bursty traffic
IEEE Journal on Selected Areas in Communications
Multicast scheduling for input-queued switches
IEEE Journal on Selected Areas in Communications
Scalable electronic packet switches
IEEE Journal on Selected Areas in Communications
A traffic manager for integrated queuing and scheduling of unicast and multicast IP traffic
ICT'09 Proceedings of the 16th international conference on Telecommunications
Multicast scheduling in feedback-based two stage switch
HPSR'09 Proceedings of the 15th international conference on High Performance Switching and Routing
Multicast scheduling with resource fairness constraints
Wireless Networks
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
| Hi-index | 0.00 |
Packet queuing and scheduling, two of the critical components in an input-queued packet switch, have been extensively studied in the context of either pure unicast traffic or pure multicast traffic. Unfortunately, the results from a study in one context are not applicable to the other context. The design of integrated scheduling for both types of traffic remains an open issue. This paper deals with the problem of integrating unicast and multicast scheduling in an NxN input-queued packet switch with first in first out buffers. Instead of using isolated switching fabrics for unicast and multicast traffic respectively, we efficiently utilize one switching fabric for both unicast and multicast traffic by a careful design. In our design, each input port maintains a set of unicast queues based on virtual output queuing technique and a set of multicast queues based on a load-balance policy. By employing the research advances that have already been gained for unicast and multicast scheduling, we propose two practical slot-coupled integration algorithms, lSCIA (a loosely slot-coupled integration algorithm) and fSCIA (a fully slot-coupled integration algorithm). In each time slot, unicast scheduling and multicast scheduling cooperate together and the scheduling priority is allocated to either unicast traffic or multicast traffic according to a certain service ratio. The working interval of service ratio is defined as a set such that the saturation throughput is not less than the output load if the service ratio falls into this set. The upper bound and lower bound for the working interval of service ratio are deduced. A 100% throughput can be achieved with strong theoretical guarantees as long as the service ratio lies in the upper bound of the working interval. Both theoretical analysis and simulation studies suggest that the proposed integrated scheduling algorithms exhibit a promising performance in terms of throughput, delay and packet loss ratio, at different traffic compositions under Bernoulli traffic and bursty traffic.