On the overflow probability of deterministically constrained traffic (original) (raw)

Proceedings of ICC'97 - International Conference on Communications

Abstract

In this paper we upper-bound the overflow probability of superpositions of off-line, e.g., stored video and real-time traffic streams based on deterministic traffic descriptors, e.g., leaky buckets. In the off-line scenario, we compute the empirical envelope function of the cumulative arrivals of a given traffic stream and use this envelope to bound the overflow probability for multiplexing N such streams at a single node. In the real-time scenario, we assume the traffic is policed by a dual leaky bucket and use the parameters of the device to give an upper bound for overflow probability without referring to the traffic statistics

Gustavo de Veciana hasn't uploaded this paper.

Let Gustavo know you want this paper to be uploaded.

Ask for this paper to be uploaded.