Scheduled System Maintenance:
On May 6th, system maintenance will take place from 8:00 AM - 12:00 PM ET (12:00 - 16:00 UTC). During this time, there may be intermittent impact on performance. We apologize for the inconvenience.
By Topic

Fair Scheduling for Input-Queued Switches

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

The purchase and pricing options are temporarily unavailable. Please try again later.
3 Author(s)

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

Published in:

Information and Communication Technologies, 2006. ICTTA '06. 2nd  (Volume:2 )

Date of Conference:

0-0 0