Waiting-time approximations in multi-queue systems with cyclic service
Performance Evaluation
The analysis of random polling systems
Operations Research
An approximation for mean waiting times in cyclic server systems with nonexhaustive service
Performance Evaluation
Analysis of cyclic service systems with limited service: bounds and approximations
Performance Evaluation
Exact results for the cyclic-service queue with a Bernoulli schedule
Performance Evaluation
A numerical approach to cyclic-service queueing models
Queueing Systems: Theory and Applications
Adventures in stochastic processes
Adventures in stochastic processes
Performance Analysis of Transaction Driven Computer Systems Via Queueing Analysis of Polling Models
IEEE Transactions on Computers
Performance evaluation of polling systems by means of the power-series algorithm
Annals of Operations Research - Special issue on stochastic modeling of telecommunication systems
An approximate analysis of a cyclic server queue with limited service and reservations
Queueing Systems: Theory and Applications - Polling models
Using the exact state space of a Markov model to compute approximate stationary measures
Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Route packets, not wires: on-chip inteconnection networks
Proceedings of the 38th annual Design Automation Conference
A two-queue model with Bernoulli service schedule and switching times
Queueing Systems: Theory and Applications
Waiting Times in Polling Systems with Markovian Server Routing
Messung, Modellierung und Bewertung von Rechensystemen, 5. GI/ITG-Fachtagung
Adaptive decomposition and approximation for the analysis of stochastic petri nets
Performance Evaluation - Dependable systems and networks-performance and dependability symposium (DSN-PDS) 2002: Selected papers
Structured Markov chains solver: algorithms
SMCtools '06 Proceeding from the 2006 workshop on Tools for solving structured Markov chains
Structured Markov chains solver: software tools
SMCtools '06 Proceeding from the 2006 workshop on Tools for solving structured Markov chains
Iterative approximation of k-limited polling systems
Queueing Systems: Theory and Applications
Reduction of a polling network to a single node
Queueing Systems: Theory and Applications
End-to-end delays in polling tree networks
Proceedings of the 3rd International Conference on Performance Evaluation Methodologies and Tools
| Hi-index | 0.00 |
We devise an approximation of the marginal queue length distribution in discrete-time polling systems with batch arrivals and fixed packet sizes. The polling server uses the Bernoulli service discipline and Markovian routing. The 1-limited and exhaustive service disciplines are special cases of the Bernoulli service discipline, and traditional cyclic routing is a special case of Markovian routing. The key step of our approximation is the translation of the polling system to a structured Markov chain, while truncating all but one queue. Numerical experiments show that the approximation is very accurate in general. Our study is motivated by networks on chips with multiple masters (e.g., processors) sharing a single slave (e.g., memory).