Computing Loss Probabilities in Discrete-Time Queues | Zendy

Frank N. Gouweleeuw | Zendy; Henk Tijms | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Computing Loss Probabilities in Discrete-Time Queues

Author(s) -

Frank N. Gouweleeuw,

Henk Tijms

Publication year - 1998

Publication title -

operations research

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 3.797

H-Index - 140

eISSN - 1526-5463

pISSN - 0030-364X

DOI - 10.1287/opre.46.1.149

Subject(s) - queue , queueing theory , computer science , discrete time and continuous time , fork–join queue , state (computer science) , discrete event simulation , mathematics , queue management system , mathematical optimization , real time computing , algorithm , computer network , simulation , statistics

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research