Markovian Performance Model for Token Bucket Filter with Fixed and Varying Packet Sizes

TL;DR

This paper develops a detailed Markovian model for token bucket filters handling heterogeneous packet sizes, providing analytical backlog, delay, and loss metrics validated by simulations.

Contribution

It introduces a full state Markovian model for token bucket mechanisms with multiple packet size classes, extending previous fixed-size packet models.

Findings

Derived class-specific backlog, delay, and loss statistics

Provided upper bounds for model complexity

Validated analytical results with discrete event simulations

Abstract

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.