Skip to Main Content
Input-queued switch with service class priority is becoming attractive solution for a high-bandwidth ATM switches. In previous related works, it has been proved that throughput achieve almost 100% for up to 92% of the offered load when a random access buffers and round robin scheduling algorithm are used. In this paper we introduce a modification through a scheduling algorithm called iterative longest port first proposed to overcome the complexity of the previous solutions 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.
Date of Conference: 1-3 Oct. 2003