一种基于QoS的空间延迟/中断容忍网络拥塞控制方法

时文丰; 高德云; 周华春

doi:10.11999/JEIT160140

一种基于QoS的空间延迟/中断容忍网络拥塞控制方法

doi: 10.11999/JEIT160140

基金项目:

国家863计划(2015AA015702)，国家自然科学基金 (61271202)，国家973计划(2013CB329101)

计量
- 文章访问数: 1253
- HTML全文浏览量: 141
- PDF下载量: 469
- 被引次数: 0
出版历程
- 收稿日期: 2016-01-29
- 修回日期: 2016-07-04
- 刊出日期: 2016-11-19

QoS Based Congestion Control for Space Delay/Disruption Tolerant Networks

Funds:

The National 863 Program of China (2015AA015702), The National Natural Science Foundation of China (61271202), The National 973 Program of China (2013CB329101)

摘要

摘要: 为缓解网络拥塞对空间延迟/中断容忍网络产生的影响，该文提出一种基于QoS的网络拥塞控制算法。该算法包括接触拥塞判断和基于QoS的数据转发两种机制，分别从接触剩余可用容量和节点剩余存储空间两方面对每一段接触的拥塞程度进行预测，将接触划分为不同的拥塞等级。在计算路由时，以整段路径中所包含接触的最高拥塞等级为该路径的拥塞等级，并根据该拥塞等级发送不同优先级的数据。实验表明，基于QoS的拥塞控制算法可以提高低优先级数据的传递率并在节点存储空间不足时降低最高优先级数据的传递时延。
- 空间延迟容忍网络 /
- 拥塞控制 /
- 路径拥塞等级 /
- 基于QoS的转发
Abstract: In order to alleviate the influence of network congestion in space delay/disruption tolerant networks, a QoS based congestion control algorithm is proposed in this paper. The algorithm consists of contact congestion forecasting scheme and QoS based data forwarding scheme. The contacts are divided into different congestion levels according to their residual available capacity and nodes storage resource. The congestion level of forwarding path calculated by routing is decided by the highest congestion level of contacts consisted in the path and different priority data will be forwarded according to the path congestion level. Experiment shows that QoS based algorithm could improve the transmission rate of data with lower priority and reduce the delivery delay of highest priority data when the node storage space is insufficient.
- Space delay tolerant network /
- Congestion control /
- Path congestion level /
- QoS based forwarding

HTML全文

参考文献(12)

CERF V, BURLEIGH S, HOOKE A, et al. Delay-tolerant networking architecture[S]. IETF RFC 4838, 2007.

SCOTT K L and BURLEIGH S. Bundle protocol specification[S]. IETF RFC 5050, 2007.

ARANITI G, BEZIRGIANNIDIS N, BIRRANE E, et al. Contact graph routing in DTN space networks: overview, enhancements and performance[J]. IEEE Communications Magazine, 2015, 53(3): 38-46.

BURLEIGH S. Contact graph routing[S]. IETF Internet, draft-burleigh-dtnrg-cgr-00, 2010.

BEZIRGIANNIDIS N, TSAPELI F, DIAMANTOPOULOS S, et al. Towards flexibility and accuracy in space DTN Communications[C]. Proceedings of the 8th ACM MobiCom Workshop on Challenged Networks, Miami, Florida, USA, 2013: 43-48.

FRAIRE J and FINOCHIETTO J M. Routing-aware fair contact plan design for predictable delay tolerant networks[J]. Ad Hoc Networks, 2015, 25(Part B): 303-313.

FRAIRE J and FINOCHIETTO J M. Design challenges in contact plans for disruption-tolerant satellite networks[J]. IEEE Communications Magazine, 2015, 53(5): 163-169.

SILVA A P, BURLEIGH S, HIRATA C M, et al. A survey on congestion control for delay and disruption tolerant networks[J]. Ad Hoc Networks, 2015, 25(Part B): 480-494.

RASHID S, AYUB Q, and ABDULLAH A H. Reactive weight based buffer management policy for DTN routing protocols[J]. Wireless Personal Communications, 2015, 80(3): 993-1010.

BEZIRGIANNIDIS N, CAINI C, and PADALINO M D D, et al. Contact graph routing enhancements for delay tolerant space communications[C]. Proceedings of IEEE 2014 7th Advanced Satellite Multimedia Systems Conference and the 13th Signal Processing for Space Communications Workshop (ASMS/SPSC), New York, USA, 2014: 17-23.

IVANCIC W D and SULLIVAN D V. Delivery of Unmanned Aerial Vehicle DATA[M]. USA, National Aeronautics and Space Administration, Glenn Research Center, 2011: 1-6.

Interplanetary Overlay Network (ION) [OL]. https:// sourceforge.net/projects/ion-dtn/, 2015.

施引文献

资源附件(0)

访问统计