# It's always TCP\_NODELAY. Every damn time.

DevFeed: [It's always TCP\_NODELAY. Every damn time.](<https://devfeed.tech/articles/it-s-always-tcp-nodelay-every-damn-time-12557.md>)

Original publisher: [Read original article](<http://brooker.co.za/blog/2024/05/09/nagle.html>)

Author: Marc Brooker

Published: 2024-05-09T00:00:00Z

Content type: opinion

Language: en

Sources: [Marc Brooker's Blog](<https://devfeed.tech/sources/marc-brooker-s-blog.md>), [Marc Brooker's Blog](<https://devfeed.tech/sources/marc-brooker-s-blog-2.md>)

Topics: [distributed-systems](<https://devfeed.tech/topics/distributed-systems.md>), [Latency](<https://devfeed.tech/topics/latency.md>), [Networks](<https://devfeed.tech/topics/networks.md>)

Tags: [debugging](<https://devfeed.tech/tags/debugging.md>), [distributed-systems](<https://devfeed.tech/tags/distributed-systems.md>), [latency](<https://devfeed.tech/tags/latency.md>), [network](<https://devfeed.tech/tags/network.md>), [networks](<https://devfeed.tech/tags/networks.md>)

## AI overview

The article examines latency problems in distributed systems related to TCP_NODELAY, Nagle's algorithm, and delayed acknowledgements. It explains how small TCP packets create substantial header overhead and how the interaction between Nagle's algorithm and delayed ACKs can contribute to latency.

## Source excerpt

It's always TCP_NODELAY. Every damn time. It's not the 1980s anymore, thankfully. The first thing I check when debugging latency issues in distributed systems is whether TCP_NODELAY is enabled. And it's not just me. Every distributed system builder I know has lost hours to latency issues quickly fixed by enabling this simple socket option, suggesting that the default behavior is wrong, and perhaps that the whole concept is outmoded. First, let's be clear about what we're talking about. There's no better source than John Nagle's RFC896 from 19841. First, the problem statement: There is a special problem associated with small packets. When TCP is used for the transmission of single-character messages originating at a keyboard, the typical result is that 41 byte packets (one byte of data, 40 bytes of header) are transmitted for each byte of useful data. This 4000% overhead is annoying but tolerable on lightly loaded networks. In short, Nagle was interested in better amortizing the cost of TCP headers, to get better throughput out of the network. Up to 40x better throughput! These tiny packets had two main causes: human-interactive applications like shells, where folks were typing a byte at a time, and poorly implemented programs that dribbled messages out to the kernel through many write calls. Nagle's proposal for fixing this was simple and smart: A simple and elegant solution has been discovered. The solution is to inhibit the sending of new TCP segments when new outgoing data arrives from the user if any previously transmitted data on the connection remains unacknowledged. When many people talk about Nagle's algorithm, they talk about timers, but RFC896 doesn't use any kind of timer other than the round-trip time on the network. Nagle's Algorithm and Delayed Acks Nagle's nice, clean, proposal interacted poorly with another TCP feature: delayed ACK. The idea behind delayed ACK is to delay sending the acknowledgement of a packet at least until there's some data to sen