Entropy-optimal Generalized Token Bucket Regulator
Information Theory
2007-07-13 v1 math.IT
Abstract
We derive the maximum entropy of a flow (information utility) which conforms to traffic constraints imposed by a generalized token bucket regulator, by taking into account the covert information present in the randomness of packet lengths. Under equality constraints of aggregate tokens and aggregate bucket depth, a generalized token bucket regulator can achieve higher information utility than a standard token bucket regulator. The optimal generalized token bucket regulator has a near-uniform bucket depth sequence and a decreasing token increment sequence.
Keywords
Cite
@article{arxiv.cs/0603083,
title = {Entropy-optimal Generalized Token Bucket Regulator},
author = {Ashutosh Deepak Gore and Abhay Karandikar},
journal= {arXiv preprint arXiv:cs/0603083},
year = {2007}
}
Comments
6 pages (2 column, 10-point), 3 figures, 1 table