We present iterative round-robin 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 altered in the suggested algorithm to enhance the switch performance. Simulation results under Bernoulli traffic show the suggested algorithm is more appropriate than iSLIP for cell scheduling of input and output buffered switches.