Overview 

Queue type (also known as a queuing discipline) refers to the policy by which various data packets are managed in a network queue.

This policy determines which packet to send next from the queue when a data transmission has been completed. The queue type impacts how the network handles data traffic, which in turn affects factors such as the distribution of bandwidth among different flows, latency, and the handling of congestion.

Queue types can be simple or complex, and different types have different strengths and weaknesses. For example, a First In, First Out (FIFO) queue is simple and ensures fairness in the order of packet processing, but it can lead to issues such as head-of-line blocking. More complex queue types, such as those that implement fair queuing or congestion avoidance, can help manage network performance more effectively, but they may require more resources and configuration.

Therefore, the choice of queue type depends on the specific needs and characteristics of the network.

Queue type introduction

  1. BFIFO (Byte-oriented First In, First Out):

  2. PFIFO (Packet-oriented First In, First Out):

  3. CAKE (Common Applications Kept Enhanced):

  4. CoDel (Controlled Delay):

  5. FQ_CoDel (Fair Queuing Controlled Delay):

  6. MQ_PFIFO (Multiqueue Packet First In, First Out):

  7. RED (Random Early Detection):

  8. SFQ (Stochastic Fairness Queuing):

In choosing a queue discipline, you'll need to consider the characteristics of your network and what you prioritize most, such as latency, fairness, simplicity, or congestion management.