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

Previous Articles     Next Articles

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.