Improving Multipath Routing of TCP Flows by Network Exploration

Abstract

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 TCP-SYN 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 TCP-path for elephant flows, especially when working with high loads, and yields significant improvements for all types of flow at medium- and high-load levels.

Keywords

• Data networks
• ECMP
• Ethernet
• flow completion time
• load balance
• multipath