iLPFwTM cell scheduling algorithm for ATM input-queued switch with service class priority
Igor Radusinović, Milica Pejanović-Djurišić, Zoran Petrović · 2003
The input-queued switch with service class priority is becoming an attractive solution for high-bandwidth ATM switches. In previous related work (see Motoyama, S. et al., IEEE Comm. Letters, vol.3, no.12, p.323-5, 1999), it has been proved that throughput achieves almost 100% for up to 92% of the offered load when random access buffers and a round robin scheduling algorithm are used. However, this is only a theoretical result: the round robin scheduling algorithm is too complex to implement in hardware. We introduce a modification through a scheduling algorithm called iterative longest port first with throughput maximization (iLPFwTM) which is proposed to overcome the complexity of the previous solution regarding its hardware implementation at high speed. A performance analysis is carried out by simulation and the results show a better performance in comparison with the recent ATM input-queued switch with round robin schedulers and service class priority. It means that the ATM input-queued switch with iLPFwTM scheduler and service class priority is proved to be more attractive for high-bandwidth ATM switch implementation than the solution based on a round robin scheduling algorithm.