Optimal cost traffic shaping with self-similar input sources

We address the problem of determining the parameters of a traffic shaper modeled as a single server queue with finite buffer size and deterministic service rate. In our scheme, the user wishes to gain access to the network with cell loss probability guarantees when the input traffic is self-similar. We assume that the mean rate, the variance and the degree of self-similarity are known. The network is able to provide a connection if the user voluntarily shapes the traffic and if sufficient resources are available to accommodate the shaped traffic stream. We formulate a minimization problem to determine the optimal parameters for the traffic shaper and use techniques of non-linear programming to obtain a solution