Metraipolis › archive › dc_cf1a2eb75d7c

Nagle's algorithm — Wikipedia (en)

Source
Wikipedia (en)
Original
https://en.wikipedia.org/wiki/Nagle%27s_algorithm
License (as archived)
CC-BY-SA-4.0
Archived
2026-10-06T18:38:18.679Z
SHA-256 of the archived text
69cba107adac8dec0759f41ae9f20e31cf5c5c84b1a714bc0b3f767b6b63752b
Stable URL of this page
https://metraipolis.com/documento/dc_cf1a2eb75d7c

How to cite

Nagle's algorithm — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Nagle%27s_algorithm (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_cf1a2eb75d7c (Metraipolis archive dc_cf1a2eb75d7c, sha256 69cba107adac8dec0759f41ae9f20e31cf5c5c84b1a714bc0b3f767b6b63752b)
BibTeX
@misc{dccf1a2eb75d7c,
  title = {Nagle's algorithm — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Nagle%27s_algorithm},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_cf1a2eb75d7c; sha256 69cba107adac8dec0759f41ae9f20e31cf5c5c84b1a714bc0b3f767b6b63752b},
  year = {2026}
}

Archived text

Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Nagle%27s_algorithm. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Nagle's algorithm 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. It was defined by John Nagle while working for Ford Aerospace. It was published in 1984 as a Request for Comments (RFC) with title Congestion Control in IP/TCP Internetworks in RFC 896. The RFC describes what Nagle calls 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, thus allowing output to be sent all at once.

Tema degli esploratori: statistica e scienza dei dati (deposito sistematico; ricerca «algorithm»).
Fonte: Wikipedia in inglese, voce «Nagle's algorithm» — https://en.wikipedia.org/wiki/Nagle%27s_algorithm
Wikidata Q668945 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q668945
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Nagle%27s_algorithm?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1374353827, consultata il 2026-10-06T17:04:49.328Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: a71c8cb7d6af1e6fcda373ce2399dddb0c1c1ca1ab7901cc1ea51215d7026afa