空间延迟/中断容忍网络路由算法性能评估

Performanceevaluation of routing algorithms on space delay/disruption tolerant networks

文章主要针对空间延迟/中断容忍网络(Delay/disruption Tolerant Networks,DTN)路由算法的性能进行分析评估,为未来空间DTN路由技术的设计提供参考和建议。首先,从利用网络知识多少的角度,对目前提出的适用于空间DTN的路由算法进行了分析和比较;然后,在一个典型空间DTN场景下,通过设定不同的接触计划,从微观和宏观两个方面,对最早投递(Earliest Delivery,ED)、基于本地队列的最早投递(Earliest Delivery with Local Queue,EDLQ)、接触图路由(Contact Graph Routing,CGR)和基于最早传输机会的接触图路由(Contact Graph Routing Earliest Transmission Opportunity,CGR-ETO)几种典型空间DTN路由算法的性能进行了仿真评估;最后,对仿真评估结果进行了分析和总结,并对未来空间DTN路由算法的研究提出了建议。仿真结果表明,对于端到端延时和束投递完成率两项性能指标,ED性能最差,CGR次之,EDLQ和CGR-ETO的性能相当。

Performance of routing algorithms on space delay/disruption tolerant networks （DTN） was evaluated to provide design reference and advices for future design of routing techniques on space DTN. Firstly, routing algorithms applicable to space DTN were analyzed and compared in aspect of utilization amount of network knowledege. Then, from microscopic and macroscopic aspects, four typical space DTN routing algorithms, which are earliest delivery （ED）, earliest delivery with local queue （EDLQ）, contact graph routing （CGR） and contact graph routing earliest transmission opportunity （CGR-ETO）, were evaluated by simulations in a typical space DTN scenario with different contact plan configurations. Finally, evaluation results were analyzed and summarized, and future research issues about routing algorithms on space DTN were also discussed. Simulation results indicate that from aspects of end-to-end delay and bundle delivery completion ratio, the performance of CGR is better than ED while the performance of EDLQ and CGR-ETO are the same best.