Evaluating Multipath TCP Resilience against Link Failures


College of Computer and Information Sciences, Department of Computer Engineering, King Saud University. Riyadh, Saudi Arabia



Standard TCP is the de facto reliable transfer protocol for the Internet. It is designed to establish a reliable connection using only a single network interface. However, standard TCP with single interfacing performs poorly due to intermittent node connectivity. This requires the re-establishment of connections as the IP addresses change. Multi-path TCP (MPTCP) has emerged to utilize multiple network interfaces in order to deliver higher throughput. Resilience to link failures can be better supported in MPTCP as the segments’ communication are maintained via alternative interfaces. In this paper, the resilience of MPTCP to link failures against several challenges is evaluated. Several link failure scenarios are applied to examine all aspects of MPTCP including congestion algorithms, path management, and subflow scheduling. In each scenario, the behavior of MPTCP is studied by observing and analyzing the throughput and delay. The evaluation of the results indicates MPTCP resilience to a low number of failed links. However, as the number of failed links increases, MPTCP can only recover full throughput if the link failure occurs on the server side. In addition, in the presence of link failures, the lowestRTT MPTCP scheduler yields the shortest delivery time while providing the minimum application jitter.


[1] James P. G. Sterbenz, David Hutchison, Egemen K. Çetinkaya, Abdul Jabbar, Justin P.Rohrer, Marcus Schöller, and Paul Smith. Resilience and survivability in communication networks: Strategies, principles, and survey of disciplines.
Computer Networks, 54(8):1245–1265,2010.
[2] Justin P. Rohrer, Abdul Jabbar, and James P.G.Sterbenz. Path Diversification for Future Internet End-to-End Resilience and Survivability.Springer Telecommunication Systems, 56(1):49–67, May 2014.

[3] Yao Wang, Shivendra Panwar, Shunan Lin, and Shiwen Mao. Wireless video transport using path diversity: Multiple description vs layered coding. In Proceedings of the International Conference on Image Processing, volume 1, pages I–21–I–24,2002.
[4] Wilton Henao-Mazo and Angel Bravo-Santos. Finding diverse shortest paths for the routing task in wireless sensor networks. Proc. ICSNC,pages 53–58, 2012.
[5] A.C. Begen, Y. Altunbasak, and O. Ergun. Multipath selection for multiple description encoded video streaming. In Proceedings of the IEEE International Conference on Communications (ICC ’03), volume 3, pages 1583–1589, May 2003.
[6] Eiji Oki, Nobuaki Matsuura, Kohei Shiomoto, and Naoaki Yamanaka. A disjoint path selection scheme with shared risk link groups in GMPLS networks. IEEE Communications Letters,6(9):406–408, September 2002.
[7] Yufei Cheng, M. Todd Gardner, Junyan Li, Rebecca May, Deep Medhi, and James P.G. Sterbenz. Optimised Heuristics for a Geodiverse Routing Protocol. In Proceedings of the IEEE 10th International Workshop on the Design of Reliable
Communication Networks (DRCN), pages 1–9, Ghent, Belgium, April 2014.
[8] Shweta Jain and Samir R Das. Exploiting path diversity in the link layer in wireless ad hoc networks. Ad Hoc Networks, 6(5):805–825, 2008.
[9] Renata Teixeira, Keith Marzullo, Stefan Savage, and Geoffrey M. Voelker. In search of path diversity in ISP networks. In Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement (IMC ’03), pages 313–318, New York, NY, USA, 2003. ACM.
[10] Alan Ford, Costin Raiciu, Mark Handley, Sebastien Barre, and Janardhan Iyengar. Architectural guidelines for multipath tcp development. RFC 6824, 2011.
[11] A. Ford, C. Raiciu, M. Handley, and O. Bonaventure. TCP extensions for multipath operation with multiple addresses. RFC 6824 (Experimental), January 2013.
[12] Sinh Chung Nguyen, Xiaofei Zhang, Thi Mai Trang Nguyen, and Guy Pujolle. Evaluation of throughput optimization and load sharing of multipath tcp in heterogeneous networks. In Wireless and optical communications networks
(WOCN), 2011 eighth international conference on, pages 1–5. IEEE, 2011.
[13] Nigel Williams. Implementing a multipath transmission control protocol (mptcp) stack for freebsd with pluggable congestion and scheduling control. 2016.
[14] Olivier Bonaventure and S Seo. Multipath tcp deployments. IETF Journal, 12(2):24–27, 2016.
[15] Olivier Mehani, Ralph Holz, Simone Ferlin, and Roksana Boreli. An early look at multipath tcp deployment in the wild. In Proceedings of the 6th International Workshop on Hot Topics in Planet-Scale Measurement, HotPlanet ’15, pages
7–12, New York, NY, USA, 2015. ACM.
[16] S. K. Sivagurunathan, J. Jones, M. Atiquzzaman, Shaojian Fu, and Yong-Jin Lee. Experimental comparison of handoff performance of sigma and mobile ip. In HPSR. 2005 Workshop on High Performance Switching and Routing, 2005.,
pages 366–370, May 2005.
[17] D. Nunes, D. Raposo, D. Silva, P. Carmona, and J. S. Silva. Achieving human-aware seamless handoff. In 2015 International Conference on Distributed Computing in Sensor Systems, pages 254–259, June 2015.
[18] L. Ford. Network flow theory. 1956.
[19] E. W. Dijkstra. A note on two problems in connection with graphs. Numerische Mathematik, 1:269–271, 1959.
[20] MH MacGregor and WD Grover. Optimized kshortest- paths algorithm for facility restoration. Software: Practice and Experience, 24(9), 1994.
[21] Jin Y Yen. Finding the k shortest loopless paths in a network. management Science, 17(11):712–716, 1971.
[22] Wayne D. Grover. Mesh-based Survivable Transport Networks: Options and Strategies for Optical, MPLS, SONET and ATM Networking. Prentice Hall PTR, Upper Saddle River, NJ, USA,2003.
[23] Y. Cheng, T. A. N. Nguyen, M. M. Rahman,S. Gangadhar, and J. P. G. Sterbenz. Geodiverse routing protocol with multipath forwarding compared to mptcp. In 2016 8th International Workshop on Resilient Networks Design and Modeling
(RNDM), pages 142–149, Sept 2016.
[24] J. W. Suurballe. Disjoint paths in a network. Networks, 4(2), 1974.
[25] J. W. Suurballe and R. E. Tarjan. A quick method for finding shortest pairs of disjoint paths. Networks, 14(2), 1984.
[26] Ramesh Bhandari. Survivable Networks: Algorithms for Diverse Routing. Kluwer Academic Publishers, Norwell, MA, USA, 1998.
[27] Lanny Sitanayah, Kenneth N Brown, and Cormac J Sreenan. A fault-tolerant relay placement algorithm for ensuring k vertex-disjoint shortest paths in wireless sensor networks. Ad Hoc Networks, 23:145–162, 2014.
[28] Kien Nguyen, Mirza Golam Kibria, Kentaro Ishizu, and Fumihide Kojima. A study on performance evaluation of multipath tcp implementations. In Proceedings of the Eighth International Symposium on Information and Communication

Technology, SoICT 2017, pages 242–248, New York, NY, USA, 2017. ACM.
[29] Christoph Paasch, Simone Ferlin, Ozgu Alay, and Olivier Bonaventure. Experimental evaluation of multipath tcp schedulers. In Proceedings of the 2014 ACM SIGCOMM Workshop on Capacity Sharing Workshop, CSWS ’14, pages 27–32, New York, NY, USA, 2014. ACM.
[30] Amani Alheid, Dritan Kaleshi, and Angela Doufexi. Performance evaluation of mptcp in indoor heterogeneous networks. In Proceedings of the 2014 First International Conference on Systems Informatics, Modelling and Simulation,
SIMS ’14, pages 213–218, Washington, DC, USA, 2014. IEEE Computer Society.
[31] Jin Seong Lee and Jaiyong Lee. Multipath tcp performance improvement in mobile network. In Ubiquitous and Future Networks (ICUFN), 2015 Seventh International Conference on, pages 710–714. IEEE, 2015.
[32] M. Sandri, A. Silva, L. A. Rocha, and F. L. Verdi. On the benefits of using multipath tcp and openflow in shared bottlenecks. In 2015 IEEE 29th International Conference on Advanced Information Networking and Applications, pages 9–16,March 2015.
[33] Nick McKeown, Tom Anderson, Hari Balakrishnan, Guru Parulkar, Larry Peterson, Jennifer Rexford, Scott Shenker, and Jonathan Turner. OpenFlow: Enabling innovation in campus networks. ACM SIGCOMM Computer Communication
Review, 38(2):69–74, 2008.
[34] Kubilay Demir and Neeraj Suri. Towards ddos attack resilient wide area monitoring systems. In Proceedings of the 12th International Conference on Availability, Reliability and Security, ARES’17, pages 99:1–99:7, New York, NY, USA, 2017.ACM.
[35] E. Dong, M. Xu, X. Fu, and Y. Cao. Lamps: A loss aware scheduler for multipath tcp over highly lossy networks. In 2017 IEEE 42nd Conference on Local Computer Networks (LCN), pages 1–9,Oct 2017.
[36] Luca Boccassi, Marwan M. Fayed, and Mahesh K.Marina. Binder: A system to aggregate multiple internet gateways in community networks. In Proceedings of the 2013 ACM MobiCom Workshop on Lowest Cost Denominator Networking
for Universal Access, LCDNet ’13, pages 3–8, New York, NY, USA, 2013. ACM.
[37] Costin Raiciu, Mark Handley, and Damon Wischik. Coupled congestion control for multipath transport protocols. Technical report, 2011.
[38] Damon Wischik, Costin Raiciu, Adam Greenhalgh, and Mark Handley. Design, implementation and evaluation of congestion control for multipath tcp. In NSDI, volume 11, pages 8–8,2011.
[39] Ramin Khalili, Nicolas Gast, Miroslav Popovic, et al. Opportunistic linked-increases congestion control algorithm for mptcp. 2013.
[40] Q. Peng, A. Walid, J. Hwang, and S. H. Low. Multipath tcp: Analysis, design, and implementation.
IEEE/ACM Transactions on Networking, 24(1):596–609, Feb 2016.
[41] Yu Cao, Mingwei Xu, and Xiaoming Fu. Delaybased congestion control for multipath tcp. In Network Protocols (ICNP), 2012 20th IEEE International Conference on, pages 1–10. IEEE, 2012.
[42] Brent Chun, David Culler, Timothy Roscoe, Andy Bavier, Larry Peterson, Mike Wawrzoniak, and Mic Bowman. Planetlab: an overlay testbed for broad-coverage services. ACM SIGCOMM Computer Communication Review, 33(3):3–12,