SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
On making TCP more robust to packet reordering
ACM SIGCOMM Computer Communication Review
Introduction to Algorithms
RR-TCP: A Reordering-Robust TCP with DSACK
ICNP '03 Proceedings of the 11th IEEE International Conference on Network Protocols
A new TCP for persistent packet reordering
IEEE/ACM Transactions on Networking (TON)
Improving the reliability of internet paths with one-hop source routing
OSDI'04 Proceedings of the 6th conference on Symposium on Opearting Systems Design & Implementation - Volume 6
Game Theoretic Stochastic Routing for Fault Tolerance and Security in Computer Networks
IEEE Transactions on Parallel and Distributed Systems
Hi-index | 0.00 |
Path disruptions are frequent occurrences on today's Internet. They may be due to congestion or failures, which in turn may be attributed to unintentional factors (e.g., hardware failures) or caused by malicious activity. Several efforts to-date have focused on enhancing robustness from the end-to-end viewpoint by using path diversity. Most of these studies are limited to single- or two-path approaches. This paper is the first to address the question of what degree of path diversity is needed to effectively mitigate the effect of path failures. We seek to answer this question through extensive experiments in PlanetLab. To evaluate the effect of path diversity on routing robustness in regards to a wide spectrum of applications, we introduce a new performance metric we named outage duration. Experimental results show that proactively forwarding packets using a high degree of path diversity is more effective in overcoming path failures in comparison with single-path or two-path approaches. In addition, for applications in which low packet loss probability is as important as uninterrupted connectivity, we suggest a packet forwarding scheme based on link gains and discuss the trade-offs between robustness and packet delivery probability.