High-speed switch scheduling for local-area networks
ACM Transactions on Computer Systems (TOCS)
Efficient fair queueing using deficit round-robin
IEEE/ACM Transactions on Networking (TON)
A quantitive comparision of iterative scheduling algoithm for input-queued switches
Computer Networks and ISDN Systems
The iSLIP scheduling algorithm for input-queued switches
IEEE/ACM Transactions on Networking (TON)
Switching and Traffic Theory for Integrated Broadband Networks
Switching and Traffic Theory for Integrated Broadband Networks
IEEE Micro
ATM Input-Buffered Switches with the Guaranteed-Rate Property
ISCC '98 Proceedings of the Third IEEE Symposium on Computers & Communications
Providing bandwidth guarantees in an input-buffered crossbar switch
INFOCOM '95 Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 3)-Volume - Volume 3
Performance analysis of the multiple input-queued packet switch with the restricted rule
IEEE/ACM Transactions on Networking (TON)
A Fast Noniterative Scheduler for Input-Queued Switches with Unbuffered Crossbars
ISPAN '05 Proceedings of the 8th International Symposium on Parallel Architectures,Algorithms and Networks
Fast and noniterative scheduling in input-queued switches: Supporting QoS
Computer Communications
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
Matching output queueing with a combined input/output-queued switch
IEEE Journal on Selected Areas in Communications
Linear-complexity algorithms for QoS support in input-queued switches with no speedup
IEEE Journal on Selected Areas in Communications
The Knockout Switch: A Simple, Modular Architecture for High-Performance Packet Switching
IEEE Journal on Selected Areas in Communications
Fast and noniterative scheduling in input-queued switches: Supporting QoS
Computer Communications
An efficient single-iteration single-bit request scheduling algorithm for input-queued switches
Journal of Network and Computer Applications
| Hi-index | 0.25 |
We report three fast and scalable scheduling algorithms that provide exact bandwidth guarantee, low delay bound, and reasonable jitter in input-queued switches. The three schedulers find a maximum input/output matching in a single iteration. They sustain 100% throughput under both uniform and bursty traffic. They work many times faster than existing scheduling schemes and their speed does not degrade with increased switch size. SRA and SRA+ algorithms are of O(1) time complexity and can be implemented in simple hardware. SRA tends to incur different delays to flows of different classes of service due to their different subscribed portions of the total bandwidth. SRA+, a weighted version of SRA, operates on cells that arrive uniformly and on cells of packets such that the cells of whole packets are switched contiguously. SRA+ improves over SRA in that all flows undergo the same delays regardless of their bandwidth shares. The schedulers operate on queue groups at the crossbar arbiters in a distributed manner.