1. 糊涂窗口综合症（silly window syndrome,简称SWS）
如果发送方快速地产生数据，发送方TCP传输的报文段所携带的数据很快就会装满接收方的缓冲区。最终，发送方会收到窗口通告确认信息，得知接收方的窗口已被填满。如果接收方的应用程序每次从饱和的缓冲区读取1个字节之后，那么接收方会向发送方发送一个字节的窗口通告，发送方再发送一个字节 ...... 如此反复。发送方和接收方之间的这种交互可能进入一个稳定的状态，届时TCP为每个字节数据发送一个单独的报文段。传输短报文段严重地浪费了网络带宽，带来了不必要的计算负载。这种现象或者问题称为“糊涂窗口综合症”。
No ACK was sent for the previous segment received.
A segment is received, but no other segment arrives within 200 milliseconds for that connection.
In other words, an ACK is sent for every other TCP segment received on a connection, unless the delayed ACK timer expires after 200 milliseconds pass.
也就是说：在Windows上，“推迟确认”实现为：要么每两个TCP segment发送一个ACK确认，要么在ACK定时器过时是发送一个ACK确认（此时是一个TCP segment一个ACK确认）。TCP标准推荐最多推迟500ms，微软指定的推迟为200ms.
3）如果接受端的应用程序在接受到一个TCP segment之后，立即产生响应，也就是说要向发送方发送数据回应他，那么此时给TCP segment的ACK确认将被捎带在该数据段中发送回去。（此时是一个TCP segment一个ACK确认，但是没有增加网络上得TCP segment的数量.）
4）如果接受端的应用程序在数据到达之后，尽快读取数据，读取数据之后，TCP会移动自己的窗口，那么ACK确认会和更新的窗口通告一起捎带回去。（此时是一个TCP segment一个ACK确认，但是没有增加网络上得TCP segment的数量.）
a) to avoid the silly window syndrome;（在接受端避免“糊涂窗口综合症”）
b) to allow ACKs to piggyback on a reply frame if one is ready to go when the stack decides to do the ACK;
c) to allow the stack to send one ACK for several frames， if those frames arrive within
the delay period.（这里的several推荐为2.）
Nagle's algorithm, named after John Nagle, is a means of improving the efficiency of TCP/IP networks by reducing the number of packets that need to be sent over the network.
Nagle's document, Congestion Control in IP/TCP Internetworks (RFC 896) describes what he called the 'small packet problem', where an application repeatedly emits data in small chunks, frequently only 1 byte in size. Since TCP packets have a 40 byte header (20 bytes for TCP, 20 bytes for IPv4), this results in a 41 byte packet for 1 byte of useful information, a huge overhead. This situation often occurs in Telnet sessions, where most keypresses generate a single byte of data that is transmitted immediately. Worse, over slow links, many such packets can be in transit at the same time, potentially leading to congestion collapse.
Nagle's algorithm works by combining a number of small outgoing messages, and sending them all at once. Specifically, as long as there is a sent packet for which the sender has received no acknowledgment, the sender should keep buffering its output until it has a full packet's worth of output, so that output can be sent all at once.
也就是说：Nagle算法在发送端进行操作（而“推迟确认”是在接收端进行操作）。Nagle算法，在发送端为了避免发送很小的TCP segment，规定只有在下面两种情况下才会发送TCP segment:
2）发送端的数据累计达到了MSS（maximun segment size）；
- if there is new data to send
- if the window size >= MSS and available data is >= MSS
- send complete MSS segment now
- if there is unconfirmed data still in the pipe
- enqueue data in the buffer until an acknowledge is received
- send data immediately
- end if
- end if
- end if
This algorithm interacts badly with TCP delayed acknowledgments. With both algorithms enabled, applications that do two successive writes to a TCP connection, followed by a read that will not be fulfilled until after the data from the second write has reached the destination, experience a constant delay of up to 500 milliseconds, the "ACK delay". For this reason, TCP implementations usually provide applications with an interface to disable the Nagle algorithm. This is typically called the TCP_NODELAY option.
If possible an application should avoid consecutive small writes in the first place, so that Nagle's algorithm will not be triggered. The application should keep from sending small single writes and buffer up application writes then send (or with the help of writev() call).
"The user-level solution is to avoid write-write-read sequences on sockets. write-read-write-read is fine. write-write-write is fine. But write-write-read is a killer. So, if you can, buffer up your little writes to TCP and send them all at once. Using the standard UNIX I/O package and flushing write before each read usually works."
The tinygram problem and silly window syndrome are sometimes confused. The tinygram problem occurs when the window is almost empty. Silly window syndrome occurs when the window is almost full.
Negative Effect on Non Small Writes
The algorithm applies to data of any size. If the data in a single write spans 2n packets, the last packet will be withheld, waiting for the ACK for the previous packet. In any request-response application protocols where request data can be larger than a packet, this can artificially impose a few hundred milliseconds latency between the requester and the responder, even if the requester has properly buffered the request data. Nagle's algorithm must be disabled by the requester in this case. If the response data can be larger than a packet, the responder must also disable Nagle's algorithm so the requester can promptly receive the whole response.
In generally, since Nagle's algorithm is only a defense against careless applications, it will not benefit a carefully written application that takes proper care of buffering; the algorithm has either no effect, or negative effect on the application.
Interactions with real-time systems
Applications that expect real time responses can react poorly with Nagle's algorithm. Applications such as networked multiplayer video games expect that actions in the game are sent immediately, while the algorithm purposefully delays transmission, increasing bandwidth at the expense of latency. For this reason applications with low-bandwidth time-sensitive transmissions typically use TCP_NODELAY to bypass the Nagle delay.
- ^ Boosting Socket Performance on Linux - Slashdot
- ^ http://www.stuartcheshire.org/papers/NagleDelayedAck/
- ^ Bug 17868 – Some Java applications are slow on remote X connections
- Larry L. Peterson, Bruce S. Davie (2007). Computer Networks: A Systems Approach (4 ed.). Morgan Kaufmann. p. 402–403. ISBN 0123740134.
- Nagle's algorithm
- TCP Performance problems caused by interaction between Nagle's Algorithm and Delayed ACK
- Design issues - Sending small data segments over TCP with Winsock