Loss probability in an overloaded discrete-time GI/G/1/K system with very large K

Authors:
Attahiru Sule Alfa
Affiliations:
Department of Electrical and Computer Engineering, University of Manitoba, Winnipeg, Manitoba, Canada R3T 5V6
Venue:
Operations Research Letters
Year:
2004

Citing 3
Cited 0

Computing Loss Probabilities in Discrete-Time Queues

Operations Research
Markov chain representations of discrete distributions applied to queueing models

Computers and Operations Research
The loss probability in an overloaded queue using the dual queue

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a simple semi-explicit formula for estimating the loss probability in a discrete-time GI/G/1/K system (with large K) which is operating under an overload condition. The method relaxes the lower boundary and then studies the upper boundary only. The idea is extended to the GI^X/G/1/K system.