Computer Science – Information Theory
Scientific paper
2006-03-22
Computer Science
Information Theory
6 pages (2 column, 10-point), 3 figures, 1 table
Scientific paper
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.
Gore Ashutosh Deepak
Karandikar Abhay
No associations
LandOfFree
Entropy-optimal Generalized Token Bucket Regulator does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Entropy-optimal Generalized Token Bucket Regulator, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Entropy-optimal Generalized Token Bucket Regulator will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-548428