2SYN is a lightweight, congestion-aware multihoming routing algorithm designed by researchers Kfir Toledo and Isaac Keslassy to dynamically select the optimal network path for outgoing TCP traffic. Published for the IEEE NOMS 2025 conference, it solves a critical flaw in traditional enterprise networks: the inability of standard multihoming routers to detect and avoid congested paths when connecting to arbitrary, external destinations (like public SaaS websites). The Core Problem Solved
When corporate branch offices utilize multihoming (connecting to multiple WAN links, like DSL, Fiber, or 4G/5G LTE), traditional routers route traffic using congestion-oblivious methods like round-robin or static failover.
While advanced congestion-aware tools exist, they suffer from strict limitations:
Multipath TCP (MPTCP): Requires both the source router and the destination server to support and accept MPTCP protocols.
SD-WAN: Requires complex configurations and pre-established tunnels on both ends, which is impossible when connecting to arbitrary public destinations.
2SYN acts as a destination-agnostic solution that works out of the box for any previously unseen public server without requiring any endpoint modifications. How the 2SYN Algorithm Works
The fundamental breakthrough of 2SYN is that it leverages the standard TCP 3-way handshake protocol to measure real-time Round-Trip Time (RTT) as a direct proxy for path congestion.
[Corporate Device] │ (New TCP Flow) ▼ ┌───────────┐ ┌───────────┐ (Path A) ──► [SYN] ──► │2SYN Router│───►───► │ Duplicate │ (Path B) ──► [SYN] ──► [Arbitrary Destination] └───────────┘ └───────────┘ (Path C) ──► [SYN] ──► ▲ │ │ ┌──────────────────────────────────────────────┘ │ ▼ ┌───────────┐ │ (Wins the race!) │ Fast Path │◄────┼── [SYN-ACK via Path B arrives first] └───────────┘ │ ├── [Subsequent SYN-ACKs arrive later] ──► (Silently discarded)
The algorithm executes this selection in three distinct, lightweight steps:
Duplicate SYN: When a local user initiates a new TCP connection, the 2SYN-enabled edge router intercepts the initial SYN packet and duplicates it across all available WAN paths (e.g., Path A, B, and C).
Race for the SYN-ACK: The router waits for the destination server to reply. Whichever path returns the first SYN-ACK packet is recognized as having the lowest combined propagation and queueing delay.
Commit and Cancel: The router assigns all future packets for that specific active flow (tracked via a 5-tuple table) to the winning path. Simultaneously, it instructs the destination to disregard the alternative paths, silently discarding the slower, trailing SYN-ACK packets. Key Performance Benefits
Zero Machine Learning Overhead: The authors explicitly highlighted that Machine Learning (ML) approaches are inadequate and too computationally heavy for line-rate routing decisions. 2SYN provides an elegant, deterministic alternative.
Linux-Native Compatibility: It is highly practical and can be easily implemented directly within Linux kernel routing structures without specialized hardware.
Real-World Resilience: In live trials bridging mixed networks (such as an unthrottled 4G LTE link and a throttled 100 Mbps wired broadband link), 2SYN successfully dynamically adapted to fluctuating link quality, dramatically lowering Flow Completion Times (FCT) compared to static load balancers.
For more technical deep dives, the research paper is available via the arXiv Abstract Page, the IBM Research Publications Database, and the full text can be reviewed directly via Technion’s Web Server.
I can break down specific metrics from this research if you would like. Would you prefer to explore its Linux kernel implementation tradeoffs or look closely at how it compares to MPTCP and SD-WAN architectures? 2SYN: Congestion-Aware Multihoming – arXiv
Leave a Reply