Additive functionals with application to sojourn times in infinite-server and processor sharing systems
From MaRDI portal
Recommendations
- On the sojourn time distribution in a finite capacity processor shared queue
- Sojourn time asymptotics in processor-sharing queues
- Sojourn time asymptotics in processor sharing queues with varying service rate
- A functional central limit theorem for Markov additive arrival processes and its applications to queueing systems
- On the sojourn time distribution in a finite population Markovian processor sharing queue
- On sojourn times in the finite capacity \(M/M/1\) queue with processor sharing
- Sojourn time asymptotics in the M/G/1 processor sharing queue
- Insensitive bounds for the moments of the sojourn time distribution in the \(M/G/1\) processor-sharing queue
- ASYMPTOTIC PROPERTIES OF SOJOURN TIMES IN MULTICLASS TIME-SHARED SYSTEMS
Cites work
- A Note on Insensitivity in Stochastic Networks
- A note on the event horizon for a processor sharing queue
- A sample path relation for the sojourn times in \(G/G/1\)-PS systems and its applications
- An introduction to the theory of point processes
- Fluid and diffusion limits for transient sojourn times of processor sharing queues with time varying rates
- Generic subadditive functions
- scientific article; zbMATH DE number 1713116 (Why is no real title available?)
- scientific article; zbMATH DE number 3899912 (Why is no real title available?)
- scientific article; zbMATH DE number 1460450 (Why is no real title available?)
- scientific article; zbMATH DE number 194401 (Why is no real title available?)
- Insensitive bounds for the moments of the sojourn time distribution in the \(M/G/1\) processor-sharing queue
- Insensitive Bounds for the Moments of the Sojourn Times in M/GI Systems Under State-Dependent Processor Sharing
- Insensitivity in processor-sharing networks
- On a processor sharing queue that models balking
- On sojourn times in M/GI systems under state-dependent processor sharing
- Processor sharing: a survey of the mathematical theory
- Reduced-load equivalence and induced burstiness in GPS queues with long-tailed traffic flows
- Scaling limits via excursion theory: interplay between Crump-Mode-Jagers branching processes and processor-sharing queues
- Short proof of a ?Radon-Nikodym theorem? for additive functionals
- Tail asymptotics for processor-sharing queues
- The M/G/1 processor-sharing model: Transient behavior
- The sojourn time in the GI/M/1 queue by processor sharing
- Waiting Time Distributions for Processor-Sharing Systems
- Waiting times for \(M/M\) systems under state-dependent processor sharing
This page was built for publication: Additive functionals with application to sojourn times in infinite-server and processor sharing systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q383240)