We present a simple iterative matching for an input and output buffered switch with multiple switching planes. The suggested algorithm is based on iSLIP and consists of request, grant and accept steps. The pointer update scheme of iSLIP is simplified in the suggested algorithm to enhance a match efficiency and a service fairness. In addition, we show a switch performance is improved when the suggested algorithm is used with an occupancy level of a queue. Using computer simulation under Bernoulli traffic, we show the suggested algorithm is better than iSLIP for cell scheduling of input and output buffered switches.
展开▼
