Improving multipath routing of TCP flows by network exploration
| Autor: | Jose M. Arco, Joaquin Alvarez-Horcajo, Juan A. Carral, Diego Lopez-Pajares, Isaias Martinez-Yelmo |
|---|---|
| Přispěvatelé: | Universidad de Alcalá. Departamento de Automática |
| Rok vydání: | 2019 |
| Předmět: |
Ethernet
load balance General Computer Science Computer science Flow completion time Throughput 02 engineering and technology Network topology Multipath Network exploration 0202 electrical engineering electronic engineering information engineering Overhead (computing) General Materials Science Data networks Informática business.industry Network packet ComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS General Engineering 020206 networking & telecommunications flow completion time Multipath routing ECMP 020201 artificial intelligence & image processing multipath lcsh:Electrical engineering. Electronics. Nuclear engineering Routing (electronic design automation) business TCP lcsh:TK1-9971 Load balance Multipath propagation Computer network |
| Zdroj: | e_Buah Biblioteca Digital Universidad de Alcalá Universidad de Alcalá (UAH) IEEE Access, Vol 7, Pp 13608-13621 (2019) instname |
| Popis: | Ethernet switched networks are widely used in enterprise and data center networks. However, they have some drawbacks, mainly that, to prevent loops, they cannot take advantage of multipath topologies to balance traffic. Several multipath routing proposals use link-state protocols and Equal Cost Multi-Path routing (ECMP) to distribute the load over multiple paths. But, these proposals are complex and prone to flow collisions that may degrade performance. This paper studies TCP-Path, a protocol that employs a different approach. It uses a distributed network exploration mechanism based on broadcasting the TCPSYN packet to identify and select the fastest available path to the destination host, on the fly. Our evaluation shows that it improves on ECMP by up to 70% in terms of throughput for elephant flows and by up to 60% in terms of flow completion time for mouse flows. Indeed, network exploration offers a better, yet simple alternative to ECMP-based solutions for multipath topologies. In addition, we also study TCP-Path for elephant flows (TFE), which restricts TCP-Path application to elephant flows to reduce the exploration broadcast overhead and the size of forwarding tables, thus improving its scalability. Although elephant flows represent a small fraction (about 5%) of total flows, they have a major impact on overall performance, as we show in our evaluation. TFE reduces both the overhead incurred during path setup and the size of the forwarding tables by a factor of almost 20. Moreover, it achieves results close to those obtained by TCPPath for elephant flows, especially when working with high loads, and yields significant improvements for all types of flow at medium and high load levels. Comunidad de Madrid Universidad de Alcalá |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|