Entropy-optimal Generalized Token Bucket Regulator

Simple item page
dc.creatorGore, Ashutosh Deepak
dc.creatorKarandikar, Abhay
dc.date2006-03-22
dc.date.accessioned2026-07-07T08:16:26Z
dc.date.available2026-07-07T08:16:26Z
dc.descriptionWe 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.
dc.description6 pages (2 column, 10-point), 3 figures, 1 table
dc.identifierhttps://arxiv.org/abs/cs/0603083
dc.identifierhttp://arxiv.org/abs/cs/0603083
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/133779
dc.subjectInformation Theory
dc.titleEntropy-optimal Generalized Token Bucket Regulator
dc.typetext

Files

Collections

arXiv