A polynomial factorization approach for the discrete time \(\text{GI}^X/ \text{G}/1/K\) queue

DOI10.1023/B:MCAP.0000026560.42106.7AzbMath1050.60088OpenAlexW1987553604MaRDI QIDQ596513

Pinai Linwong, Nei Kato, Yoshiaki Nemoto

Publication date: 10 August 2004

Published in: Methodology and Computing in Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/b:mcap.0000026560.42106.7a

zbMATH Keywords

queue length distributionroot finding algorithmdiscrete time GI\(^X/\)G\(/1/K\)

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

This page was built for publication: A polynomial factorization approach for the discrete time \(\text{GI}^X/ \text{G}/1/K\) queue