The age of the arrival process in the G/M/1 and M/G/1 queues
From MaRDI portal
(Redirected from Publication:627458)
Recommendations
Cites work
- scientific article; zbMATH DE number 3755546 (Why is no real title available?)
- Computational schemes for two exponential servers where the first has a finite buffer
- Conditional Ages and Residual Service Times in the M/G/1 Queue
- Equilibrium queue size distributions for semi-reversible queues
- Note on the GI/GI/1 queue with LCFS-PR observed at arbitrary times
- Optimal Routing Among ⋅/M/1 Queues with Partial Information
- Perturbation bounds for the stationary probabilities of a finite Markov chain
- The Conditional Distribution of the Residual Service Time in theMn/G/1 Queue
- The G/M/1 queue revisited
- The critical offered load in variants of the symmetric shortest and longest queue systems
Cited in
(7)- The principal-agent problem for service rate event-dependency
- A General Formula for the Stationary Distribution of the Age of Information and Its Application to Single-Server Queues
- The G/M/1 queue revisited
- An optimal age maintenance for an M/G/1 queueing system
- Computational schemes for two exponential servers where the first has a finite buffer
- A rate balance principle and its application to queueing models
- Conditional Ages and Residual Service Times in the M/G/1 Queue
This page was built for publication: The age of the arrival process in the G/M/1 and M/G/1 queues
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q627458)