北京科技大学学报
北京科技大學學報
북경과기대학학보
JOURNAL OF UNIVERSITY OF SCIENCE AND TECHNOLOGY BEIJING
2015年
1期
132-143
,共12页
李文%王文博%景晓军%刘文%张超
李文%王文博%景曉軍%劉文%張超
리문%왕문박%경효군%류문%장초
网络协议%优化算法%性能优化%数据传输%带宽%往返时间%卡尔曼滤波
網絡協議%優化算法%性能優化%數據傳輸%帶寬%往返時間%卡爾曼濾波
망락협의%우화산법%성능우화%수거전수%대관%왕반시간%잡이만려파
network protocols%optimization algorithm%performance optimization%data transfer%bandwidth%round trip time%Kalman filter
在流控传输协议( stream control transmission protocol, SCTP)中,多路径并行传输利用多家乡特性实现数据在关联的多条端到端路径中的并行传输。然而,受不同路径性能差异的影响,多路径并行传输将带来接收端的数据乱序。为了减轻数据乱序的程度并提高网络吞吐量性能,需要尽可能准确地估计每条路径的实时带宽与往返时间( round trip time, RTT)。本文利用扩展矢量卡尔曼滤波对多路径并行传输中每条路径的可用带宽与往返时间进行联合预测,同时提出了一种综合考虑发送端未经接收端确认的数据的路径选择算法。仿真结果表明,通过实时准确地预测可用带宽和往返时间,路径选择算法能够减轻接收端数据乱序的程度。对于带宽敏感的多路径应用场景而言,该算法的收敛速度比Kalman-CMT算法更快,对网络吞吐量性能也有一定程度地提高;对时延和带宽都敏感的多路径应用场景来说,算法在收敛速度与吞吐量两方面优势明显。
在流控傳輸協議( stream control transmission protocol, SCTP)中,多路徑併行傳輸利用多傢鄉特性實現數據在關聯的多條耑到耑路徑中的併行傳輸。然而,受不同路徑性能差異的影響,多路徑併行傳輸將帶來接收耑的數據亂序。為瞭減輕數據亂序的程度併提高網絡吞吐量性能,需要儘可能準確地估計每條路徑的實時帶寬與往返時間( round trip time, RTT)。本文利用擴展矢量卡爾曼濾波對多路徑併行傳輸中每條路徑的可用帶寬與往返時間進行聯閤預測,同時提齣瞭一種綜閤攷慮髮送耑未經接收耑確認的數據的路徑選擇算法。倣真結果錶明,通過實時準確地預測可用帶寬和往返時間,路徑選擇算法能夠減輕接收耑數據亂序的程度。對于帶寬敏感的多路徑應用場景而言,該算法的收斂速度比Kalman-CMT算法更快,對網絡吞吐量性能也有一定程度地提高;對時延和帶寬都敏感的多路徑應用場景來說,算法在收斂速度與吞吐量兩方麵優勢明顯。
재류공전수협의( stream control transmission protocol, SCTP)중,다로경병행전수이용다가향특성실현수거재관련적다조단도단로경중적병행전수。연이,수불동로경성능차이적영향,다로경병행전수장대래접수단적수거란서。위료감경수거란서적정도병제고망락탄토량성능,수요진가능준학지고계매조로경적실시대관여왕반시간( round trip time, RTT)。본문이용확전시량잡이만려파대다로경병행전수중매조로경적가용대관여왕반시간진행연합예측,동시제출료일충종합고필발송단미경접수단학인적수거적로경선택산법。방진결과표명,통과실시준학지예측가용대관화왕반시간,로경선택산법능구감경접수단수거란서적정도。대우대관민감적다로경응용장경이언,해산법적수렴속도비Kalman-CMT산법경쾌,대망락탄토량성능야유일정정도지제고;대시연화대관도민감적다로경응용장경래설,산법재수렴속도여탄토량량방면우세명현。
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.