By Topic

An effective cell scheduler guaranteeing fairness for input-queued ATM switch

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

6 Author(s)
Mihye Lee ; Inst. for Electron. & Telecommun. Res., Chungnam Nat. Univ., Taejon, South Korea ; Sungjin Moon ; Heasook Park ; KwangSuk Song
more authors

High-speed input queued switches are known to be more economical and simpler than output queued switches. However, they suffer from HOL blocking which degrades throughput significantly. Input queued switches can achieve higher throughput if they use random access input queues and cell scheduling algorithms. Especially, input queued ATM switches employing the cell-scheduling algorithm can increase the throughput by preventing output conflict. A self-firing cell scheduling algorithm in input queued ATM switches has been proposed but it is unfair in the sense that the throughputs from various input ports differ by significant amounts. In this paper, we propose a cell scheduler that has inherent fairness properties under any traffic pattern and prove that the proposed cell scheduler guarantees fairness even if traffic is not uniform pattern by computer simulation

Published in:

Communication Technology Proceedings, 1998. ICCT '98. 1998 International Conference on

Date of Conference:

22-24 Oct 1998