Hostname: page-component-74656f9884-j7cmm Total loading time: 0 Render date: 2026-11-10T01:04:40.088Z Has data issue: false hasContentIssue false

Buffer overflow asymptotics for a buffer handling many traffic sources

Published online by Cambridge University Press:  14 July 2016

Costas Courcoubetis*
Affiliation:
University of Crete
Richard Weber*
Affiliation:
University of Cambridge
*
∗ Postal address: Department of Computer Science, University of Crete, P.O. Box 1470 Heraklion, 71110 Greece.
∗∗ Postal address: Statistical Laboratory, 16 Mill Lane, Cambridge CB2 1SB, UK.

Abstract

As a model for an ATM switch we consider the overflow frequency of a queue that is served at a constant rate and in which the arrival process is the superposition of N traffic streams. We consider an asymptotic as N → ∞ in which the service rate Nc and buffer size Nb also increase linearly in N. In this regime, the frequency of buffer overflow is approximately exp(–NI(c, b)), where I(c, b) is given by the solution to an optimization problem posed in terms of time-dependent logarithmic moment generating functions. Experimental results for Gaussian and Markov modulated fluid source models show that this asymptotic provides a better estimate of the frequency of buffer overflow than ones based on large buffer asymptotics.

Information

Type
Research Papers
Copyright
Copyright © Applied Probability Trust 1996 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable