...
Imagine a line at the post office. Each person (packet) waiting in line represents a data packet waiting in the queue. The first person in line gets served first, then the next, and so on. If the post office is too busy and the line is full, any new person arriving would have to wait or leave (the packet is dropped).
Conclusion:
...
Byte-Based: Unlike PFIFO, BFIFO calculates the queue size based on bytes, which allows for a more precise control of bandwidth usage.
Fairness: BFIFO also ensures fairness as it treats all packets equally, regardless of their source, destination, or content.
No Prioritization: Similar to PFIFO, there's no inherent capability in BFIFO to prioritize certain types of traffic over others.
...