Partially Filled Segments or Long Gaps Between Sends
In order to maximize network utilization, TCP employs several algorithms that work towards filling the network with the most amount of data, using the least amount of segments. Among these mechanisms are the Nagle algorithm (as discussed in Section 7.1.6.5), the silly window avoidance algorithm (as discussed in Section 7.1.6.4), and delayed acknowledgments (as discussed in Section 7.1.7.5). However, sometimes these mechanisms can actually trigger delays on a virtual circuit, rather than preventing them.
Get Internet Core Protocols: The Definitive Guide now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
