The Analysis of Random Polling Systems

DOI10.1287/OPRE.36.5.716MaRDI QIDQ3814523zbMATH OpenOpenAlexFDO

Authors Leonard Kleinrock, Hanoch Levy

Publication date 1988

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.36.5.716

zbMATH Keywords

expected response time in a random polling systeminfinite bufferrandom polling systemssingle serverswitchover time

Mathematics Subject Classification ID

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

Recommendations

• Queuing analysis of polling models
• Nondeterministic Polling Systems
• A new approach to analysis of polling systems
• scientific article; zbMATH DE number 845596
• scientific article; zbMATH DE number 19790

Cited in

(38)

• A stochastic recirculation system with random access
• A note on the complexity of Swartz's method for calculating the expected delay in non-symmetric cyclic polling systems
• Stability of token passing rings
• A queueing network with a single cyclically roving server
• Performance evaluation of polling systems by means of the power-series algorithm
• Single-server queues with spatially distributed arrivals
• Exact analysis of asymmetric random polling systems with single buffers and correlated input process
• Analysis of random polling system with an infinite number of coupled servers and correlated input process.
• Critical random walks on two-dimensional complexes with applications to polling systems
• Analysis of multiclass Markovian polling systems with feedback and composite scheduling algorithms
• Gated polling with stationary ergodic walking times, Markovian routing and random feedback
• Workloads and waiting times in single-server systems with multiple customer classes
• Scheduling policies using marked/phantom slot algorithms
• Dynamic vehicle routing: Status and prospects
• The archievable region method in the optimal control of queueing systems; formulations, bounds and policies
• Markovian polling systems with mixed service disciplines and retrial customers
• Fluid polling systems
• Polling systems and multitype branching processes
• The analysis of batch sojourn-times in polling systems
• Expected waiting time in symmetric polling systems with correlated walking times
• Belated analyses of three credit-based adaptive polling algorithms
• Cyclic Bernoulli polling
• Scheduling and order acceptance for the customised stochastic lot scheduling problem
• Analysis of polling systems with mixed service disciplines
• scientific article; zbMATH DE number 19790 (Why is no real title available?)
• Nondeterministic Polling Systems
• scientific article; zbMATH DE number 33202 (Why is no real title available?)
• Polling under the randomly timed gated regime
• scientific article; zbMATH DE number 1552339 (Why is no real title available?)
• On two-queue Markovian polling systems with exhaustive service
• Server waiting times in infinite supply polling systems with preparation times
• Admission policies for the customized stochastic lot scheduling problem with strict due-dates
• The individual station technique for the analysis of cyclic polling systems
• Analysis of the scheduling mechanism for virtualization of links with partial isolation
• Strategic behavior in a time-limited Markovian polling queue with service rate regeneration
• A new approach to analysis of polling systems
• Dominance relations in polling systems
• A discrete model of a large polling system

This page was built for publication: The Analysis of Random Polling Systems

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