摘要
This paper describes the design and implementation of the urgency-based round robin scheduling algorithm based on network processors. The urgency-based round robin algorithm tries to select the most need packets to be served in the multimedia streams or queues. It implements the whole algorithm on Intel IXP2400 network processor and uses some special way such as hierarchical bit vector and urgency index table for performance and finally offers the future research on the algorithm.
| 源语言 | 英语 |
|---|---|
| 页（从-至） | 142-144 |
| 页数 | 3 |
| 期刊 | Jisuanji Gongcheng/Computer Engineering |
| 卷 | 32 |
| 期 | 4 |
| 出版状态 | 已出版 - 20 2月 2006 |