Analysis of finite-capacity polling systems

DOI10.2307/1427754MaRDI QIDQ3361682zbMATH OpenOpenAlexFDO

Authors Hideaki Takagi

Publication date 1991

Published in Advances in Applied Probability (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/1427754

zbMATH Keywords

exhaustive servicegated servicelimited servicedistribution of vacation periodsfinite-capacity polling system

Mathematics Subject Classification ID

Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25)

Recommendations

• Blocking probability, throughput and waiting time in finite capacity polling systems
• A new approach to analysis of polling systems
• scientific article; zbMATH DE number 4151581
• Gated–type polling systems with walking and switch-in times
• Transient analysis for exponential time-limited polling models under the preemptive repeat random policy

Cited in

(18)

• scientific article; zbMATH DE number 4151581 (Why is no real title available?)
• Admission policies for the customized stochastic lot scheduling problem with strict due-dates
• Ordinal optimization of \(G/G/1/K\) polling systems with \(k\)-limited service discipline
• Gated–type polling systems with walking and switch-in times
• Finite buffer polling models with routing
• A two-stage approach in solving the state probabilities of the multi-queue \(M/G/1\) model
• Blocking probability, throughput and waiting time in finite capacity polling systems
• Performance evaluation of a single-stage two-product manufacturing system operating under pull-type control
• scientific article; zbMATH DE number 19790 (Why is no real title available?)
• The polling system with a stopping server
• HEAVY-TRAFFIC ANALYSIS OF K-LIMITED POLLING SYSTEMS
• Scheduling and order acceptance for the customised stochastic lot scheduling problem
• Exact analysis of asymmetric random polling systems with single buffers and correlated input process
• Transient analysis for exponential time-limited polling models under the preemptive repeat random policy
• Analysis of alternating-priority queueing models with (cross) correlated switchover times
• The impact of scheduling policies on the waiting-time distributions in polling systems
• Analysis of the scheduling mechanism for virtualization of links with partial isolation
• Finite-buffer polling systems with threshold-based switching policy

This page was built for publication: Analysis of finite-capacity polling systems

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