Worst Case Traffic from Regulated Sources
- INRIA/ENS-Lyon, LIP, 46 Allee d'Italie, 69364 Lyon Cedex 07 (France)
We address the problem of finding the worst possible traffic a user of a telecommunications network can send. We take 'worst' to mean having the highest effective bandwidth, a concept that arises in the Large Deviation theory of queueing networks. The traffic is assumed to be stationary and to satisfy 'leaky bucket' constraints, which represent the a priori knowledge the network operator has concerning the traffic. Firstly, we show that this optimization problem may be reduced to an optimization over periodic traffic sources. Then, using convexity methods, we show that the realizations of a worst case source must have the following properties: at each instant the transmission rate must be either zero, the peak rate, or the leaky bucket rate; it may only be the latter when the leaky bucket is empty or full; each burst of activity must either start with the leaky bucket empty or end with it full.
- OSTI ID:
- 21067467
- Journal Information:
- Applied Mathematics and Optimization, Journal Name: Applied Mathematics and Optimization Journal Issue: 2 Vol. 48; ISSN 0095-4616
- Country of Publication:
- United States
- Language:
- English
Similar Records
Delay-Based Traffic Signal Control for Throughput Optimality and Fairness at an Isolated Intersection
Performance analysis of ATM ABR service under self-similar traffic in the presence of background VBR traffic