Taildrop algorithm

The Taildrop algorithm is a type of algorithm for a network scheduler for handling data packets in (Internet) routers .

functionality

The algorithm works roughly as follows: As long as there is still space in the receive buffer, incoming packets are written to it. If a packet can be forwarded to the recipient, it is deleted from the receive buffer. If there is no more space in the receive buffer, incoming packets are discarded.

Advantages and disadvantages

The advantage of this method is that it is easy to implement.

Disadvantages of the method are the high loss rates that occur suddenly when the maximum size of the buffer is reached in all connections running via this router, as well as the synchronization that ensues (all transmitters involved will try to send their packets again). The synchronization effect can increase the load on the router over a longer period of time.

A more complex method is random early detection .

literature

• Volker Jung, Hans-Jürgen Warnecke (Hrsg.): Handbook for telecommunications. Springer Verlag, Berlin / Heidelberg 1998, ISBN 978-3-642-97703-9 .

Web links

• Evaluation of the Congestion Control Algorithm CMT / RPv2 in an MPTCP environment in the Linux kernel (accessed on July 13, 2017)
• Performance & Analysis of REM, RED, & GREEN AQM Algorithms in Congestion Control (accessed July 13, 2017)
• Packet Handling (accessed July 13, 2017)