摘要
虚拟信道调度算法完成虚拟信道在物理信道中的排序,其性能决定了高级在轨系统多路复用的时延性能和物理信道传输效率。传统的动态调度算法未区分虚拟信道紧迫度与帧紧迫度的不同,并且未讨论在同步时隙中没有同步数据时如何有效利用该同步时隙,因此性能有限。针对这一问题,提出了一种基于帧紧迫度的边界可移动虚拟信道调度算法。该算法根据信源的数据类型将虚拟信道划分为同步虚拟信道和异步虚拟信道,对同步虚拟信道采用轮询算法进行调度,对异步虚拟信道则采用基于帧紧迫度的虚拟信道调度算法进行调度,并且二者之间的边界是可移动的。实验结果表明,提出的算法与传统动态调度算法及边界不可移动的调度算法相比,大大降低了各虚拟信道的平均调度时延、最大调度时延,并明显提高了信道利用率,更适于在空间链路中传输多种不同类型的数据。
The virtual channel scheduling algorithm is used to complete the virtual channel ordering in the phys- ical channel, whose performance determines the delay performance and the physical channel transmission efficiency in advanced orbiting system multiplexing. Traditional dynamic scheduling algorithm does not make a distinction be- tween virtual channels urgency and frame urgency and dose not discuss how to effectively use the synchronous time slot when there is no synchronize data, so its performance is limited. Aiming at this problem, a virtual channels scheduling algorithm of moving boundary based on frame urgency is proposed. In the proposed algorithm, according to types of data sources, virtual channel is divided into synchronous and asynchronous virtual channel. The syn- chronous virtual channels are scheduled in a polling algorithm, and the asynchronous virtual channels are scheduled in virtual channels algorithm based on frame urgency, and it＇ s changeable for the boundary between them. Simula- tion results show that compared to the traditional dynamic scheduling algorithm and the scheduling algorithm whose boundary isn＇t changeable, the proposed algorithm can significantly increase the channel utilization efficiency and provides much lower average scheduling delay and maximal scheduling delay of virtual channels, so it is much suit-able for diverse data transmission over space links.
出处
《科学技术与工程》
北大核心
2014年第17期97-103,共7页
Science Technology and Engineering
基金
国家自然科学基金项目(61101116)
辽宁省高等学校杰出青年学者成长计划(LJQ2012018)
辽宁省高等学校创新团队资助项目(LT2011T005)资助
