High-performance variable-length packet scheduling algorithm for IP traffic

A high-performance variable-length packet scheduling algorithm is proposed for efficiently accommodating IP traffic in input. queued crossbar switches. It uses a rotating priority(round-robin) arbitration and a masking operation for variable-length packets. This algorithm achieves 100% throughput with a single iteration for uniform IP traffic and performs better in terms of packet latency and similar cell latency, compared with the well-known iSLIP cell-level scheduling algorithm.