V. Anantharam et T. Konstantopoulos, A methodology for the design of optimal traffic shapers in communication networks, IEEE AUTO C, 44(3), 1999, pp. 583-586
The authors consider the problem of optimally regulating the source traffic
in a communication network to simultaneously satisfy a finite number of af
fine burstiness constraints, They prove that an optimal solution is a serie
s connection of correspondingly dimensioned "leaky buckets," They propose a
simple "fork-join" implementation of the optimal solution and study extens
ions to the problem of optimally shaping the traffic flow to meet a burstin
ess constraint specified by a concave increasing function. A consequence of
their optimality results is that permutations of leaky buckets in a series
connection are input-output equivalent.