Discrete time analysis of MAP/PH/1 vacation queue with gated time-limited service

DOI10.1023/A:1019123828374zbMath0918.60077OpenAlexW63900116MaRDI QIDQ1275377

Attahiru Sule Alfa

Publication date: 23 March 1999

Published in: Queueing Systems (Search for Journal in Brave)

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

zbMATH Keywords

vacation modelMarkovian arrival processphase type distributiondiscrete queueMAP/PH/1 queue

Mathematics Subject Classification ID

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

Related Items (7)

Performance and cost analysis of a Geom/G/1 (G, SV) system ⋮ WAITING TIME OF M/D^1,∞/1 QUEUE ⋮ Queue length analysis of a Markov-modulated vacation queue with dependent arrival and service processes and exhaustive service policy ⋮ Algorithmic computation of \(MAP/PH/1\) queue with finite system capacity and two-stage vacations ⋮ Efficient computational analysis of non-exhaustive service vacation queues: \(BMAP/R/1/N(\infty)\) under gated-limited discipline ⋮ Analysis of BMAP∕R∕1 Queues Under Gated-Limited Service with the Server’s Single Vacation Policy ⋮ Discrete time queues and matrix-analytic methods. (With comments and rejoinder)

This page was built for publication: Discrete time analysis of MAP/PH/1 vacation queue with gated time-limited service