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)
Cell switching versus packet switching in input-queued switches
IEEE/ACM Transactions on Networking (TON)
Distributed random access algorithm: scheduling and congestion control
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
The performance of input-queued packet switches critically depends on the scheduling scheme that connects the input ports to the output ports. We show that, when packets are switched asynchronously, simple scheduling schemes where contention is solved locally at each input or output can achieve rate optimality, without any speed-up of the internal transmission rate.