High-speed switch scheduling for local-area networks
ACM Transactions on Computer Systems (TOCS)
Scheduling algorithms for input-queued cell switches
Scheduling algorithms for input-queued cell switches
The iSLIP scheduling algorithm for input-queued switches
IEEE/ACM Transactions on Networking (TON)
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
On the stability of input-queued switches with speed-up
IEEE/ACM Transactions on Networking (TON)
Switching using parallel input-output queued switches with no speedup
IEEE/ACM Transactions on Networking (TON)
Symmetric Crossbar Arbiters for VLSI Communication Switches
IEEE Transactions on Parallel and Distributed Systems
On achieving throughput in an input-queued switch
IEEE/ACM Transactions on Networking (TON)
Saturn: a terabit packet switch using dual round robin
IEEE Communications Magazine
PI-OBS: a parallel iterative optical burst scheduler for OBS networks
HPSR'09 Proceedings of the 15th international conference on High Performance Switching and Routing
An efficient single-iteration single-bit request scheduling algorithm for input-queued switches
Journal of Network and Computer Applications
| Hi-index | 0.00 |
An iterative switching algorithm for an input queued switch consists of a number of iterations in every time step, where each iteration computes a disjoint matching. If input i is matched to output j in a given iteration, a packet (if any) is forwarded from i to j in the corresponding time step. Most of the iterative switching algorithms use a Request Grant Accept (RGA) arbitration type (e.g. iSLIP). Unfortunately, due to this particular type of arbitration, the matching computed in one iteration is not necessarily maximal (more input and output ports can still be matched). This is exactly why multiple iterations are needed. However, multiple iterations make the time step larger and reduce the speed of the switch. We present a new iterative switching algorithm (based on the RGA arbitration) called π-RGA with the underlying assumption that the number of iterations is possibly limited to one, hence reducing the time step and allowing the switch to run at a higher speed. We prove that π-RGA achieves throughput and delay guarantees with a speedup of 2 and one iteration under a constant burst traffic model, which makes π-RGA as good as any maximal matching algorithm in the theoretical sense. We also show by simulation that π-RGA achieves relatively high throughput in practice under uniform and non-uniform traffic patterns with one iteration and no speedup.