Time-limited polling systems with batch arrivals and~phase-type service times

DOI10.1007/s10479-011-0846-yzbMath1259.90021OpenAlexW2110323780MaRDI QIDQ1761783

Ahmad Al Hanbali, Richard J. Boucherie, Roland de Haan

Publication date: 15 November 2012

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-011-0846-y

zbMATH Keywords

iterative schemeperformance analysispolling systemabsorbing Markov chainsautonomous server disciplinematrix analytic solutionphase-type service timesPoisson batch arrivalstime limited discipline

Mathematics Subject Classification ID

Queues and service in operations research (90B22)

Related Items

IMPROVING THE PERFORMANCE OF POLLING MODELS USING FORCED IDLE TIMES, Workload analysis of a two-queue fluid polling model, Analysis of queueing system with non-preemptive time limited service and impatient customers, Transient analysis for exponential time-limited polling models under the preemptive repeat random policy, Two queues with random time-limited polling, Approximations for the waiting-time distribution in an \(M/PH/c\) priority queue, An exact root-free method for the expected queue length for a class of discrete-time queueing systems, Analysis of polling models with a self-ruling server, Evaluating readmission rates and discharge planning by analyzing the length-of-stay of patients, DELAY IN A TANDEM QUEUEING MODEL WITH MOBILE QUEUES: AN ANALYTICAL APPROXIMATION, Approximations for the performance evaluation of a discrete-time two-class queue with an alternating service discipline

Uses Software

• MCQueue

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Dominance relations in polling systems
• Iterative approximation of \(k\)-limited polling systems
• A polling model with an autonomous server
• Queue length distributions from probability generating functions via discrete Fourier transforms
• Performance evaluation of polling systems by means of the power-series algorithm
• Numerical inversion of probability generating functions
• Monotonicity and stability of periodic polling models
• Polling systems and multitype branching processes
• An efficient two-stage iterative method for the steady-state analysis of Markov regenerative stochastic Petri net models
• Finite birth-and-death models in randomly changing environments
• QUEUE LENGTH DISTRIBUTION IN M/G/1, M^x/G/1 AND THEIR VARIANTS WITH COMPLETION TIME
• Numerical Methods in Markov Chain Modeling
• The Power-Series Algorithm for Polling Systems with Time Limits
• Polling under the randomly timed gated regime
• Transient characteristics of an M/M/∞ system
• Queueing Networks and Markov Chains
• Queues with Periodic Service and Changeover Time