{"id":2180,"date":"2021-12-31T00:02:31","date_gmt":"2021-12-30T22:02:31","guid":{"rendered":"https:\/\/www.cs.ubbcluj.ro\/~bufny\/?p=2180"},"modified":"2022-01-10T00:18:01","modified_gmt":"2022-01-09T22:18:01","slug":"ip-multihoming-throughput-maximization-based-on-passive-rtt-measurements","status":"publish","type":"post","link":"https:\/\/www.cs.ubbcluj.ro\/~bufny\/ip-multihoming-throughput-maximization-based-on-passive-rtt-measurements\/","title":{"rendered":"IP Multihoming Throughput Maximization based on Passive RTT Measurements"},"content":{"rendered":"<p>published in Proceedings of the 28<sup>th<\/sup> International Conference on Software, Telecommunications and Computer Networks (SoftCOM), pp. 1-6, DOI: <a href=\"https:\/\/doi.org\/10.23919\/SoftCOM50211.2020.9238192\" target=\"_blank\" rel=\"noopener\">10.23919\/SoftCOM50211.2020.9238192<\/a>, September 17-19, 2020, Hvar, Croatia.<\/p>\n<p><strong>Cite as<\/strong><\/p>\n<pre class=\"nums:false wrap:on highlight:false\">A. Sterca, D. Bufnea and V. Niculescu, \"IP Multihoming Throughput Maximization based on Passive RTT Measurements\", 2020 International Conference on Software, Telecommunications and Computer Networks (SoftCOM), 2020, pp. 1-6, doi: 10.23919\/SoftCOM50211.2020.9238192<\/pre>\n<p><strong>Full paper<\/strong><\/p>\n<p><img decoding=\"async\" style=\"border: none; vertical-align: text-bottom;\" src=\"https:\/\/www.cs.ubbcluj.ro\/~bufny\/wp-content\/uploads\/pdf.png\" alt=\"\" \/> <a href=\"https:\/\/www.cs.ubbcluj.ro\/~bufny\/wp-content\/uploads\/IP-Multihoming-Throughput-Maximization-based-on-Passive-RTT-Measurements.pdf\" target=\"_blank\" rel=\"noopener\">IP Multihoming Throughput Maximization based on Passive RTT Measurements<\/a><\/p>\n<p><strong>Authors<\/strong><\/p>\n<p>Adrian Sterca, Darius Bufnea, Virginia Niculescu<br \/>\nDepartment of Computer Science, Faculty of Mathematics and Computer Science, Babe\u0219-Bolyai University of Cluj-Napoca, Romania<\/p>\n<p><strong>Copyright<\/strong><\/p>\n<p>\u00a9 2020 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting\/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.<\/p>\n<p><strong>Abstract<\/strong><\/p>\n<p>We present a routing solution for multihoming sites that maximizes the throughput of local flows. We consider the problem of transferring data between two multihomed network sites (i.e. network sites that have two or more uplinks to the Internet). Our routing solution is deployed at the edges of both multihomed sites and routes local flows dynamically through several outgoing network paths\/links depending on the load (i.e. congestion level) on each path. If the load on a network path increases, fewer local flows are routed through it. We measure the load on a network path using passive RTT measurements. We performed a significant number of experiments in order to show that our multihoming solution performs better than an ECMP-based (i.e. Equal-Cost Multipath) solution in terms of total aggregated throughput and inter-flow fairness.<\/p>\n<p><strong>Key words<\/strong><\/p>\n<p>multihoming, multipath load-balancing, multipath routing, ECMP routing<\/p>\n<p><strong>BibTeX bib file<\/strong><\/p>\n<p><img decoding=\"async\" style=\"border: none; vertical-align: text-bottom;\" src=\"https:\/\/www.cs.ubbcluj.ro\/~bufny\/wp-content\/uploads\/bib.png\" alt=\"\" \/> <a href=\"https:\/\/www.cs.ubbcluj.ro\/~bufny\/wp-content\/uploads\/softcom2020-multihoming.bib\" target=\"_blank\" rel=\"noopener\">softcom2020-multihoming.bib<\/a><\/p>\n<pre class=\"lang:tex url:wp-content\/uploads\/softcom2020-multihoming.bib nums:false\"><\/pre>\n<p><strong>References<\/strong><\/p>\n<ol>\n<li>M. Alizadeh, T. Edsall, S. Dharmapurikar, R. Vaidyanathan, K. Chu, A. Fingerhut, V. T. Lam, F. Matus, R. Pan, N. Yadav, and G. Varghese, <em>CONGA: Distributed Congestion-aware Load Balancing for Datacenters<\/em>, ACM Conference on SIGCOMM, 2014, pp. 503-514.<\/li>\n<li>K. He, E. Rozner, K. Agarwal, W. Felter, J. Carter, and A. Akella, <em>Presto: Edge-based Load Balancing for Fast Datacenter Networks<\/em>, 2015 ACM Conference on SIGCOMM, New York, USA, 2015, pp. 465-478.<\/li>\n<li>D. Thaler, C. Hopps, <em>Multipath Issues in Unicast and Multicast Next-Hop Selection<\/em>, RFC 2991, IETF, November 2000.<\/li>\n<li>P. Merindol, J.J. Pansiot, S. Cateloin, <em>Improving Load Balancing with Multipath Routing<\/em>, 17th International Conference on Computer Communications and Networks, Virgin Islands, USA, 2008, pp. 54-61.<\/li>\n<li>H. Wang, H. Xie, L. Qiu, Y. R. Yang, Y. Zhang, and A. Greenberg, <em>COPE: traffic engineering in dynamic networks<\/em>, 2006 ACM Conference on SIGCOMM, New York, USA, 2006, pp. 99-110.<\/li>\n<li>D. Applegate and E. Cohen, <em>Making intra-domain routing robust to changing and uncertain traffic demands: understanding fundamental tradeoffs<\/em>, 2003 ACM Conference on SIGCOMM, New York, USA, 2003, pp. 313-324.<\/li>\n<li>B. Fortz, J. Rexford, and M. Thorup, <em>Traffic engineering with traditional IP routing protocols<\/em>, IEEE Communications Magazine, Vol. 40, Issue 10, pp. 118-124, October, 2002.<\/li>\n<li>S. Kandula, D. Katabi, B. Davie, and A. Charny, <em>Walking the tightrope: responsive yet stable traffic engineering<\/em>, 2005 ACM Conference on SIGCOMM, New York, USA, 2005, pp. 253-264.<\/li>\n<li>E. Keller, M. Schapira, and J. Rexford, <em>Rehoming edge links for better traffic engineering<\/em>, SIGCOMM Computer Communications Review, Vol. 42, Issue 2, pp. 65-71, March, 2012.<\/li>\n<li>J. Wu, C. Yuen, B. Cheng, Y. Shang, and J. Chen, <em>Goodput-Aware Load Distribution for Real-time Traffic over Multipath Networks<\/em>, IEEE Transactions on Parallel and Distributed Systems, Vol. 26 , Issue 8, pp. 2286-2299, August, 2015.<\/li>\n<li>Y. Li, Y. Zhang, L. L. Qiu, and S. Lam, <em>SmartTunnel: Achieving Reliability in the Internet<\/em>, 2007 IEEE Conference on Computer Communications, Washington, USA, 2007, pp. 830-838.<\/li>\n<li>C. Raiciu, S. Barre, C. Pluntke, A. Greenhalgh, D. Wischik, and M. Handley, <em>Improving datacenter performance and robustness with multipath TCP<\/em>, 2011 ACM Conference on SIGCOMM, New York, USA, 2011, pp. 266-277.<\/li>\n<li>J. R. Iyengar, P. D. Amer, and R. Stewart, <em>Concurrent multipath transfer using SCTP multihoming over independent end-to-end paths<\/em>, IEEE\/ACM Transactions on Networking, Vol. 14, Issue 5, pp. 951-964, October, 2006.<\/li>\n<li>W. Yang, H. Li, F. Li, Q. Wu, and J. Wu, <em>RPS: range-based path selection method for concurrent multipath transfer<\/em>, 6th International Wireless Communications and Mobile Computing Conference, New York, USA, 2010, pp. 944-948.<\/li>\n<li>J. Wang, J. Liao, and T. Li, <em>OSIA: Out-of-order Scheduling for In-order Arriving in concurrent multi-path transfer<\/em>, Journal of Network and Computer Applications, Vol. 35, Issue 2, pp. 633-643, March, 2012.<\/li>\n<li>A. Sterca, D. Bufnea, V. Niculescu, <em>Bandwidth Aggregation over Multihoming Links<\/em>, Technical Report, <a href=\"http:\/\/www.cs.ubbcluj.ro\/forest\/research\/papers\/ip-multihoming-techrep.pdf\" target=\"_blank\" rel=\"noopener\">http:\/\/www.cs.ubbcluj.ro\/forest\/research\/papers\/ip-multihoming-techrep.pdf<\/a>, 2019.<\/li>\n<\/ol>\n","protected":false},"excerpt":{"rendered":"<p>published in Proceedings of the 28th International Conference on Software, Telecommunications and Computer Networks (SoftCOM), pp. 1-6, DOI: 10.23919\/SoftCOM50211.2020.9238192, September 17-19, 2020, Hvar, Croatia. Cite as A. Sterca, D. Bufnea and V. Niculescu, &#8220;IP Multihoming Throughput Maximization based on Passive&hellip; <a href=\"https:\/\/www.cs.ubbcluj.ro\/~bufny\/ip-multihoming-throughput-maximization-based-on-passive-rtt-measurements\/\" class=\"more-link\">Continue Reading <span class=\"meta-nav\">&rarr;<\/span><\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":[],"categories":[110],"tags":[],"_links":{"self":[{"href":"https:\/\/www.cs.ubbcluj.ro\/~bufny\/wp-json\/wp\/v2\/posts\/2180"}],"collection":[{"href":"https:\/\/www.cs.ubbcluj.ro\/~bufny\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.cs.ubbcluj.ro\/~bufny\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.cs.ubbcluj.ro\/~bufny\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.cs.ubbcluj.ro\/~bufny\/wp-json\/wp\/v2\/comments?post=2180"}],"version-history":[{"count":10,"href":"https:\/\/www.cs.ubbcluj.ro\/~bufny\/wp-json\/wp\/v2\/posts\/2180\/revisions"}],"predecessor-version":[{"id":2217,"href":"https:\/\/www.cs.ubbcluj.ro\/~bufny\/wp-json\/wp\/v2\/posts\/2180\/revisions\/2217"}],"wp:attachment":[{"href":"https:\/\/www.cs.ubbcluj.ro\/~bufny\/wp-json\/wp\/v2\/media?parent=2180"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.cs.ubbcluj.ro\/~bufny\/wp-json\/wp\/v2\/categories?post=2180"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.cs.ubbcluj.ro\/~bufny\/wp-json\/wp\/v2\/tags?post=2180"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}