The optimized prioritized iSLIP scheduling algorithm for input-queued switches with ability to support multiple priority levels

• Published in: 10th International Conference on Telecommunications, 2003. ICT 2003 Vol. 2; pp. 1680 - 1685 vol.2
• Main Authors: Minagar, A.R., Safavi, S.M.
• Format: Conference Proceeding
• Language: English
• Published: IEEE 2003
• Subjects: Fabrics; Hardware; Internet; Packet switching; Round robin; Scheduling algorithm; Switches; Telecommunication switching; Throughput; Traffic control
• ISBN: 0780376617; 9780780376618
• DOI: 10.1109/ICTEL.2003.1191686

An increasing number of Internet routers use a crossbar switch to interconnect line cards. These systems usually use input queuing combined with virtual output queuing, so that with a suitable scheduling algorithm like iSLIP they can achieve nearly 100% throughput. But many applications use multiple classes of traffic with different priority levels. So there is an increasing demand for switch fabrics that can support prioritized traffic. Despite its good performance under traffic with one class of service, modified versions of iSLIP like prioritized iSLIP face a noticeable decrease in performance under prioritized traffic and other algorithms like weighted iSLIP that have high performance are hard to implement. A starvation free scheduling algorithm, optimized prioritized iSLIP, which has a dramatically improved performance in comparison with prioritized iSLIP is introduced. Because its implementation is similar to iSLIP, it is fast and easy to implement in hardware.