The age of the arrival process in the G/M/1 and M/G/1 queues
From MaRDI portal
Publication:627458
DOI10.1007/s00186-010-0337-yzbMath1209.93141OpenAlexW2063587245MaRDI QIDQ627458
Publication date: 2 March 2011
Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00186-010-0337-y
Queueing theory (aspects of probability theory) (60K25) Stochastic systems in control theory (general) (93E03)
Related Items
A rate balance principle and its application to queueing models, Computational schemes for two exponential servers where the first has a finite buffer, The principal-agent problem for service rate event-dependency
Cites Work
- Unnamed Item
- Equilibrium queue size distributions for semi-reversible queues
- The G/M/1 queue revisited
- NOTE ON THE GI/GI/1 QUEUE WITH LCFS-PR OBSERVED AT ARBITRARY TIMES
- Computational schemes for two exponential servers where the first has a finite buffer
- Optimal Routing Among ⋅/M/1 Queues with Partial Information
- The Conditional Distribution of the Residual Service Time in theMn/G/1 Queue
- Conditional Ages and Residual Service Times in the M/G/1 Queue
- The critical offered load in variants of the symmetric shortest and longest queue systems
- Perturbation bounds for the stationary probabilities of a finite Markov chain