The distributional form of Little's law and the Fuhrmann-Cooper decomposition
From MaRDI portal
Publication:2638679
Recommendations
Cites work
- scientific article; zbMATH DE number 3164122 (Why is no real title available?)
- scientific article; zbMATH DE number 3814037 (Why is no real title available?)
- scientific article; zbMATH DE number 4041013 (Why is no real title available?)
- scientific article; zbMATH DE number 3177123 (Why is no real title available?)
- A distributional form of Little's law
- Evaluation of the total time in system in a preempt/resume priority queue via a modified Lindley process
- Priority queues
- Queueing systems with vacations - a survey
- Queues Subject to Service Interruption
- Stochastic Decompositions in the M/G/1 Queue with Generalized Vacations
- The preempt-resume M/G/1 queue with feedback and clocked schedules
Cited in
(25)- The M/G/1/K blocking formula and its generalizations to state-dependent vacation systems and priority systems
- A STATE-DEPENDENT POLLING MODEL WITH k-LIMITED SERVICE
- A globally gated polling system with a dormant server
- Sampling at subexponential times, with queueing applications
- Polling: past, present, and perspective
- A note on the \(M^x/G/1\) queue with a random set-up time under a restricted admissibility policy with a Bernoulli vacation schedule
- A Token-Based Central Queue with Order-Independent Service Rates
- On polling systems with large setups
- A two-queue polling model with two priority levels in the first queue
- Equivalences of Batch-Service Queues and Multi-Server Queues and Their Complete Simple Solutions in Terms of Roots
- A review of L= W and extensions
- A note on the distributional Little's law for discrete-time queues with D-MAP arrivals and its application
- On two-queue Markovian polling systems with exhaustive service
- Waiting time distributions in the preemptive accumulating priority queue
- Iterative approximation of \(k\)-limited polling systems
- HEAVY-TRAFFIC ANALYSIS OF K-LIMITED POLLING SYSTEMS
- A polling model with reneging at polling instants
- Palm calculus for a process with a stationary random measure and its applications to fluid queues
- A distributional form of Little's law
- Waiting times in queueing networks with a single shared server
- Mixed gated/exhaustive service in a polling model with priorities
- A polling model with smart customers
- Branching-type polling systems with large setups
- The Distributional Little's Law and Its Applications
- Service with a queue and a random capacity cart: random processing batches and E-limited policies
This page was built for publication: The distributional form of Little's law and the Fuhrmann-Cooper decomposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2638679)