Title :
A practical scheduling algorithm for input-buffered switch
Author :
Lisheng, Zhang ; Han Chengdu
Author_Institution :
Inst. of Comput. Technol., Acad. Sinica, Beijing, China
Abstract :
Input-buffering is preferentially used in high-speed commercial and experimental routers and switches. The cell scheduling algorithms are critical components in input-buffered switches. They have a significant impact on the throughput, stability and guaranteed quality of service (QoS) of input-buffered switches. The longest queue first (LQF) algorithm can achieve 100% throughput for input-buffered switches, but is not starvation-free. That is, there are some queues will never be serviced. This paper proposes a modified LQF algorithm called mLQF. It can achieve 100% throughput and is starvation-free
Keywords :
buffer storage; multistage interconnection networks; quality of service; queueing theory; scheduling; telecommunication network routing; telecommunication traffic; cell scheduling; guaranteed QoS; high-speed routers; input-buffered switch; longest queue first algorithm; mLQF; modified LQF algorithm; quality of service; scheduling algorithm; stability; starvation-free algorithm; throughput; Aggregates; Bandwidth; Computers; Fabrics; Packet switching; Read-write memory; Scheduling algorithm; Stability; Switches; Throughput;
Conference_Titel :
Communication Technology Proceedings, 2000. WCC - ICCT 2000. International Conference on
Conference_Location :
Beijing
Print_ISBN :
0-7803-6394-9
DOI :
10.1109/ICCT.2000.890858
