On the optimal control of two queues with server setup times and its analysis
SIAM Journal on Computing
Workloads and waiting times in single-server systems with multiple customer classes
Proceedings of the workshop held at the Mathematical Sciences Institute Cornell University on Mathematical theory of queueing systems
Efficient visit frequencies for polling tables: minimization of waiting cost
Queueing Systems: Theory and Applications
Expected waiting times in polling systems under priority disciplines
Queueing Systems: Theory and Applications
Mean delay analysis for a message priority-based polling schemes
Queueing Systems: Theory and Applications
A note on the pseudo-conservation law for a multi-queue with local priority
Queueing Systems: Theory and Applications - Polling models
Efficient visit orders for polling systems
Performance Evaluation
Pseudo-conservation law for a priority polling system with mixed service strategies
Performance Evaluation - Special issue: performance models for information communication networks
Queueing analysis of polling models: progress in 1990-1994
Frontiers in queueing
Analysis of LAS scheduling for job size distributions with high variance
SIGMETRICS '03 Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Classifying scheduling policies with respect to unfairness in an M/GI/1
SIGMETRICS '03 Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
SWIFT: Scheduling in Web Servers for Fast Response Time
NCA '03 Proceedings of the Second IEEE International Symposium on Network Computing and Applications
The impact of the service discipline on delay asymptotics
Performance Evaluation - Modelling techniques and tools for computer performance evaluation
Performance analysis of LAS-based scheduling disciplines in a packet switched network
Proceedings of the joint international conference on Measurement and modeling of computer systems
Nearly insensitive bounds on SMART scheduling
SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Mean value analysis for polling systems
Queueing Systems: Theory and Applications
Iterative approximation of k-limited polling systems
Queueing Systems: Theory and Applications
A two-queue polling model with two priority levels in the first queue
Proceedings of the 3rd International Conference on Performance Evaluation Methodologies and Tools
Sojourn times in polling systems with various service disciplines
Performance Evaluation
Mixed gated/exhaustive service in a polling model with priorities
Queueing Systems: Theory and Applications
A polling model with multiple priority levels
Performance Evaluation
A Two-Queue Polling Model with Two Priority Levels in the First Queue
Discrete Event Dynamic Systems
Online Controller Area Network message scheduling: analysis, implementation and applications
International Journal of Systems, Control and Communications
Sojourn times in a processor sharing queue with multiple vacations
Queueing Systems: Theory and Applications
Scheduling in polling systems in heavy traffic
ACM SIGMETRICS Performance Evaluation Review - Special issue on the 31st international symposium on computer performance, modeling, measurements and evaluation (IFIPWG 7.3 Performance 2013)
On ergodicity conditions in a polling model with Markov modulated input and state-dependent routing
Queueing Systems: Theory and Applications
| Hi-index | 0.00 |
We present a simple mean value analysis (MVA) framework for analyzing the effect of scheduling within queues in classical asymmetric polling systems with gated or exhaustive service. Scheduling in polling systems finds many applications in computer and communication systems. Our framework leads not only to unification but also to extension of the literature studying scheduling in polling systems. It illustrates that a large class of scheduling policies behaves similarly in the exhaustive polling model and the standard M/GI/1 model, whereas scheduling policies in the gated polling model behave very differently than in an M/GI/1.