![]() ![]() Nagle's algorithm works by combining a number of small outgoing messages and sending them all at once. Worse, over slow links, many such packets can be in transit at the same time, potentially leading to congestion collapse. This situation often occurs in Telnet sessions, where most keypresses generate a single byte of data that is transmitted immediately. 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. 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. ![]() It was published in 1984 as a Request for Comments (RFC) with title Congestion Control in IP/TCP Internetworks in RFC 896. It was defined by John Nagle while working for Ford Aerospace. 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. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |