Motivated by the observation that switch throughput is mainly limited by th
e number of the maximum matching or pairing, instead of the head-of-line (H
OL) effect, a pairing algorithm trying to maximize the number of pairing, f
or switches with K buffers in each input port is proposed. As shown in the
related formula and simulation data, this algorithm performs well and can b
oost the switch throughput to 0.981 from traditional 0.632 when K = 4 even
as the switch size --> infinity.