A single-server queue with batch arrivals and semi-Markov services

DOI10.1007/S11134-017-9531-4MaRDI QIDQ1696937zbMATH OpenOpenAlexWikidataFDO

Authors Peng Zhang

Publication date 15 February 2018

Published in Queueing Systems (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/1801.05998

zbMATH Keywords

\(M^X/G/1\) queuebatch arrivalscorrelated service timessemi-Markov service timesstationary and transient queue length analysis

Mathematics Subject Classification ID

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

Abstract: We investigate the transient and stationary queue-length distributions of a class of service systems with correlated service times. The classical $M^X/G/1$ queue with semi-Markov service times is the most prominent example in this class and serves as a vehicle to display our results. The sequence of service times is governed by a modulating process $J(t)$. The state of $J(cdot)$ at a service initiation time determines the joint distribution of the subsequent service duration and the state of $J(cdot)$ at the next service initiation. Several earlier works have imposed technical conditions, on the zeros of a matrix determinant arising in the analysis, that are required in the computation of the stationary queue length probabilities. The imposed conditions in several of these articles are difficult or impossible to verify. Without such assumptions, we determine both the transient and the steady-state joint distribution of the number of customers immediately after a departure and the state of the process $J(t)$ at the start of the next service. We numerically investigate how the mean queue length is affected by variability in the number of customers that arrive during a single service time. Our main observations here are that increasing variability may {em reduce} the mean queue length, and that the Markovian dependence of service times can lead to large queue lengths, even if the system is not in heavy traffic.

Recommendations

• scientific article; zbMATH DE number 3897987
• Single-server queue with Markov-dependent inter-arrival and service times
• Single-server queue with Markov-dependent inter-arrival and service times
• MR/GI/1 queues by positively correlated arrival stream
• The Queue M|G|1 with Markov Modulated Arrivals and Services

Cites work

• A comparison of queue disciplines when service orientation times occur
• A queue with poisson input and semi-Markov service times: busy period analysis
• Congestion analysis of unsignalized intersections: the impact of impatience and Markov platooning
• Departures from queues with changeover times
• scientific article; zbMATH DE number 3178071 (Why is no real title available?)
• scientific article; zbMATH DE number 3613367 (Why is no real title available?)
• scientific article; zbMATH DE number 3292535 (Why is no real title available?)
• scientific article; zbMATH DE number 3322728 (Why is no real title available?)
• Imbedded Markov Chain Analysis of a Waiting-Line Process in Continuous Time
• On a Preemptive Markovian Queue with Multiple Servers and Two Priority Classes
• Single-server queue with Markov-dependent inter-arrival and service times
• Some explicit formulas for the steady-state behavior of the queue with semi-Markovian service times
• The M/G/1 queue with several types of customers and change-over times
• The queue GI/M/s with customers of different types or the queue GI/H_m/s
• The queueing system M^X/G/1 and its ramifications
• The single server queue with Poisson input and semi-Markov service times
• The single server semi-Markov queue
• Time dependence of queues with semi-Markovian services

Cited in

(12)

• The single server semi-Markov queue
• A Markovian single server with upstream job and downstream demand arrival stream
• A note on varying the number of states in the arrival process of MR/GI/1 queue
• Analysis of a single server queue with semi-Markovian service interruption
• Computation of the moments of queue length in the $BMAP \slash SM \slash 1$ queue
• Analysis of a single server queue with interdependence of arrival and service processes -- a semi-Markov approach
• Queue length in a queuing system with dependent service times
• Generalized gap acceptance models for unsignalized intersections
• A \(BMAP/BMSP/1\) queue with Markov dependent arrival and Markov dependent service batches
• scientific article; zbMATH DE number 3897987 (Why is no real title available?)
• scientific article; zbMATH DE number 3934735 (Why is no real title available?)
• Single-server queue with Markov-dependent inter-arrival and service times

This page was built for publication: A single-server queue with batch arrivals and semi-Markov services

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