Computing Loss Probabilities in Discrete-Time Queues

Frank N. Gouweleeuw and Henk C. Tijms
Additional contact information
Frank N. Gouweleeuw: Vrije Universiteit, Amsterdam, The Netherlands
Henk C. Tijms: Vrije Universiteit, Amsterdam, The Netherlands

Operations Research, 1998, vol. 46, issue 1, 149-154

Abstract: Discrete-time queueing systems are frequently encountered in telecommunication networks. These systems usually involve finite buffers. The purpose of this paper is to present a generally applicable method to compute the loss probability in discrete-time finite-buffer queues by using only the state probabilities in the corresponding infinite-buffer queue.

Keywords: Queues; approximations; loss probability in discrete-time (search for similar items in EconPapers)
Date: 1998
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.46.1.149 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:46:y:1998:i:1:p:149-154

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().