Maximal Effective Bandwidth of Constrained Traffic

Abstract

We investigate the worst possible behavior of a stationary traffic source when the traffic emanating from it is required to meet certain constraints. Specifically, the peak rate of the source is required not to exceed a level ρ and realizations must obey a “leaky bucket” constraint with bucket size β and leak rate σ. The worst case source is considered to be the one with the largest effective bandwidth, a concept which arises in the large deviation theory of queueing networks and governs the asymptotic loss rate when a large number of sources send traffic to a single server queue. We conjecture the form of the worst case traffic in general and prove the conjecture for the special case when T, the time-scale parameter of the effective bandwidth, is less than both β/(ρ−σ) and β/σ, the times taken respectively to fill and empty the leaky bucket.