A polynomial factorization approach to the discrete time GI/G/1/(N) queue size distribution

DOI10.1016/0166-5316(94)00024-EzbMath0875.68101OpenAlexW2024383041MaRDI QIDQ3122536

Gerhard Hasslinger

Publication date: 28 February 1997

Published in: Performance Evaluation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-5316(94)00024-e

zbMATH Keywords

Polynomial factorizationDiscrete time steady state analysisGI/G/1/(N) queue

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (5)

A numerical method to determine the waiting time and the idle time distributions of a GI/G/1 queue when inter-arrival times and/or service times have geometric tails ⋮ An analytical solution for the discrete time single server system with semi-Markovian arrivals ⋮ New approach for finding basic performance measures of single server queue ⋮ Polynomial Factorization for Servers with Semi-Markovian Workload: Performance and Numerical Aspects of a Verified Solution Technique ⋮ Point and interval estimation of decomposition error in discrete-time open tandem queues

This page was built for publication: A polynomial factorization approach to the discrete time GI/G/1/(N) queue size distribution