Asymptotic analysis of loss probability in a finite queue where one packet occupies as many places as its length

Authors:
Bara Kim;Jeongsim Kim;In-Suk Wee;Bong Dae Choi
Affiliations:
Department of Mathematics and Telecommunication Mathematics Research Center, Korea University, 1 Anam-dong, Sungbuk-ku, Seoul 136-701, South Korea;Department of Mathematics and Telecommunication Mathematics Research Center, Korea University, 1 Anam-dong, Sungbuk-ku, Seoul 136-701, South Korea;Department of Mathematics and Telecommunication Mathematics Research Center, Korea University, 1 Anam-dong, Sungbuk-ku, Seoul 136-701, South Korea;Department of Mathematics and Telecommunication Mathematics Research Center, Korea University, 1 Anam-dong, Sungbuk-ku, Seoul 136-701, South Korea
Venue:
Performance Evaluation
Year:
2003

Citing 3
Cited 0

Asymptotic behaviour of the loss probability of the M/G/1/K and G/M/1/K queues

Queueing Systems: Theory and Applications
A finite buffer queue with priorities

Performance Evaluation
Asymptotic Behavior of Loss Probability in GI/M/1/K Queue as K Tends to Infinity

Queueing Systems: Theory and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider a discrete-time single server queue which models the input buffer of an IP switch/router. The packets arrive according to a batch Bernoulli process and the packet lengths (service times) are independent and identically distributed with a general distribution. We assume that the system has a finite buffer of size K. In contrast to ordinary queues where one packet occupies one place in the buffer, we assume that one packet occupies as many places as its length. We study an asymptotic behavior of the loss probability for this queueing system as the buffer size K tends to infinity, and then use this result to approximate the exact loss probability. Numerical examples show that the approximation is very accurate.