A practical scheduling algorithm for input-buffered switch

被引：0

作者：

Zhang, LS ^{[1
]}

Han, CD ^{[1
]}

机构：

[1] Chinese Acad Sci, Inst Comp Technol, Ctr High Performance Comp, Beijing 100080, Peoples R China

来源：

2000 INTERNATIONAL CONFERENCE ON COMMUNICATION TECHNOLOGY PROCEEDINGS, VOLS. I & II | 2000年

关键词：

high-speed router; switch; input-buffering; scheduling algorithm;

D O I：

暂无

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

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.

引用

页码：1059 / 1064

页数：6