Skip to Main Content
Multi-path transferring on the different paths with diverse delays would cause reordering and so unnecessary retransmission which eventually degrades the throughput of connections considerably. To address this issue, we first presented an optimal fragmentation strategy that should be held to avoid unnecessary retransmission/recovery timeouts events in TCP or SCTP due to reordering. Then, we introduced an analytical framework for the optimal fragmentation strategy of real-time traffic. Specifically, this paper formulates optimal traffic fragmentation as a constrained optimization problem using deterministic network calculus and derives its closed-form solution by our proposed progressive water-filling algorithm. Compared with previous work, the proposed scheme is simpler to implement and enforce.