摘要： 调度算法对于路由器的性能至关重要。一个好的调度算法不仅要达到较高的系统吞吐量、较小的时延、良好的公平性，而且还要在硬件上易于实现。目前调度领域最典型的算法是基于端口仲裁器的分布式调度算法，如PIM、iSLIP、FIRM等。该文对这些算法的基本原理进行了介绍和分析，并对它们的平均分组时延特性进行了比较。

关键词: 调度算法, 交叉结构, 并行迭代匹配, 迭代的循环滑动匹配, 先来先服务的循环匹配

Abstract: A scheduling algorithm is very important for router performances. A good algorithm should not only achieve high throughput，low average delay，good fairness，but also be implemented in hardware easily. Most scheduling algorithms used in current products are based on arbiters distributed on the input and output ports. In this article, three typical algorithms, PIM, iSLIP, and FIRM are introduced respectively, and their performance in terms of average packet latency is compared as well.

中图分类号: 

• TN915.05