论文标题
利用耦合的BBR和自适应数据包计划提高MPTCP
Leveraging Coupled BBR and Adaptive Packet Scheduling to Boost MPTCP
论文作者
论文摘要
已经提出了很多算法来优化多径TCP(MPTCP)的传输性能。但是,由于其基于损失的拥塞控制和管理多个子量的困难,现有的MPTCP协议在失去和不断变化的网络中仍然远非令人满意。最近,提出了一个基于拥塞的拥塞控制BBR,可以通过更好地使用带宽来促进TCP传输性能。由于BBR的出色表现,我们尝试通过它来提高MPTCP。为此,应重新设计耦合的拥塞控制,以进行MPTCP,并且还必须开发能够有效利用BBR特征的功能调度程序,以提高性能。在本文中,我们首先提出耦合的BBR作为MPTCP的耦合拥塞控制算法,以在有损网络方案中实现高吞吐量和稳定的发送率,并保证具有TCP BBR流量和平衡的充血。然后,为了进一步提高性能,我们提出了一个适应性的冗余和逐包(AR \&p)调度程序,其中包括两种调度方法,以提高高度动态的网络方案中的适应性,并在非对称网络中保持阶级数据包的交付。基于Linux内核实现和测试床和真实网络方案的实验,我们表明,所提出的方案不仅提供了更高的吞吐量,而且还可以改善鲁棒性并在某些恶劣情况下减少订单外包。
Quite a few algorithms have been proposed to optimize the transmission performance of Multipath TCP (MPTCP). However, existing MPTCP protocols are still far from satisfactory in lossy and ever-changing networks because of their loss-based congestion control and the difficulty of managing multiple subflows. Recently, a congestion-based congestion control, BBR, is proposed to promote TCP transmission performance through better use of bandwidth. Due to the superior performance of BBR, we try to boost MPTCP with it. For this propose, coupled congestion control should be redesigned for MPTCP, and a functional scheduler able to effectively make use of the characteristics of BBR must also be developed for better performance. In this paper, we first propose Coupled BBR as a coupled congestion control algorithm for MPTCP to achieve high throughput and stable sending rate in lossy network scenarios with guaranteed fairness with TCP BBR flows and balanced congestion. Then, to further improve the performance, we propose an Adaptively Redundant and Packet-by-Packet (AR\&P) scheduler, which includes two scheduling methods to improve adaptability in highly dynamic network scenarios and keep in-order packet delivery in asymmetric networks. Based on Linux kernel implementation and experiments in both testbed and real network scenarios, we show that the proposed scheme not only provides higher throughput, but also improves robustness and reduces out-of-order packets in some harsh circumstances.