HTBQueue：OMNeT ++/ INET框架的分层令牌桶实现
HTBQueue: A Hierarchical Token Bucket Implementation for the OMNeT++/INET Framework
摘要：
分层令牌桶（HTB）算法允许指定每个流的比特率保证，并实现相同类别的流之间的额外带宽共享。此外，它提供了对特定流的流量进行优先级排序的能力，可能会考虑它们的延迟需求。因此，HTB构成了一个强大的机制，以分层方式和细粒度的每个流级别上强制执行QoS要求，使其成为许多用例中的适当选择。在本文中，我们提出了HTBQueue，我们的实现HTB支持离散事件模拟器OMNeT++的复合模块。我们验证HTBQueue的功能，竞争流之间的速率一致性和公平的带宽共享行为。我们还展示了它对流优先级的支持。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
