Premium
Theory and numerical solution of a discrete queueing problem
Author(s) -
Ponstein J.
Publication year - 1974
Publication title -
statistica neerlandica
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.52
H-Index - 39
eISSN - 1467-9574
pISSN - 0039-0402
DOI - 10.1111/j.1467-9574.1974.tb00745.x
Subject(s) - generalization , queueing theory , mathematics , layered queueing network , quadratic equation , queueing system , bulk queue , discrete time and continuous time , probability generating function , state (computer science) , mathematical optimization , probability distribution , mathematical analysis , algorithm , statistics , probability mass function , geometry
A queueing problem is considered with one server, independent discrete inter‐arrival times, and independent discrete service times. The steady state distribution of the waiting time is approximated by means of the solution of certain linear equations and applying a generalization of the L in ‐B airstow method for finding quadratic factors of polynomials.