A polling model with threshold switching

DOI10.1007/S11134-025-09954-1MaRDI QIDQ6898544zbMATH OpenFDO

Authors Onno Boxma, David Perry, Rachel Ravid, Uri Yechiali

Publication date 17 November 2025

Published in Queueing Systems (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S11134-025-09954-1

zbMATH Keywords

busy periodpolling modelqueueing theorysojourn timethreshold switching policy

Mathematics Subject Classification ID

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

Cites work

• A two-queue model with exhaustive and limited service disciplines
• Dynamic priority rules for cyclic-type queues
• Dynamic server assignment in a two-queue model
• Finite-buffer polling systems with threshold-based switching policy
• scientific article; zbMATH DE number 3823138 (Why is no real title available?)
• scientific article; zbMATH DE number 3755546 (Why is no real title available?)
• scientific article; zbMATH DE number 49989 (Why is no real title available?)
• scientific article; zbMATH DE number 836618 (Why is no real title available?)
• On the optimal control of a two-queue polling model
• Performance evaluation of computer and communication systems. Joint tutorial papers of performance '93 and Sigmetrics '93
• Polling: past, present, and perspective
• Priority queues
• Two-queue polling systems with switching policy based on the queue that is not being served

This page was built for publication: A polling model with threshold switching

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