Shape-controlled traffic patterns that maximize overflow probabilities in high-speed networks

George Kesidis, Takis Konstantopoulos

Research output: Contribution to journalConference articlepeer-review

1 Scopus citations


We consider the problem of allocation of network resources for a Variable Bit Rate connection requiring a probabilistic bound on cell delay. We only make the standard assumption that the connection has a deterministically controlled shape as specified by a (σ, ρ) constraint, simultaneously with a (0, π) (or peak-rate) constraint. This paper settles one instance of this open problem raised by Doshi which is motivated by the need to obtain worst-case probabilistic bounds, and is particularly applicable to situations where no statistical descriptors of network traffic are available. In other words, instead of an approach based on traffic modeling and effective bandwidths, we describe an approach using `worst-case' bounds assuming only these deterministic constraints. In particular, we describe that traffic pattern (among all stationary-ergodic and deterministically constrained arrival processes) which maximizes the `overflow probability' P(Q0>b), for a given buffer level b, where {Qt} is the buffer occupancy process, in steady-state, when the service rate is some constant c between ρ and π. This result could be used for resource provisioning of connections or for performance evaluation of network devices.

Original languageEnglish (US)
Pages (from-to)545-550
Number of pages6
JournalProceedings of the IEEE Conference on Decision and Control
StatePublished - 1998
EventProceedings of the 1998 37th IEEE Conference on Decision and Control (CDC) - Tampa, FL, USA
Duration: Dec 16 1998Dec 18 1998

All Science Journal Classification (ASJC) codes

  • Control and Systems Engineering
  • Modeling and Simulation
  • Control and Optimization


Dive into the research topics of 'Shape-controlled traffic patterns that maximize overflow probabilities in high-speed networks'. Together they form a unique fingerprint.

Cite this