基于帶寬與往返時間聯合預測的多路徑并行傳輸性能優化算法

李文; 王文博; 景曉軍; 劉文; 張超

doi:10.13374/j.issn2095-9389.2015.01.020

基于帶寬與往返時間聯合預測的多路徑并行傳輸性能優化算法

doi: 10.13374/j.issn2095-9389.2015.01.020

李文^1,2, ,,
王文博³,
景曉軍¹,
劉文⁴,
張超⁵

1. 北京郵電大學信息與通信工程學院, 北京 100876;
2. 中國電子系統設備工程公司研究所, 北京 100000;
3. 北京郵電大學泛網無線通信教育部重點實驗室, 北京 100876;
4. 總參信息化部檔案館, 北京 100000;
5. 第二炮兵指揮學院通信系, 武漢 430012

基金項目:

解放軍理工大學預先研究青年基金資助項目

詳細信息

通訊作者:
李文,E-mail:13811226834@139.com

中圖分類號: TP393.4
計量
- 文章訪問數: 217
- HTML全文瀏覽量: 22
- PDF下載量: 8
- 被引次數: 0
出版歷程
- 收稿日期: 2014-10-30
- 網絡出版日期: 2021-07-10

CMT performance optimization algorithm based on union prediction of bandwidth and round trip time

LI Wen^{1,2
, ,},
WANG Wen-bo³,
JING Xiao-jun¹,
LIU Wen⁴,
ZHANG Chao⁵

1. School of Information and Communication Engineering, Beijing University of Posts and Telecommunications, Beijing 100876, China;
2. Institute of China Electronics System Engineering Company, Beijing 100000, China;
3. Key Laboratory of Universal Wireless Communication(Ministry of Education), Beijing University of Posts and Telecommunications, Beijing 100876, China;
4. The Archives of the Ministry of Information Technology, Beijing 100000, China;
5. Department of Communication, The Second Artillery Command College, Wuhan 430012, China

摘要

摘要: 在流控傳輸協議(stream control transmission protocol,SCTP)中,多路徑并行傳輸利用多家鄉特性實現數據在關聯的多條端到端路徑中的并行傳輸.然而,受不同路徑性能差異的影響,多路徑并行傳輸將帶來接收端的數據亂序.為了減輕數據亂序的程度并提高網絡吞吐量性能,需要盡可能準確地估計每條路徑的實時帶寬與往返時間(round trip time,RTT).本文利用擴展矢量卡爾曼濾波對多路徑并行傳輸中每條路徑的可用帶寬與往返時間進行聯合預測,同時提出了一種綜合考慮發送端未經接收端確認的數據的路徑選擇算法.仿真結果表明,通過實時準確地預測可用帶寬和往返時間,路徑選擇算法能夠減輕接收端數據亂序的程度.對于帶寬敏感的多路徑應用場景而言,該算法的收斂速度比Kalman-CMT算法更快,對網絡吞吐量性能也有一定程度地提高;對時延和帶寬都敏感的多路徑應用場景來說,算法在收斂速度與吞吐量兩方面優勢明顯.
- 網絡協議 /
- 優化算法 /
- 性能優化 /
- 數據傳輸 /
- 帶寬 /
- 往返時間 /
- 卡爾曼濾波
Abstract: Concurrent multipath transfer (CMT) uses the stream control transmission protocol's (SCTP) multihoming feature to distribute data across multiple end-to-end paths in a multihomed SCTP association. Due to the disparity of multipaths, it is facing a great challenge to solve the disorder of received data packets. In order to lighten the reordering degree and then to improve the through-put performance, we need to estimate the bandwidth and round trip time (RTT) of the real-time paths as exactly as possible. In this paper, we use the extended vector Kalman filter to predict the available bandwidth and RTT of each path simultaneously. Based on this, we propose a predictive path selection algorithm for CMT in SCTP. Simulation results show that the path selection algorithm can lessen the data packets disordering by correctly predicting each path's bandwidth and RTT in real time. To bandwidth sensitive scene,the algorithm can converge more quickly than Kalman-CMT and can improve the system total throughput in a certain extent. To time and bandwidth sensitive scene, the algorithm can greatly improve the convergence speed and total throughput than Kalman-CMT.
- network protocols /
- optimization algorithm /
- performance optimization /
- data transfer /
- bandwidth /
- round trip time /
- Kalman filter