ResearchAnalysis of a time-limited polling system
References (27)
- et al.
A single-server queue with vacations and non-gated time-limited service
Performance Evaluation
(1991) - et al.
Two vacation models for token-ring networks where service is controlled by timers
Performance Evaluation
(1994) - et al.
Message delay for priority-based automatic meter reading network
Computer Communications
(1997) - et al.
Approximate analysis of a shared-medium ATM switch under bursty arrivals and nonuniform destinations
Performance Evaluation
(1994) Modeling traffic queues at a signalized intersection with vehicle-actuated control and Markovian arrival processes
Computers and Mathmatical Applications
(1995)Analysis of Polling Systems
(1986)Queueing analysis of polling models: an update
- et al.
A single-server queue with vacations and gated time-limited service
Performance Evaluation
(1990) A discrete single-server MAP/PH/1 queue with vacations and exhaustive time-limited service
OR Letters
(1995)- et al.
An approximate analysis of a cyclic server queue with limited service and reservations with an application to satellite communications
(1992)
Cyclic-server systems with non-preemptive time-limited service
IEEE Transactions Communication
Analysis of an M/G/1/N queue with vacations and its iterative application to FDDI timed-token rings
IEEE/ACM Transactions on Networking
Polling systems with server timeouts and their application to token passing networks
IEEE/ ACM Transactions on Networking
Cited by (26)
Analysis of mean packet delay for upstream transmissions in passive optical networks with sleep mode
2013, Optical Switching and NetworkingCitation Excerpt :The main contribution of our work, in comparison to [25,22], is the mean packet delay analysis in the presence of the sleep mode, which is not considered in [25] or [22]. In [26], the authors provide a useful overview on the mathematical analysis of the limited service. It is worth noting that the limited service in PONs is a “time-limited” service.
Stability analysis of multiserver discrete-time queueing systems with renewal-type server interruptions
2011, Performance EvaluationCitation Excerpt :In this particular traffic setting, the polling discipline coincides with the preemptive repeat different discipline due to the lack of memory of the exponential service time distribution. Frigui and Alfa [16] focus on a time-limited polling system with a preemptive repeat different polling discipline as an approximation for the preemptive resume polling discipline. These authors assume a Markovian arrival process, phase-type service times and finite capacity buffers.
Applications of polling systems
2011, Surveys in Operations Research and Management ScienceCitation Excerpt :This makes them very suitable to model as a polling system with time-limited service, but it also makes them difficult to analyze. Frigui and Alfa [142,143] propose an iterative algorithm to approximate waiting times in a discrete-time polling system with time-limited service. Their papers focus on applications in communication systems, but in [144] the model is also applied to traffic intersections.
The discrete-time MAP/PH/1 queue with multiple working vacations
2010, Applied Mathematical ModellingA learning-automata-based controller for client/server systems
2004, NeurocomputingCitation Excerpt :As it will be seen in the simulation results (Section 4), significantly different values of L give very similar performance results. In the following, the proposed LPA is compared to the well-known RRP scheme [4]. The polling schemes which are under comparison were simulated to be applied to six client/server systems (namely, S1–S6) under bursty and asymmetric traffic conditions.
Improving the performance of polling models using forced idle times
2018, Probability in the Engineering and Informational Sciences