Nagle's algorithm
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.
- Abstraction100002137
- Act100030358
- Activity100407535
- Algorithm105847438
- Communication100033020
- Direction106786629
- Event100029378
- Message106598915
- Procedure101023820
- Protocol106665108
- PsychologicalFeature100023100
- Rule105846932
- Rule106652242
- software
- WikicatAlgorithms
- WikicatNetworkingAlgorithms
- WikicatNetworkProtocols
- YagoPermanentlyLocatedEntity
- Comment
- enNagle'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.
- Has abstract
- enNagle'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 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, thus allowing output to be sent all at once.
- Hypernym
- Means
- Is primary topic of
- Nagle's algorithm
- Label
- enNagle's algorithm
- Link from a Wikipage to an external page
- searchnetworking.techtarget.com/sDefinition/0,,sid7_gci754347,00.html
- books.google.com/books%3Fid=fknMX18T40cC&q=Nagle%27s+algorithm&pg=PA402
- support.microsoft.com/kb/214397/en-us
- www.stuartcheshire.org/papers/NagleDelayedAck/
- www.extrahop.com/company/blog/2009/to-nagle-or-not-to-nagle-that-is-the-question/
- Link from a Wikipage to another Wikipage
- ACK (TCP)
- Bandwidth (computing)
- Byte
- Category:Networking algorithms
- Category:Transmission Control Protocol
- Congestion collapse
- Ford Aerospace
- IP
- IPv4
- Larry L. Peterson
- Latency (engineering)
- Maximum segment size
- Request for Comments
- Sliding window protocol
- TCP delayed acknowledgment
- Telnet
- Transmission Control Protocol
- User Datagram Protocol
- SameAs
- 4qtXv
- Algorithme de Nagle
- Algoritm de Nagle
- Algoritmo de Nagle
- Algoritmo de Nagle
- Algoritmo di Nagle
- Algorytm Nagle'a
- m.05t7gl
- Nagle's algorithm
- Nagle-Algorithmus
- Nagle algoritmoa
- Nagleアルゴリズム
- Q668945
- Алгоритм Нейгла
- האלגוריתם של נייגל
- الگوریتم نیگل
- 納格算法
- Subject
- Category:Networking algorithms
- Category:Transmission Control Protocol
- WasDerivedFrom
- Nagle's algorithm?oldid=1070523945&ns=0
- WikiPageLength
- 10343
- Wikipage page ID
- 1753169
- Wikipage revision ID
- 1070523945
- WikiPageUsesTemplate
- Template:Citation needed
- Template:Cite book
- Template:Code
- Template:IETF RFC
- Template:Ref improve
- Template:Reflist
- Template:Short description