1(School of Information Engineering and Science,Wuhan University of Science and Technology,Wuhan 430081,China)2(Electronic Information School,Wuhan University,Wuhan 430072,China)3(School of Electronic Information and Mechanical Engineering,Wuhan Qingchuan University,Wuhan 430204,China)
摘要 针对卫星延迟容忍网络(Delay Tolerant Network，DTN)中因卫星节点资源受限引起卫星节点拥塞问题，且由于DTN的保管传输特性不适用于传统拥塞控制机制，提出一种具有通用性的基于节点拥塞状态的队列优先级拥塞控制机制(Queue Priority Congestion Control mechanism based on Congestion State，QPCCCS).QPCCCS机制能适用于多种DTN路由策略，处理拥塞时将卫星节点按拥塞程度进行分类，并按照不同的拥塞状态对卫星节点消息转发进行优先级队列化，同时清除冗余消息副本，通过消息迁移与消息删除相结合的方式处理溢出的消息，管理卫星节点缓存来缓解卫星节点拥塞.经仿真相比原路由策略QPCCCS策略的加入能提高卫星数据投递率，降低了卫星网络传输开销，能给卫星DTN提供更好的性能需求.
Abstract：In order to solve the problem of Satellite node congestion caused by satellite node resource limitation in satellite Delay Tolerant Network(DTN),and the DTN′s custody transmission characteristics were not applicable to the traditional congestion control mechanism.This paper proposes a Queue Priority Congestion Control mechanism based on Congestion State(QPCCCS).QPCCCS mechanism could be applied to multiple DTN routing strategies.Classification of satellite nodes through congestion status when dealt with congestion.Priority queued of satellite node message forwarded according to different congestion states,cleaned redundant message copies at the same time.The new mechanism handled overflowed messages by combined message migration with message deletion,managed satellite node cache to mitigated satellite node congestion.After simulation,it can be concluded that compared with the original routing strategy,the satellite data delivery rate can be improved after adding the QPCCCS strategy.New mechanism reduces satellite network transmission overhead,and can provide better performance requirements for satellite DTN.
陈梦婷,田茂,陈小莉,程用志. 基于卫星延迟容忍网络的拥塞控制机制研究[J]. 小型微型计算机系统, 2020, 41(5): 1059-1064.
CHEN Mengting,TIAN Mao,CHEN Xiaoli,CHENG Yongzhi. Research on Congestion Control Mechanism Based on Satellite Delay Tolerant Network. Journal of Chinese Computer Systems, 2020, 41(5): 1059-1064.
2020, Vol. 41 
