Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Worst Case Traffic from Regulated Sources

Worst Case Traffic from Regulated Sources 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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Applied Mathematics and Optimization Springer Journals

Worst Case Traffic from Regulated Sources

Applied Mathematics and Optimization , Volume 48 (2) – Aug 1, 2003

Loading next page...
 
/lp/springer_journal/worst-case-traffic-from-regulated-sources-1Qf6uw0yyx

References (20)

Publisher
Springer Journals
Copyright
Copyright © 2003 by Springer-Verlag
Subject
Philosophy
ISSN
0095-4616
eISSN
1432-0606
DOI
10.1007/s00245-003-0774-6
Publisher site
See Article on Publisher Site

Abstract

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.

Journal

Applied Mathematics and OptimizationSpringer Journals

Published: Aug 1, 2003

There are no references for this article.