Concurrent Multipath Transfer Using SCTP Multihoming

We propose CMT Concurrent Multipath Transfer using the Stream Control Transmission Protocol (SCTP). CMT uses SCTP’s multihoming feature to simultaneously transfer new data across multiple end-to-end paths to the receiver. Through ns-2 simulations, we observe significant reordering at the receiver due to CMT. We identify three negative side-effects of reordering introduced by CMT that must be managed before the full performance gains of parallel transfer can be achieved: (i) unnecessary fast retransmissions at the sender, (ii) reduced cwnd growth due to fewer cwnd updates at the sender, and (iii) more ack traffic due to fewer delayed acks. We propose three algorithms which augment and/or modify current SCTP to counter these side-effects and present initial simulations indicating correctness of the proposed solutions. In this work, we operate under the strong assumptions that the receiver’s advertised window does not constrain the sender, and that the bottleneck queues on the end-to-end paths used in CMT are independent of each other.

[1]  Robert T. Braden,et al.  Requirements for Internet Hosts - Communication Layers , 1989, RFC.

[2]  Jonathan M. Smith,et al.  Striping within the network subsystem , 1995, IEEE Netw..

[3]  G. Parulkar,et al.  A reliable and scalable striping protocol , 1996, SIGCOMM '96.

[4]  Brian Lloyd,et al.  The PPP Multilink Protocol (MP) , 1994, RFC.

[5]  Vern Paxson,et al.  TCP Congestion Control , 1999, RFC.

[6]  Alex C. Snoeren,et al.  Adaptive inverse multiplexing for wide-area wireless networks , 1999, Seamless Interconnection for Universal Services. Global Telecommunications Conference. GLOBECOM'99. (Cat. No.99CH37042).

[7]  D. A. Khotimsky A packet resequencing protocol for fault-tolerant multipath transmission with non-uniform traffic splitting , 1999, Seamless Interconnection for Universal Services. Global Telecommunications Conference. GLOBECOM'99. (Cat. No.99CH37042).

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

[9]  Donald F. Towsley,et al.  Detecting shared congestion of flows via end-to-end measurement , 2000, SIGMETRICS '00.

[10]  Mario Gerla,et al.  TCP Westwood Simulation Studies in Multiple-Path Cases , 2000 .

[11]  Mark Allman,et al.  On making TCP more robust to packet reordering , 2002, CCRV.

[12]  Dhananjay S. Phatak,et al.  A novel mechanism for data streaming across multiple IP links for improving throughput and reliability in mobile environments , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[13]  João P. Hespanha,et al.  TCP-PR: TCP for persistent packet reordering , 2003, 23rd International Conference on Distributed Computing Systems, 2003. Proceedings..

[14]  Paul D. Amer,et al.  Making SCTP More Robust to Changeover , 2003 .

[15]  Ming Zhang,et al.  RR-TCP: a reordering-robust TCP with DSACK , 2003, 11th IEEE International Conference on Network Protocols, 2003. Proceedings..

[16]  Load Sharing in Stream Control Transmission Protocol , 2005 .

[17]  Mark Handley,et al.  Datagram Congestion Control Protocol (DCCP) , 2006, RFC.

[18]  Randall R. Stewart,et al.  Stream Control Transmission Protocol , 2000, RFC.