Dynamic Window Coupling for multipath congestion control

The traditional problem of end-hosts efficiently and fairly utilizing end-to-end paths becomes significantly harder when the end-hosts are multihomed. Such is the case, for instance, when an end-host has simultaneous connectivity through several service providers, or when a mobile device is simultaneously connected via both a wireless LAN and a cellular network. A multihoming-aware transport protocol, such as MPTCP or SCTP, that sends data over the multiple resulting end-to-end paths must be fair to other flows in the network while being able to maximize its own throughput. In this paper, we present Dynamic Window Coupling (DWC), a multipath congestion control mechanism that seeks to achieve both these goals. DWC uses loss and delay signals to detect shared bottlenecks, explicitly grouping and sharing congestion control across subflows on paths that have a common bottleneck, while separating congestion control for subflows on paths with distinct bottlenecks. DWC detects shifting bottlenecks in the network and responds by dynamically regrouping subflows. Simulations demonstrate that DWC detects shared bottlenecks under most network topologies and conditions that we considered, regroups subflows correctly as bottlenecks shift, aggregates throughput across distinct bottlenecks, and is fair to other TCP flows at all bottlenecks.

[1]  Mark Handley,et al.  Architectural Guidelines for Multipath TCP Development , 2011, RFC.

[2]  Larry L. Peterson,et al.  TCP Vegas: End to End Congestion Avoidance on a Global Internet , 1995, IEEE J. Sel. Areas Commun..

[3]  Y. Nishida,et al.  Multipath Congestion Control for Shared Bottleneck , 2009 .

[4]  B. Barden Recommendations on queue management and congestion avoidance in the Internet , 1998 .

[5]  Qian Zhang,et al.  A Compound TCP Approach for High-Speed and Long Distance Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[6]  S. Paul,et al.  QRP04-3: Architecture, Implementation, and Evaluation of cmpTCP Westwood , 2006, IEEE Globecom 2006.

[7]  Donald F. Towsley,et al.  Detecting shared congestion of flows via end-to-end measurement , 2002, TNET.

[8]  Mark Handley,et al.  The resource pooling principle , 2008, CCRV.

[9]  Janardhan R. Iyengar,et al.  Low Extra Delay Background Transport (LEDBAT) , 2012, RFC.

[10]  Mark Handley,et al.  Coupled Congestion Control for Multipath Transport Protocols , 2011, RFC.

[11]  Yong-June Shin,et al.  A wavelet-based approach to detect shared congestion , 2004, TNET.

[12]  Janardhan R. Iyengar,et al.  Concurrent Multipath Transfer Using SCTP Multihoming Over Independent End-to-End Paths , 2006, IEEE/ACM Transactions on Networking.

[13]  Alan Ford,et al.  MPTCP Application Interface Considerations , 2010 .

[14]  Dina Katabi,et al.  Inferring Congestion Sharing and Path Characteristics from Packet Interarrival Times , 2001 .

[15]  Andrei V. Gurtov,et al.  Improving TCP-Friendliness for mHIP , 2010, AccessNets.

[16]  Marcelo Bagnulo,et al.  Shim6: Level 3 Multihoming Shim Protocol for IPv6 , 2009, RFC.

[17]  Ossama Younis,et al.  FlowMate: scalable on-line flow clustering , 2005, IEEE/ACM Transactions on Networking.

[18]  Jan Newmarch Stream control transmission protocol (SCTP) associations , 2007 .

[19]  Raghupathy Sivakumar,et al.  A Transport Layer Approach for Achieving Aggregate Bandwidths on Multi-Homed Mobile Hosts , 2002, MobiCom '02.

[20]  Thomas Dreibholz,et al.  Applying TCP-Friendly Congestion Control to Concurrent Multipath Transfer , 2010, 2010 24th IEEE International Conference on Advanced Information Networking and Applications.

[21]  Mark Handley,et al.  Design, Implementation and Evaluation of Congestion Control for Multipath TCP , 2011, NSDI.

[22]  Ming Zhang,et al.  A Transport Layer Approach for Improving End-to-End Performance and Robustness Using Redundant Paths , 2004, USENIX Annual Technical Conference, General Track.

[23]  Thomas Voice,et al.  Stability of end-to-end algorithms for joint routing and rate control , 2005, CCRV.

[24]  S. Floyd,et al.  Tcp-friendly unicast rate-based flow control , 1997 .

[25]  Vern Paxson,et al.  Computing TCP's Retransmission Timer , 2000, RFC.

[26]  Azer Bestavros,et al.  Robust identification of shared losses using end-to-end unicast probes , 2000, Proceedings 2000 International Conference on Network Protocols.

[27]  Marcel Dischinger,et al.  Characterizing residential broadband networks , 2007, IMC '07.

[28]  Sally Floyd,et al.  Adaptive RED: An Algorithm for Increasing the Robustness of RED's Active Queue Management , 2001 .

[29]  Michael Welzl,et al.  On the Accurate Identification of Network Paths Having a Common Bottleneck , 2013, TheScientificWorldJournal.