Fair Scheduling for Input-Queued Switches

Input-queued switch architecture has become attractive for implementing high performance routers because the switching fabric and the buffer need not run at a multiple of input link´s rate. It is challenging to provide a scheduling technique that is both highly efficient and fair in resource allocation. We propose an iterative cell-based fair scheduling (iCFS) scheme, based on SLIP that support fair bandwidth distribution among flows and achieves asymptotically 100 percent throughput