Analysis of polling systems
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
Cyclic reservation schemes for efficient operation of multiple-queue single-server systems
Annals of Operations Research - Special issue on stochastic modeling of telecommunication systems
Performance evaluation of Bluetooth polling schemes: an analytical approach
Mobile Networks and Applications
An M/G/1 Queueing Model with Gated Random Order of Service
Queueing Systems: Theory and Applications
Mean value analysis for polling systems
Queueing Systems: Theory and Applications
Performance Evaluation
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
Polling-based protocols for packet voice transport over IEEE 802.11 wireless local area networks
IEEE Wireless Communications
A polling model with multiple priority levels
Performance Evaluation
A polling model with smart customers
Queueing Systems: Theory and Applications
Sojourn times in a processor sharing queue with multiple vacations
Queueing Systems: Theory and Applications
Waiting times in queueing networks with a single shared server
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)
Mixed polling with rerouting and applications
Performance Evaluation
| Hi-index | 0.00 |
We consider a polling system of N queues Q"1,...,Q"N, cyclically visited by a single server. Customers arrive at these queues according to independent Poisson processes, requiring generally distributed service times. When the server visits Q"i, i=1,...,N, it serves a number of customers according to a certain polling discipline. This discipline is assumed to belong to the class of branching-type disciplines, which includes the gated and exhaustive disciplines. The special feature of our study is that, within each queue, we do not restrict ourselves to service in order of arrival (FCFS); we are interested in the effect of different service disciplines, like Last-Come-First-Served, Processor Sharing, Random Order of Service, and Shortest Job First, on the sojourn time distribution of a typical customer that arrives to the system during steady-state. After a discussion of the joint distribution of the numbers of customers at each queue at visit epochs of the server to a particular queue, we determine the Laplace-Stieltjes transform of the cycle-time distribution, viz., the time between two successive visits of the server to, say, Q"1. This yields the transform of the joint distribution of past and residual cycle time, w.r.t. the arrival of a tagged customer at Q"1. Subsequently concentrating on the case of gated service at Q"1, we use that cycle-time result to determine the (Laplace-Stieltjes transform of the) sojourn-time distribution at Q"1, for each of the scheduling disciplines mentioned above. Next to locally gated polling disciplines, we also consider the globally gated discipline. Again, we consider various non-FCFS service disciplines at the queues, and we determine the (Laplace-Stieltjes transform of the) sojourn-time distribution at an arbitrary queue.