›› 2011, Vol. 31 ›› Issue (6): 50-57.doi: 10.3780/j.issn.1000-758X.2011.06.008

• 技术交流 • 上一篇    下一篇

具有广泛适用性的AOS虚拟信道调度算法

 田野1, 那鑫2, 高晓玲,1 刘庆利1   

  1. (1 沈阳理工大学信息学院,沈阳 110159)(2 中国空间技术研究院,北京100094)
  • 收稿日期:2011-07-04 修回日期:2011-12-25 出版日期:2011-12-25 发布日期:2011-12-25
  • 作者简介:田野 1977年生,2007年获北京交通大学通信与信息系统专业博士学位,现为沈阳理工大学副教授,研究方向为卫星通信,移动通信。
  • 基金资助:

    国家自然科学基金(61101116);轨道交通控制与安全国家重点实验室(北京交通大学)开放课题基金(RCS2009K008);辽宁省博士启动基金资助项目

A Novel AOS Virtual Channels Scheduling Algorithm with Broad Applicability

 TIAN  Ye1, NA  Xin2, GAO  Xiao-Ling1, LIU  Qing-Li1   

  1. (1 School of Information Science and Engineering,Shenyang Ligong University,Shenyang 110159)
    (2 China Academy of Space Technology,Beijing 100094)
  • Received:2011-07-04 Revised:2011-12-25 Published:2011-12-25 Online:2011-12-25

摘要: 针对现有的基于虚拟信道紧迫度的动态调度算法的不足,提出了一种新的高级在轨系统虚拟信道动态调度算法。该算法首先估算虚拟信道的紧迫度和数据帧的紧迫度,然后用加权系数将二者结合起来构造成一个全新的虚拟信道传送紧迫度函数,再根据该函数的值进行判决调度。对于高级在轨系统中不同速率、不同性质、不同类型的星上数据源,该算法均可通过选择合适的加权系数灵活地分配传输时隙,保证各用户合理、动态地占用物理信道,满足对数据的传输时延要求,因此具有广泛的适用性。理论分析和仿真结果表明,本文提出的算法比基于虚拟信道紧迫度的动态调度算法具有更好的性能

关键词:  , 高级在轨系统, 虚拟信道, 调度算法, 加权系数

Abstract: A novel virtual channel dynamic scheduling algorithm with broad applicability in advanced orbiting systems is proposed, which can overcome the shortcoming of the dynamic priority scheduling algorithm based on VC urgency. First, the virtual channel urgency and the frame urgency are estimated separately, and then a weighted coefficient is used to combine them into a new transmission urgency function of virtual channel, which is used to make scheduling decisions. By choosing different weighted coefficients, the proposed algorithm can meet the data transmission requirements of various source models of AOS. Theoretical analysis and simulation experiments show that the proposed algorithm can achieve better performance than the dynamic priority scheduling algorithm based on VC urgency.