战术数据链动态轮询调度算法  

Dynamic Polling Scheduling Algorithm for Tactical Data Link

作　　者：王文政[1] 杨光[1] 周经伦[1] 罗鹏程[1] 

机构地区：[1]国防科学技术大学信息系统与管理学院,湖南长沙410073

出　　处：《小型微型计算机系统》2009年第12期2481-2484,共4页Journal of Chinese Computer Systems

基　　金：国家"十一五"装备预研项目(513040305)资助

摘　　要：战术数据链在现代战争中发挥着极其重要的作用.针对战术数据链系统报文传输的实时性,提出一种综合考虑队长和时延的动态轮询调度算法.该类算法的主要难点在于如何准确预测队列长度,为此,提出基于贝叶斯的预测模型.基于OPNET的仿真表明,相比于传统轮询调度算法,该算法能够更好的保证时延性能,同时对信道利用率也进行了一定的优化.Tactical data link is playing a very important role in modem war. A polling scheduling algorithm which considered both the delay and the queue length is proposed for solving the problem of real time message transmission in tactical data link system. The main difficulty of the algorithm lies in how to forecast the number of the messages of the stations dynamically, to slove the problem, the Bayes-based forecasting model is proposed. The OPNET based simulations show that comparing with the traditional scheduling algorithm, proposed has better delay performance, and the channel utilization is higher, too.

关 键 词：战术数据链 轮询调度 贝叶斯预测 OPNET 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]