Blocking probability, throughput and waiting time in finite capacity polling systems

DOI10.1007/BF01158875zbMath0802.90047OpenAlexW2076587414MaRDI QIDQ1319850

Daniel Kofman

Publication date: 19 April 1994

Published in: Queueing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01158875

zbMATH Keywords

server vacationpolling systemsPoisson arrivalsfinite capacity buffers

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Queues and service in operations research (90B22) Applications of Markov renewal processes (reliability, queueing networks, etc.) (60K20)

Related Items (1)

Performance evaluation of a single-stage two-product manufacturing system operating under pull-type control

Uses Software

• Maple

Cites Work

• Unnamed Item
• Queueing systems with vacations - a survey
• Analysis of finite-capacity polling systems
• Queuing analysis of polling models
• Performance analysis of finite capacity polling systems with nonexhaustive service
• M/G/1/N Queue with vacation time and limited service discipline
• M/G/1/N Queue with Vacation Time and Exhaustive Service Discipline

This page was built for publication: Blocking probability, throughput and waiting time in finite capacity polling systems