Two finite-difference methods for solving MAP(t)/PH(t)/1/K queueing models

DOI10.1023/A:1019101828857MaRDI QIDQ1383328zbMATH OpenOpenAlexFDO

Authors Darryl Wayne Dormuth, Attahiru Sule Alfa

Publication date 13 April 1998

Published in Queueing Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1019101828857

zbMATH Keywords

finite-differenceMarkov arrival processphase-type distributiontime-varying queueing parameterstransient solutionsuniformization methodwaiting time distribution

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Recommendations

• A numerically efficient method for the \(MAP/D/1/K\) queue via rational approximations
• scientific article; zbMATH DE number 431650
• Explicit and Iterative Numerical Approaches to Solving Queueing Models
• The transient solution of time-dependent M/M/1 queues

This page was built for publication: Two finite-difference methods for solving \(MAP(t)/PH(t)/1/K\) queueing models

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