The analysis of batch sojourn-times in polling systems

DOI10.1007/S11134-016-9513-YMaRDI QIDQ2397976zbMATHOpenAlexDBLPWikidataFDO

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

Publication date 14 August 2017

Published in Queueing Systems (Search for Journal in Brave)

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)

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.

Recommendations

• Polling with Batch Service
• POLLING SYSTEMS WITH SIMULTANEOUS BATCH ARRIVALS
• A class of cyclic queues with priority batch service
• Sojourn times in vacation and polling systems with Bernoulli feedback
• Waiting-time distributions in polling systems with simultaneous batch arrivals

Cites work

• scientific article; zbMATH DE number 3755546 (Why is no real title available?)
• A Proof for the Queuing Formula: L = λW
• A distributional form of Little's law
• Computing distributions and moments in polling models by numerical transform inversion
• Mean value analysis for polling systems
• On pseudo-conservation laws for the cyclic server system with compound Poisson arrivals
• POLLING SYSTEMS WITH SIMULTANEOUS BATCH ARRIVALS
• Poisson Arrivals See Time Averages
• Polling systems and multitype branching processes
• Queue lengths and workloads in polling systems
• Queues with Periodic Service and Changeover Time
• The Analysis of Random Polling Systems
• The impact of adding a make-to-order item to a make-to-stock production system
• The stochastic economic lot scheduling problem: a survey
• Waiting times in queueing networks with a single shared server
• Waiting-time distributions in polling systems with simultaneous batch arrivals
• Web server performance modeling

Cited in

(9)

• Polling with Batch Service
• Fluctuation analysis in parallel queues with hysteretic control
• Queue lengths and workloads in polling systems
• Polling: past, present, and perspective
• Polling systems with batch service
• A class of cyclic queues with priority batch service
• POLLING SYSTEMS WITH SIMULTANEOUS BATCH ARRIVALS
• Fluctuation analysis in queues with several operational modes and priority customers
• Time-limited polling systems with batch arrivals and~phase-type service times

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)