Analysis and Comparision on a Class of Crossbar-based Distributed Scheduling Algorithm
DU Xinhua · Jisuanji gongcheng · 2002
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.