Share Email Print

Proceedings Paper

Buffer overflow under self-similar packet traffic
Author(s): Boris Tsybakov; Nicolas D. Georganas
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

Actual measurements of high-speed traffic in communications networks argue convincingly that self-similar stochastic processes should model it. These measurements have also revealed that overall buffer packet loss decreases very slowly with increasing buffer size, in sharp contrast to traditional queuing theory models where losses decrease exponentially fast with increasing buffer size. In the paper, our problem is to analytically study overflow and loss probabilities in a queue with self-similar packet traffic and get the asymptotic lower bounds to them.

Paper Details

Date Published: 18 August 1999
PDF: 12 pages
Proc. SPIE 3841, Performance and Control of Network Systems III, (18 August 1999); doi: 10.1117/12.360369
Show Author Affiliations
Boris Tsybakov, Qualcomm Inc. (United States)
Nicolas D. Georganas, Univ. of Ottawa (Canada)

Published in SPIE Proceedings Vol. 3841:
Performance and Control of Network Systems III
Robert D. van der Mei; Daniel P. Heyman, Editor(s)

© SPIE. Terms of Use
Back to Top