固定和变化包长令牌桶过滤器的马尔可夫性能模型
Markovian Performance Model for Token Bucket Filter with Fixed and Varying Packet Sizes
摘要:
我们认为令牌桶机制服务于异构流的积压,延迟和数据包丢失属性的重点。以前的模型已经考虑了固定大小的数据包的情况,即“每个数据包一个令牌”和排队行为的M/D/1视图。我们划分的异构流到几个数据包大小类与个人泊松到达强度。伴随的排队模型是“全状态”模型,即,缓冲区内容不被减少到单个量,而是包括在分组大小类方面的详细内容。这产生了一个高模型基数,提供了上限。分析结果包括类特定的积压,延迟和损失的统计数据,并伴随着离散事件模拟的结果。
英文摘要:
We consider a token bucket mechanism serving a heterogeneous flow with a focus on backlog, delay and packet loss properties. Previous models have considered the case for fixed size packets, i.e. "one token per packet" with and M/D/1 view on queuing behavior. We partition the heterogeneous flow into several packet size classes with individual Poisson arrival intensities. The accompanying queuing model is a "full state" model, i.e. buffer content is not reduced to a single quantity but encompasses the detailed content in terms of packet size classes. This yields a high model cardinality for which upper bounds are provided. Analytical results include class specific backlog, delay and loss statistics and are accompanied by results from discrete event simulation.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。