John Nagle is a networking engineer who defined Nagle's algorithm while working for Ford Aerospace. He published it in 1984 as RFC 896, titled Congestion Control in IP/TCP Internetworks, where he described the small-packet problem: an application repeatedly sends data in small chunks, often a single byte, so that the 40 bytes of TCP and IPv4 headers outweigh the useful data, and many such packets in transit can lead to congestion collapse. His algorithm combines a number of small outgoing messages and sends them all at once. In 1985 he also coined the term fair queuing, while proposing round-robin scheduling in the gateway between a local area network and the internet to reduce network disruption from badly behaving hosts.
Facts
Contribution Kind Connections
In Field
Source Nagle's algorithm (Wikipedia)
Sources
1. John Nagle (Wikipedia)
2. Fair queuing (Wikipedia)
Lead, coining of the termQuote, Lead, coining of the term
The term fair queuing was coined by John Nagle in 1985 while proposing round-robin scheduling in the gateway between a local area network and the internet to reduce network disruption from badly-behaving hosts.
View the Source Nagle's algorithm (Wikipedia)
In Group: Internet Protocols and Routing, Lead, definition
It was defined by John Nagle while working for Ford Aerospace.
In Field: Computer Networking, Lead, TCP/IP efficiency
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.
View the SourceReader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.