Talk:Nagle's algorithm: Difference between revisions

Content deleted Content added
Divinity76 (talk | contribs)
Divinity76 (talk | contribs)
Line 33:
 
Can Nagle's Algorithm handle packets of total length >65535? (cause it would be easy to support in theory, eg, if a packet is exactly 65535 then FFFF ~data~ 0000 , or if a packet is >65535 then (for 65536): FFFF ~data1~ 01 00 ~data2~~ , which could continue forever until a non-FFFF is reached or until 0000 is reached, but im just theorizing, i don't know how it _ACTUALLY_ works :o ) [[User:Divinity76|Divinity76]] ([[User talk:Divinity76|talk]]) 00:50, 8 February 2015 (UTC)
UPDATE:
answer from John Nagle himself: The maximum possible length for an IP datagram is 65535 bytes, because the size field in the IP header, for both IPv4 and IPv6, is only 16 bits. John Nagle (talk) 06:52, 8 February 2015 (UTC) (src: https://en.wikipedia.org/wiki/User_talk:Nagle#.22Nagle.27s_Algorith.22.2C_can_it_handle_length.3E65535.3F )
[[User:Divinity76|Divinity76]] ([[User talk:Divinity76|talk]]) 03:54, 9 February 2015 (UTC)