Analysis of polling systems
A single-server queue with vacations and non-gated time-limited service
Performance Evaluation
Modern operating systems
Stability of token passing rings
Queueing Systems: Theory and Applications - Polling models
An approximate analysis of a cyclic server queue with limited service and reservations
Queueing Systems: Theory and Applications - Polling models
Approximate analysis of a shared-medium ATM switch under bursty arrivals and nonuniform destinations
Performance Evaluation - Special issue: discrete-time models and analysis methods
Two vacation models for token-ring networks where service is controlled by timers
Performance '93 Proceedings of the 16th IFIP Working Group 7.3 international symposium on Computer performance modeling measurement and evaluation
Polling systems with server timeouts and their application to token passing networks
IEEE/ACM Transactions on Networking (TON)
Analysis of an M/G/1/N queue with vacations and its iterative application to FDDI timed-token rings
IEEE/ACM Transactions on Networking (TON)
Research: Message delay for a priority-based automatic meter reading network
Computer Communications
A discrete MAP/PH/1 queue with vacations and exhaustive time-limited service
Operations Research Letters
Real-time queueing theory: A tutorial presentation with an admission control application
Queueing Systems: Theory and Applications
Analysis of a Discrete-Time Queueing System with Timed Vacations
Queueing Systems: Theory and Applications
A Tandem Queueing Model for Delay Analysis in Disconnected Ad Hoc Networks
ASMTA '08 Proceedings of the 15th international conference on Analytical and Stochastic Modeling Techniques and Applications
A polling model with an autonomous server
Queueing Systems: Theory and Applications
| Hi-index | 0.24 |
In this paper, we consider a cyclic polling system in which arrivals are governed by the Markovian arrival process. Each queue is visited according to the exhaustive time-limited service discipline to coincide with IEEE 802.5 and 802.4 standards. Using the decomposition approach, each queue is analyzed as a single server queue with vacation. By exploiting the properties of the discrete time phase distribution we construct the vacation period from the visit period of the other queues in the polling system. Using an iterative procedure we were able to compute the queue length distribution and the average waiting time for polling systems with finite capacity (or infinite capacity) in all queues. Comparison of the mean waiting time with simulation results shows that the proposed models give reasonable results.