A recurrent solution of PH/M/c/N-like and PH/M/c-like queues

DOI10.1239/JAP/1331216835zbMATH Open1256.60031OpenAlexW2093681954MaRDI QIDQ5388741FDOQ5388741

Authors: Alexandre Brandwajn, Thomas Begin 

Publication date: 20 April 2012

Published in: Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://projecteuclid.org/euclid.jap/1331216835

Recommendations

• An algorithm for Ph/Ph/c queues
• Breaking the dimensionality curse in multi-server queues
• Calculation of the steady state waiting time distribution in GI/PH/\(c\) and MAP/PH/\(c\) queues
• Algorithms for the multi-server queue with phase type service
• ON the GI/M(n)/1/K queue-an alternative approach

zbMATH Keywords

phase-type distributionnumerical stabilitycomputational efficiencyconditional probabilityqueue length distributionrecurrent solution\(G/M/c\)-like queueasymptotic geometric distribution

Mathematics Subject Classification ID

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

Cited In (5)

• Explicit and Iterative Numerical Approaches to Solving Queueing Models
• Poisson's equation for the recurrent M/G/1 queue
• Title not available (Why is that?)
• Breaking the dimensionality curse in multi-server queues
• A fast simulation model based on Lindley's recursion for the G/G/1/K queue

Uses Software

• PhFit

This page was built for publication: A recurrent solution of \(PH/M/c/N\)-like and \(PH/M/c\)-like queues

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5388741)