A discrete MAP/PH/1 queue with vacations and exhaustive time-limited service

DOI10.1016/0167-6377(95)00015-CzbMath0858.60090OpenAlexW1999878148WikidataQ127323644 ScholiaQ127323644MaRDI QIDQ1924623

Attahiru Sule Alfa

Publication date: 18 March 1997

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(95)00015-c

zbMATH Keywords

Markovian arrival processphase type distributionsmatrix-geometric methodvacation modelstime-limited servicediscrete queues

Mathematics Subject Classification ID

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

Related Items (11)

Analysis of finite buffer queue with state dependent service and correlated customer arrivals ⋮ Queue length analysis of a Markov-modulated vacation queue with dependent arrival and service processes and exhaustive service policy ⋮ Analyzing discrete-time \(\text{D}\)-\(\text{BMAP}/G/1/N\) queue with single and multiple vacations ⋮ Exploiting the Toeplitz structure in certain queueing problems ⋮ A Survey for Stochastic Decomposition in Vacation Queues ⋮ Algorithmic computation of \(MAP/PH/1\) queue with finite system capacity and two-stage vacations ⋮ The discrete-time \(MAP/PH/1\) queue with multiple working vacations ⋮ Mathematical analysis of queue with phase service: an overview ⋮ Level-crossing approach to a time-limited service system with two types of vacations ⋮ ANALYSIS OF A MULTI-SERVER QUEUE WITH MARKOVIAN ARRIVALS AND SYNCHRONOUS PHASE TYPE VACATIONS ⋮ Discrete time queues and matrix-analytic methods. (With comments and rejoinder)

Cites Work

• Queueing systems with vacations - a survey
• New results on the single server queue with a batch markovian arrival process
• Analysis of cyclic service systems with limited service: Bounds and approximations
• A versatile Markovian point process
• Modelling Vehicular Traffic Using the Discrete Time Markovian Arrival Process
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A discrete MAP/PH/1 queue with vacations and exhaustive time-limited service