Large deviations rate function for polling systems
A polling system with one server, Markovian routing and exponential service times and walkover times is considered. Let \(Q_t\) be the state vector of the system at time \(t\). A sample path large deviations principle is established for \(\{Q_{nt}/n\}_{t\geq 0}\) as \(n\to\infty\) and certain information on the form of the rate function is given. Key tools in the analysis are a so-called local generator, obtained by considering only subsets of the states and neglecting the positivity restrictions on the process, and fluid limits. The example of cyclic polling is considered and the connection to large deviations theory for Jackson networks is discussed.
- Large deviations and queueing networks: Methods for rate function identification
- Large deviations problems for star networks: the min policy.
- Mathematical methods to study the polling systems
- Large deviations for processes with discontinuous statistics
- Polling Models Under Limited Service Policies: Sharp Asymptotics
- scientific article; zbMATH DE number 1552339 (Why is no real title available?)
- Large deviations bounds for a polling system with Markovian on/off sources and Bernoulli service schedule
- Polling Models with Unequal Service Rates under Limited Service Policies—Sharp Asymptotics
- Large deviations of Markovian polling models with applications to admission control
This page was built for publication: Large deviations rate function for polling systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1605044)
