一種基于QoS的空間延遲/中斷容忍網(wǎng)絡(luò)擁塞控制方法
doi: 10.11999/JEIT160140
基金項(xiàng)目:
國家863計(jì)劃(2015AA015702)，國家自然科學(xué)基金 (61271202)，國家973計(jì)劃(2013CB329101)
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)
-
摘要: 為緩解網(wǎng)絡(luò)擁塞對空間延遲/中斷容忍網(wǎng)絡(luò)產(chǎn)生的影響，該文提出一種基于QoS的網(wǎng)絡(luò)擁塞控制算法。該算法包括接觸擁塞判斷和基于QoS的數(shù)據(jù)轉(zhuǎn)發(fā)兩種機(jī)制，分別從接觸剩余可用容量和節(jié)點(diǎn)剩余存儲空間兩方面對每一段接觸的擁塞程度進(jìn)行預(yù)測，將接觸劃分為不同的擁塞等級。在計(jì)算路由時，以整段路徑中所包含接觸的最高擁塞等級為該路徑的擁塞等級，并根據(jù)該擁塞等級發(fā)送不同優(yōu)先級的數(shù)據(jù)。實(shí)驗(yàn)表明，基于QoS的擁塞控制算法可以提高低優(yōu)先級數(shù)據(jù)的傳遞率并在節(jié)點(diǎn)存儲空間不足時降低最高優(yōu)先級數(shù)據(jù)的傳遞時延。
-
關(guān)鍵詞:
- 空間延遲容忍網(wǎng)絡(luò) /
- 擁塞控制 /
- 路徑擁塞等級 /
- 基于QoS的轉(zhuǎn)發(fā)
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. -
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. -
計(jì)量
- 文章訪問數(shù): 1326
- HTML全文瀏覽量: 156
- PDF下載量: 469
- 被引次數(shù): 0
下載:
