Head-of-line blocking

Performance limiting phenomenon in computer networks
Head of line blocking (HOL blocking) in computer networking is a performance limiting phenomenon that occurs when a queue of packets is held up by the first packet in the queue. This occurs, for example, in input buffered network switches, out of order delivery and multiple requests in HTTP pipelining.

A switch may be composed of buffered input ports, a switch fabric and buffered output ports. If first in first out (FIFO) input buffers are used, only the oldest packet is available for forwarding. If the oldest packet cannot be transmitted due to its target output being busy, then more recent arrivals cannot be forwarded. The output may be busy if there is output contention. Without HOL blocking, the new arrivals could potentially be forwarded around the stuck oldest packet to their respective destinations. HOL blocking can produce performance degrading effects in input buffered systems. This phenomenon limits the throughput of switches. For FIFO input buffers, a simple model of fixed sized cells to uniformly distributed destinations, causes the throughput to be limited to 58.6% of the total as the number of links becomes large. One way to overcome this limitation is by using virtual output queues. Only switches with input buffering can suffer HOL blocking. With sufficient internal bandwidth, input buffering is unnecessary; all buffering is handled at outputs and HOL blocking is avoided. This no input buffering architecture is common in small to medium sized ethernet switches.

Out of order delivery occurs when sequenced packets arrive out of order. This may happen due to different paths taken by the packets or from packets being dropped and resent. HOL blocking can significantly increase packet reordering. Reliably broadcasting messages across a lossy network among a large number of peers is a difficult problem. While atomic broadcast algorithms solve the single point of failure problem of centralized servers, those algorithms introduce a head of line blocking problem. The Bimodal Multicast algorithm, a randomized algorithm that uses a gossip protocol, avoids head of line blocking by allowing some messages to be received out of order.

One form of HOL blocking in HTTP/1.1 is when the number of allowed parallel requests in the browser is used up, and subsequent requests need to wait for the former ones to complete. HTTP/2 addresses this issue through request multiplexing, which eliminates HOL blocking at the application layer, but HOL still exists at the transport (TCP) layer.

Head of line blocking can occur in reliable byte streams: if packets are reordered or lost and need to be retransmitted (and thus arrive out of order), data from sequentially later parts of the stream may be received before sequentially earlier parts of the stream; however, the later data cannot typically be used until the earlier data has been received, incurring network latency. If multiple independent higher level messages are encapsulated and multiplexed onto a single reliable byte stream, then head of line blocking can cause processing of a fully received message that was sent later to wait for delivery of a message that was sent earlier. This affects, for example, HTTP/2, which frames multiple request–response pairs onto a single stream; HTTP/3, which has an application layer framing design and uses datagram rather than stream transport, avoids this problem. The latency degradation from head of line blocking depends on the underlying packet loss rate and round trip time, with higher losses producing worse latency. Without changing the stream abstraction, reducing packet loss can reduce the harm from head of line blocking; an alternative is to implement the reliable byte stream using forward error correction to send redundant data so that a certain amount of loss can be tolerated without incurring retransmissions.