Polling models with renewal arrivals: A new method to derive heavy-traffic asymptotics
Performance Evaluation
Heavy traffic analysis of polling models by mean value analysis
Performance Evaluation
Exploring gate-limited analytical models for high-performance network storage servers
Journal of Computer and System Sciences
Research: Fourier analysis for modelling some cyclic behaviour of networks
Computer Communications
| Hi-index | 0.07 |
An asymmetric cyclic-service system with a probabilistically limited (PL) service policy is analyzed. In such a service policy, the maximum number of customers served at a queue during a server visit is determined by a probability which is independent of system states. Exhaustive, limited-k, and Bernoulli services are special cases of the PL policy. Customer service times and changeover times have general distribution. A numerical technique based on discrete Fourier transforms is proposed to solve for the queue-length distributions. Thus, the waiting and response-time distribution are obtained. A set of numerical examples is presented to validate the approach