摘要
A novel AOS virtual channels scheduling algorithm based on separate evaluation of Virtual Channels and Frames was proposed. The proposed algorithm divided transmission time slots into synchronous ones and asynchronous ones. In synchronous time slots, the virtual channels were scheduled in a polling manner. While in asynchronous time slots, virtual channels urgent degree and frame urgent degree were first considered separately, and then they were joined together to form a new urgent degree function, which could satisfy the transmission demand of various data sources. Compared to the traditional dynamic priority scheduling algorithm, the proposed algorithm could provide much lower average scheduling delay and maximal scheduling delay of the important virtual channels, without deteriorating frame loss rates and channel utilization rate. Experiments show that the proposed algorithm outperforms the traditional algorithm greatly, and it fits for diverse data transmission over space links much better.
| 源语言 | 英语 |
|---|---|
| 页(从-至) | 87-93 |
| 页数 | 7 |
| 期刊 | Xitong Fangzhen Xuebao / Journal of System Simulation |
| 卷 | 25 |
| 期 | 1 |
| 出版状态 | 已出版 - 1月 2013 |
| 已对外发布 | 是 |
学术指纹
探究 'AOS virtual channels scheduling algorithm based on separate evaluation of virtual channels and frames' 的科研主题。它们共同构成独一无二的学术指纹。引用此
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver