Analysis of tandem polling queues with finite buffers
From MaRDI portal
(Redirected from Publication:2212282)
Recommendations
- Approximate analysis of single-server tandem queues with finite buffers
- Performance analysis of Markovian polling systems with single buffers
- Blocking probability, throughput and waiting time in finite capacity polling systems
- Queuing analysis of polling models
- Finite buffer polling models with routing
Cites work
- scientific article; zbMATH DE number 3736680 (Why is no real title available?)
- A note on polling models with renewal arrivals and nonzero switch-over times
- A polling model with reneging at polling instants
- A push-pull network with infinite supply of work
- A push-pull queueing system
- A threshold policy in a Markov-modulated production system with server vacation: the case of continuous and batch supplies
- A two-queue polling model with two priority levels in the first queue
- A two-station queue with dependent preparation and service times
- Branching-type polling systems with large setups
- Customer waiting-time distributions under base-stock policies in single-facility multi-item production systems
- Decomposition results for general polling systems and their applications
- Dynamic Server Allocation for Queueing Networks with Flexible Servers
- Group maintenance policies for an \(R\)-out-of-\(N\) system with phase-type distribution
- Heavy traffic analysis of polling systems in tandem
- Heavy-Traffic Limits of Queueing Networks with Polling Stations: Brownian Motion in a Wedge
- Interacting queues with server selection and coordinated scheduling-application to cellular data networks
- Iterative approximation of \(k\)-limited polling systems
- Marked point processes as limits of Markovian arrival streams
- Matching moments to phase distributions: Mixtures of erlang distributions of common order
- Mathematical methods to study the polling systems
- Mean value analysis for polling systems
- Mixed gated/exhaustive service in a polling model with priorities
- Optimization of multiclass queueing networks with changeover times via the achievable region approach. II: The multi-station case
- Polling systems with synchronization constraints
- Pseudo-conservation laws in cyclic-service systems
- Queue lengths and workloads in polling systems
- Symmetric queues served in cyclic order
Cited in
(6)- Performance analysis of Markovian polling systems with single buffers
- On a synchronization queue with two finite buffers
- Analysis of Two-Station Polling Queues with Setups using Continuous Time Markov Chain
- Performance analysis of multi-server tandem queues with finite buffers and blocking
- Bounding the performance of tandem queues with finite buffer spaces
- Finite-buffer polling systems with threshold-based switching policy
This page was built for publication: Analysis of tandem polling queues with finite buffers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2212282)
