On two-queue Markovian polling systems with exhaustive service

DOI10.1007/S11134-014-9413-YMaRDI QIDQ475140zbMATH OpenOpenAlexFDO

Authors Jan-Pieter L. Dorsman, R. D. van der Mei, Onno Boxma

Publication date 25 November 2014

Published in Queueing Systems (Search for Journal in Brave)

Full work available at URL https://ir.cwi.nl/pub/22686

zbMATH Keywords

queue length distributiondiscrete-time Markov chainheavy-traffic behaviourtwo-queue Markovian polling systemswaiting-time distribution

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) 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)

Recommendations

• Two queues with random time-limited polling
• scientific article; zbMATH DE number 4151581
• Heavy-traffic limits for polling models with exhaustive service and non-FCFS service order policies
• Distribution of the delay in polling systems in heavy traffic
• Polling systems with periodic server routeing in heavy traffic: distribution of the delay

Cites work

• scientific article; zbMATH DE number 3868389 (Why is no real title available?)
• scientific article; zbMATH DE number 3410334 (Why is no real title available?)
• A new method for deriving waiting-time approximations in polling systems with renewal arrivals
• AN EXAMPLE IN THE THEORY OF THE SPECTRUM OF A FUNCTION
• Distribution of the delay in polling systems in heavy traffic
• HEAVY-TRAFFIC ANALYSIS OF K-LIMITED POLLING SYSTEMS
• Mathematical methods to study the polling systems
• NUMERICAL TRANSFORM INVERSION USING GAUSSIAN QUADRATURE
• Nondeterministic Polling Systems
• Numerical Inversion of Laplace Transforms of Probability Distributions
• Numerical inversion of probability generating functions
• Polling systems and multitype branching processes
• Polling systems in heavy traffic: a Bessel process limit
• Polling systems with periodic server routeing in heavy traffic: distribution of the delay
• Polling systems with zero switchover times: A heavy-traffic averaging principle
• Queue lengths and workloads in polling systems
• The Analysis of Random Polling Systems
• The distributional form of Little's law and the Fuhrmann-Cooper decomposition
• Towards a unifying theory on branching-type polling systems in heavy traffic
• Waiting times in a two-queue model with exhaustive and Bernoulli service

Cited in

(6)

• A Two‐Queue Polling Model with Regularly Varying Service and/or Switchover Times
• Two-queue polling models with a patient server
• On competitive analysis for polling systems
• Equilibrium balking strategies in renewal input queue with Bernoulli-schedule controlled vacation and vacation interruption
• Waiting times in a two-queue model with exhaustive and Bernoulli service
• On two-level state-dependent routing polling systems with mixed service

This page was built for publication: On two-queue Markovian polling systems with exhaustive service

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