OPTIMAL FLOW-CONTROL SCHEMES THAT REGULATE THE BURSTINESS OF TRAFFIC

The problem of designing burst reducing how controllers for traffic in an ATM network is studied. By requiring that the output how obey cert ain burstiness constraints, it is shown that an optimal design exists and that it can be easily implemented in real time, Two versions of th e problem are considered, The first one places constraints on the buff er size and the second one on the maximum delay that a cell can experi ence. Both problems are solved for arbitrary traffic processes. To tre at the problems in this generality we introduce reflection mappings an d use them, in a rather novel way, to establish optimality results, As a by-product of our analysis and methods, the optimality of the popul ar leaky bucket flow control scheme is also established.