Analysis of multi-path routing
IEEE/ACM Transactions on Networking (TON)
Modeling TCP Reno performance: a simple model and its empirical validation
IEEE/ACM Transactions on Networking (TON)
On making TCP more robust to packet reordering
ACM SIGCOMM Computer Communication Review
A Multi-path QoS Routing Protocol in a Wireless Mobile ad Hoc Network
ICN '01 Proceedings of the First International Conference on Networking-Part 2
TCP-PR: TCP for Persistent Packet Reordering
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Routing Bandwidth Guaranteed Paths with Restoration in Label Switched Networks
ICNP '01 Proceedings of the Ninth International Conference on Network Protocols
On-Demand Multi Path Distance Vector Routing in Ad Hoc Networks
ICNP '01 Proceedings of the Ninth International Conference on Network Protocols
RR-TCP: A Reordering-Robust TCP with DSACK
ICNP '03 Proceedings of the 11th IEEE International Conference on Network Protocols
Improving TCP Reordering Robustness in Multipath Networks
LCN '04 Proceedings of the 29th Annual IEEE International Conference on Local Computer Networks
A cross-layer concurrent multi-path forward algorithm
ICAIT '08 Proceedings of the 2008 International Conference on Advanced Infocomm Technology
RPS: range-based path selection method for concurrent multipath transfer
Proceedings of the 6th International Wireless Communications and Mobile Computing Conference
On UDP continuity over vertical handovers
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.24 |
One major drawback of multipath transferring schemes inspired by usage of different paths with diverse delays is the emergence of reordering among packets of the same flow. In this paper, we present two separate approaches to resolve this problem for UDP and TCP connections. By properly scheduling the packets among multiple paths, our UDP-based approach tries to deliver data to the receiver in-order, while imposing a minimum possible delay and small buffer space on the receiver's application. We theoretically prove the optimality of the proposed method and then present its analytical results. Unfortunately, in the case of TCP, the reordering intensifies the problem by bringing more timeouts and many unnecessary fast-retransmits which eventually degrades the throughput of TCP connections considerably. To address these issues, we first present the general conditions that should be held to avoid timeouts in multipath schemes. Then, we enhance our approach by preventing nonessential fast-retransmit/recovery events in TCP. Moreover, we introduce an analytical model to estimate the probability of triggering 3rd duplicate ACK in our method. Finally, through simulation experiments we show that the performance of our multipath methods is comparable with the optimal one-path transmissions (with aggregated bandwidth); especially, in terms of throughput and fast-retransmit ratio parameters.