Title :
Credit-based fair scheduling for input-queued switches
Author :
Gourgy, Amir ; Wu, Honglin ; Szymanski, Ted H.
Author_Institution :
Dept. of Electr. & Comput. Eng., McMaster Univ., Hamilton, Ont., Canada
Abstract :
We present a novel scheduling algorithm for Internet routers with input-queued switches based on credit-based fair queueing. We present a flow-based iterative credit-based fair scheduler (iCBFS) for crossbar switches, that provides fair bandwidth distribution among flows at a fine granularity and achieves asymptotically 100% throughput, under uniform traffic. To reduce the implementation complexity of iCBFS, we present a port-based version of iCBFS that is tailored towards high-speed hardware implementation.
Keywords :
Internet; bandwidth allocation; computational complexity; iterative methods; quality of service; queueing theory; scheduling; telecommunication network routing; telecommunication switching; telecommunication traffic; Internet routers; QoS; bandwidth allocation; bandwidth distribution; crossbar switches; hardware complexity; input-queued switches; iterative credit-based fair scheduler; network traffic; quality of service; Bandwidth; Fabrics; Hardware; Internet telephony; Optical switches; Packet switching; Processor scheduling; Scheduling algorithm; Throughput; Traffic control;
Conference_Titel :
Communications, 2004 IEEE International Conference on
Print_ISBN :
0-7803-8533-0
DOI :
10.1109/ICC.2004.1312866
