Cell selection algorithm for the multiple input-queued ATM switch: chessboard and random cell selections

A simple and efficient cell selection algorithm for the multiple input-queued ATM switch, named the chessboard cell selection algorithm, is proposed in this paper. The proposed algorithm selects one of the transmission requests for the output port with the lowest value of transmission request sum. By doing so, we can reduce a newly introduced front-of-line (FOL) blocking so as to achieve an enhancement in the throughput for uniform arrival traffic. Besides the enhanced throughput, the proposed algorithm can reduce mean cell delay by 50% or more and cell loss probability by 90% or more than the random selection scheme. Time complexity is O(N²) in the worst case, where N is the switch size