Finite-buffer polling systems with threshold-based switching policy

DOI10.1007/S11750-015-0408-6zbMath1360.60163OpenAlexW2285809535MaRDI QIDQ518440

Uri Yechiali, Efrat Perel, Konstantin E. Avrachenkov

Publication date: 28 March 2017

Published in: Top (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/hal-01402886/file/FiniteBufferFinalVerKA.pdf

zbMATH Keywords

oscillationspolling systemscontinuous-time Markov chainthreshold policyfinite-buffer queues

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Continuous-time Markov processes on discrete state spaces (60J27) Applications of continuous-time Markov processes on discrete state spaces (60J28)

Related Items (7)

Polling: past, present, and perspective ⋮ Fluctuation analysis in queues with several operational modes and priority customers ⋮ Fluctuation analysis in parallel queues with hysteretic control ⋮ A Taylor series approach for service-coupled queueing systems with intermediate load ⋮ Strategic behaviour in a tandem queue with alternating server ⋮ A 2-class maintenance model with dynamic server behavior ⋮ The unobserved waiting customer approximation

Cites Work

• Unnamed Item
• Unnamed Item
• Controlling an oscillating Jackson-type network having state-dependent service rates
• Queues where customers of one queue act as servers of the other queue
• On the location of the eigenvalues of Jacobi matrices
• Dynamic server assignment in a two-queue model
• Inversion of a tridiagonal Jacobi matrix
• Routing in queues with delayed information
• Polling systems with zero switchover times: A heavy-traffic averaging principle
• On the optimal control of a two-queue polling model
• The Israeli Queue with Priorities
• ON CUSTOMERS ACTING AS SERVERS
• Solution of finite QBD processes
• Introduction to Matrix Analytic Methods in Stochastic Modeling
• Calculating the equilibrium distribution in level dependent quasi-birth-and-death processes
• A two-queue model with exhaustive and limited service disciplines

This page was built for publication: Finite-buffer polling systems with threshold-based switching policy