The analysis of batch sojourn-times in polling systems

DOI10.1007/S11134-016-9513-YzbMATH Open1370.60184DBLPjournals/questa/GaastAK17arXiv1607.03345OpenAlexW2467698344WikidataQ59518360 ScholiaQ59518360MaRDI QIDQ2397976FDOQ2397976

Jelmer P. van der Gaast, Ivo Adan, René De Koster

Publication date: 14 August 2017

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

Abstract: We consider a cyclic polling system with general service times, general switch-over times, and simultaneous batch arrivals. This means that at an arrival epoch, a batch of customers may arrive simultaneously at the different queues of the system. For the locally-gated, globally-gated, and exhaustive service disciplines, we study the batch sojourn-time, which is defined as the time from an arrival epoch until service completion of the last customer in the batch. We obtain for the different service disciplines exact expressions for the Laplace-Stieltjes transform of the steady-state batch sojourn-time distribution, which can be used to determine the moments of the batch sojourn-time, and in particular, its mean. However, we also provide an alternative, more efficient way to determine the mean batch sojourn-time, using Mean Value Analysis. Finally, we compare the batch sojourn-times for the different service disciplines in several numerical examples. Our results show that the best performing service discipline, in terms of minimizing the batch sojourn-time, depends on system characteristics.

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

zbMATH Keywords

queueing modelspolling modelsmean value analysisbatch sojourn-times

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites Work

• Title not available (Why is that?)
• Poisson Arrivals See Time Averages
• The Impact of Adding a Make-to-Order Item to a Make-to-Stock Production System
• A Proof for the Queuing Formula: L = λW
• The stochastic economic lot scheduling problem: a survey
• Polling systems and multitype branching processes
• Queue lengths and workloads in polling systems
• A distributional form of Little's law
• Waiting times in queueing networks with a single shared server
• Queues with Periodic Service and Changeover Time
• Waiting-time distributions in polling systems with simultaneous batch arrivals
• The Analysis of Random Polling Systems
• Web server performance modeling
• Mean value analysis for polling systems
• On pseudo-conservation laws for the cyclic server system with compound Poisson arrivals
• Computing distributions and moments in polling models by numerical transform inversion
• POLLING SYSTEMS WITH SIMULTANEOUS BATCH ARRIVALS

Cited In (6)

• Polling: past, present, and perspective
• Queue lengths and workloads in polling systems
• Fluctuation analysis in queues with several operational modes and priority customers
• Fluctuation analysis in parallel queues with hysteretic control
• POLLING SYSTEMS WITH SIMULTANEOUS BATCH ARRIVALS
• A class of cyclic queues with priority batch service

This page was built for publication: The analysis of batch sojourn-times in polling systems

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