Queue lengths and workloads in polling systems

DOI10.1016/J.ORL.2011.10.006zbMATH Open1235.90043arXiv1106.0964OpenAlexW2136888963MaRDI QIDQ408416FDOQ408416

Authors: Onno Boxma, Offer Kella, K. M. Kosiński 

Publication date: 5 April 2012

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

Abstract: We consider a polling system: a queueing system of $Nge1$ queues with Poisson arrivals $Q_1,\mathrm{...},Q_N$ visited in a cyclic order (with or without switchover times) by a single server. For this system we derive the probability generating function $mathscrQ(cdot)$ of the joint queue length distribution at an arbitrary epoch in a stationary cycle, under no assumptions on service disciplines. We also derive the Laplace-Stieltjes transform $mathscrW(cdot)$ of the joint workload distribution at an arbitrary epoch. We express $mathscrQ$ and $mathscrW$ in the probability generating functions of the joint queue length distribution at visit beginnings, ${mathscrV}_{b_i}(cdot)$, and visit completions, ${mathscrV}_{c_i}(cdot)$, at $Q_i$, $i=1,\mathrm{...},N$. It is well known that ${mathscrV}_{b_i}$ and ${mathscrV}_{c_i}$ can be computed in a broad variety of cases. Furthermore, we establish a workload decomposition result.

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

Recommendations

• Queuing analysis of polling models
• Workload analysis of a two-queue fluid polling model
• Two queues with time-limited polling and workload-dependent service speeds
• The impact of scheduling policies on the waiting-time distributions in polling systems
• scientific article; zbMATH DE number 994725
• Expected waiting times in polling systems under priority disciplines
• A novel approach to queue stability analysis of polling models
• scientific article; zbMATH DE number 2134069
• Priority queuing systems with parameters dependent on queue length
• The analysis of batch sojourn-times in polling systems

zbMATH Keywords

queue lengthsteady-state distributionpolling system

Mathematics Subject Classification ID

Queues and service in operations research (90B22)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Distribution of the workload in multiclass queueing systems with server vacations
• Polling Models With and Without Switchover Times
• A STATE-DEPENDENT POLLING MODEL WITH k-LIMITED SERVICE
• Polling systems and multitype branching processes
• Mathematical methods to study the polling systems
• A queueing network with a single cyclically roving server
• Queues with Periodic Service and Changeover Time
• Pseudo-conservation laws in cyclic-service systems
• Title not available (Why is that?)

Cited In (13)

• Two queues with time-limited polling and workload-dependent service speeds
• Distribution of the workload in multiclass queueing systems with server vacations
• Polling: past, present, and perspective
• Analysis of tandem polling queues with finite buffers
• A decomposition result for a class of polling models
• Stochastic bounds for order flow times in parts-to-picker warehouses with remotely located order-picking workstations
• Performance analysis of polling systems with retrials and glue periods
• The analysis of batch sojourn-times in polling systems
• Queue-length balance equations in multiclass multiserver queues and their generalizations
• On two-queue Markovian polling systems with exhaustive service
• Decomposition results for stochastic storage processes and queues with alternating Lévy inputs
• Waiting times in queueing networks with a single shared server
• Analysis of polling models with a self-ruling server

This page was built for publication: Queue lengths and workloads in polling systems

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