Buffer overflow under self-similar packet traffic

Boris Tsybakov; Nicolas D. Georganas

doi:10.1117/12.360369

18 August 1999 Buffer overflow under self-similar packet traffic

Boris Tsybakov, Nicolas D. Georganas

Proceedings Volume 3841, Performance and Control of Network Systems III; (1999) https://doi.org/10.1117/12.360369
Event: Photonics East '99, 1999, Boston, MA, United States

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.

Citation Download Citation

Boris Tsybakov and Nicolas D. Georganas "Buffer overflow under self-similar packet traffic", Proc. SPIE 3841, Performance and Control of Network Systems III, (18 August 1999); https://doi.org/10.1117/12.360369

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available