scispace - formally typeset
Journal ArticleDOI

Duration of the buffer overflow period in a batch arrival queue

Andrzej Chydzinski
- 01 May 2006 - 
- Vol. 63, Iss: 4, pp 493-508
Reads0
Chats0
TLDR
Detailed studies of the buffer overflow period in a batch arrival queue are presented and theoretical results are illustrated via numerical examples.
About
This article is published in Performance Evaluation.The article was published on 2006-05-01. It has received 23 citations till now. The article focuses on the topics: Queue & Buffer overflow.

read more

Citations
More filters
Journal ArticleDOI

Queues with Dropping Functions and General Arrival Processes.

TL;DR: Analysis of the queueing system with the dropping function and a very general model of arrival process—the model which includes batch arrivals and the interarrival time autocorrelation, and allows for fitting the actual shape of the interArrival time distribution and its moments is carried out.
Journal ArticleDOI

On the loss process in a batch arrival queue

TL;DR: In this paper, the authors investigated the loss process in a finite buffer queue with batch arrivals and total rejection discipline and showed that if the buffer has insufficient capacity to accept all the customers included in an arriving batch, the whole batch is blocked and lost.
Journal ArticleDOI

Queues with Dropping Functions and Autocorrelated Arrivals

TL;DR: In this article, an analysis of the queueing system in which arriving jobs are dropped with probability depending on the queue size is presented, where the arrivals are assumed to be autocorrelated and they are modeled by the Markov-modulated Poisson process.
Journal ArticleDOI

Queuing Theory Based Service Performance Evaluation Under H2h And M2 M Blending Traffic Arriving

TL;DR: This paper models blending traffic and evaluates the service performance of M2 M and H2H services, and introduces two metrics, the bursty and the size of batch, to model different types of services mathematically.
Journal ArticleDOI

Buffer Overflow Period in a MAP Queue

TL;DR: The buffer overflow period in a queue with Markovian arrival process (MAP) and general service time distribution and the distribution of the number of cells lost during the overflow interval is investigated.
References
More filters
Book

The single server queue

TL;DR: In this paper, the basic models of queueing theory are described and a dual aim is to describe relevant mathematical techniques and to analyse the single server queue and its most important variants.
Journal ArticleDOI

The Single Server Queue.

Vincent Hodgson, +1 more
- 01 Sep 1972 - 
TL;DR: This classic work has a dual aim: to describe relevant mathematical techniques and to analyse the single server queue and its most important variants.
Journal ArticleDOI

Modeling IP traffic using the batch Markovian arrival process

TL;DR: This paper identifies the batch Markovian arrival process (BMAP) as an analytically tractable model of choice for aggregated traffic modeling of IP networks and identifies the expectation-maximization (EM) algorithm for efficient and numerical stable parameter estimation of the BMAP.
Book ChapterDOI

An Introduction to Numerical Transform Inversion and Its Application to Probability Models

TL;DR: Historically, transforms were exploited extensively for solving queueing and related probability models, but only rarely was numerical inversion attempted, and transforms became regarded more as mathematical toys than practical tools.
Journal ArticleDOI

Diffusion based statistical call admission control in ATM

TL;DR: Comparison with existing methods such as the Equivalent Bandwidths and Gaussian Approximations indicate that this approach remains conservative with respect to cell loss compared to previously proposed CAC schemes, yet that it is more economical in bandwidth allocation leading to larger admission regions both for homogeneous and heterogeneous traffic.
Related Papers (5)