期刊文献+

Optimizing CMT performance by joint predictions of bandwidth and RTT

Optimizing CMT performance by joint predictions of bandwidth and RTT
原文传递
导出
摘要 CMT uses the stream control transmission protocol's(SCTPs) multihoming feature to distribute data across multiple end-to-end paths in a multihomed SCTP association. As the disparity of multipaths, it is facing a great challenge to solve the disorder of the received data packets. To lighten the reordering degree and then to improve the throughput performance, we need to estimate the real-time paths' bandwidth and round trip time(RTT) as exactly as possible. In this paper, we use the extended vector(ext-vec) Kalman filter(KF) 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. To simulate and compare the algorithms' performance, two kinds of scenarios, bandwidth sensitive scenario and time and bandwidth sensitive scenario, are built and NS-2 is used. The 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. Comparing the existing algorithms, the algorithm can converge more quickly and can improve the system total throughput in a certain extent in bandwidth sensitive scenario. To time and bandwidth sensitive scenario, it can greatly improve the convergence speed and total throughput. CMT uses the stream control transmission protocol's(SCTPs) multihoming feature to distribute data across multiple end-to-end paths in a multihomed SCTP association. As the disparity of multipaths, it is facing a great challenge to solve the disorder of the received data packets. To lighten the reordering degree and then to improve the throughput performance, we need to estimate the real-time paths' bandwidth and round trip time(RTT) as exactly as possible. In this paper, we use the extended vector(ext-vec) Kalman filter(KF) 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. To simulate and compare the algorithms' performance, two kinds of scenarios, bandwidth sensitive scenario and time and bandwidth sensitive scenario, are built and NS-2 is used. The 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. Comparing the existing algorithms, the algorithm can converge more quickly and can improve the system total throughput in a certain extent in bandwidth sensitive scenario. To time and bandwidth sensitive scenario, it can greatly improve the convergence speed and total throughput.
出处 《The Journal of China Universities of Posts and Telecommunications》 EI CSCD 2015年第4期81-91,共11页 中国邮电高校学报(英文版)
基金 supported by the National Natural Science Foundation of China (61179006) the Natural Science Foundation of Jiangsu Province,China (BK20141068)
关键词 CMT SCTP extended vector Kalman filter RTT THROUGHPUT CMT,SCTP,extended vector Kalman filter,RTT,throughput
  • 相关文献

参考文献1

二级参考文献7

共引文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部