中文摘要：

MPTCP是IETFMPTCP工作组新设计的一种传输协议，可在一个连接中同时使用多条路径．为实现大范围部署，MPTCP的设计需确保公平性，其中包含网络公平性和瓶颈公平性．MPTCP工作组为MPTCP协议设计了一种满足网络公平性并倾向于资源池的拥塞控制算法，但没有考虑瓶颈公平性问题．本文首先给出拥塞避免阶段拥塞窗口增大量和减小量满足网络公平性时的关系，然后结合瓶颈公平性，设计出一种基于公平加权耦合的多路径拥塞控制算法．仿真表明，此算法可在保证网络公平性的前提下，有效提升多路径连接子流在各条路径上，尤其是较差路径上的瓶颈公平性．

英文摘要：

MPTCP,as proposed by the IETF working group mptcp, allowing a single data stream to be split across multiple paths, aims to gain wide-scale deployment by ensuring compatibility and fairness { including network fairness and bottleneck fairness ）. How- ever, the Coupled Congestion Control for Multipath Transport Protocols designed by the working group most focuses on the network fairness and resource pool, and fails to take the bottleneck fairness into consideration. Meanwhile, few researchers have ever paid at- tention to this problem. In this paper, to fill the gap, we deduce the relationship between the increment and decrement of cwnd （ con- gestion window） in congestion control algorithm when the network fairness is considered separately, then give the design of FWC { Fairness-Weighted Coupling） congestion control algorithm which is inclined to the bottleneck fairness while achieves the network fairness. Simulations demonstrate that on the premise of network fairness, FWC has the ability to improve the bottleneck fairness of subflows, especially the one on the most congested path, by shift the throughput on the congested paths to the path with better per- formance. Such results meet our expectations since the congested paths are badly in need of reducing throughput to avoid congestion.