By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Reza Minagar, A. ; Iran Telecommun. Res. Center, Tehran, Iran ; Safavi, S.M.

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.

Published in:

Telecommunications, 2003. ICT 2003. 10th International Conference on  (Volume:2 )

Date of Conference:

23 Feb.-1 March 2003