MPSCTP: A Simple and Efficient Multipath Algorithm for SCTP

A multipath variant of SCTP with optimized flow division extension

“…This generates bursty growth in the congestion window value. To overcome these side effects of multipath usage, we had earlier proposed MPSCTP [9] as a multipath extension of SCTP.…”

“…Moreover, due to the PSNs, the MPSCTP receiver can clearly distinguish between chunk loss, sender induced reordering, and also does not require the Delayed Acknowledgment for CMT (DAC) algorithm and RTT heuristics as being used by CMT. However, this requires several changes in the chunk header and the SACK structure to accommodate the details related to the PSN values as presented in [9].…”

“…Several issues related to SCTP multihoming are discussed in [8]. SCTP's multihoming feature is extended to design multipath variants [9][10][11] which can use all the available paths to transfer data in a concurrent fashion.…”

“…This reduces the complexity of the algorithms significantly and makes MPSCTP more scalable than the CMT protocol. However, in its original form, MPSCTP [9] implicitly assumes that there is no acknowledgment loss in the network. Such an assumption may restrict the scope of usage of MPSCTP in high loss networks and wireless scenarios.…”

Qos-driven SCTP-based multimedia delivery over heterogeneous wireless networks

“…Although large numbers of SCTP path selection schemes [9][10][11][12][13][14][15][16] and handover solutions [17][18][19][20][21][22][23][24][25] have been introduced, there is still significant ongoing work addressing many problems of the SCTP handover. In current SCTP handover solutions, each candidate network is evaluated as a function of multiple transport layer attributes.…”