The hierarchical token bucket (HTB) algorithm allows to specify per-flow bitrate guarantees and enables excess bandwidth sharing between flows of the same class. Additionally, it provides capabilities to prioritize the traffic of specific flows, potentially considering their delay demands. HTB hence constitutes a powerful mechanism to enforce QoS requirements hierarchically and on a fine granular per-flow level, making it an appropriate choice in numerous use-cases. In this paper, we present HTBQueue, our implementation of a compound module for HTB support in the discrete event simulator OMNeT++. We validate HTBQueue's functionality in terms of rate conformance and fair bandwidth sharing behavior between competing flows. We furthermore demonstrate its support for flow prioritization.

翻译：等级象征性桶(HTB)算法允许指定每流动比特拉特保证,并允许同一类流动之间的超宽带宽共享。此外,它提供了确定特定流动流量流量流量的优先顺序的能力,并有可能考虑到其延迟需求。因此,HTB构成一个强大的机制,可以按等级和细微的颗粒/流动水平执行QOS要求,从而在众多使用案例中作出适当的选择。在本文件中,我们介绍了HTBQueue,我们在离散事件模拟器 OMNET++ 中实施了HTB支持的复合模块。我们验证了HTBQue在竞合流动流量之间的比例一致性和公平带宽共享行为方面的功能。我们进一步展示了它对流动优先排序的支持。