Additive functionals with application to sojourn times in infinite-server and processor sharing systems
DOI10.1007/s11134-012-9282-1zbMath1275.60072OpenAlexW2000668847MaRDI QIDQ383240
Manfred Brandt, Andreas Brandt
Publication date: 25 November 2013
Published in: Queueing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11134-012-9282-1
momentsdistributionboundsadditive functionalsrandom environmentsojourn times\(GI(n)/GI(n)/\infty\)\(M(n)/GI(n)/\infty\)infinite-serverstate-dependent processor sharingtime transformationvirtual requests
Inequalities; stochastic orderings (60E15) Stationary stochastic processes (60G10) Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Scaling limits via excursion theory: interplay between Crump-Mode-Jagers branching processes and processor-sharing queues
- On a processor sharing queue that models balking
- Processor sharing: a survey of the mathematical theory
- A note on the event horizon for a processor sharing queue
- Waiting times for \(M/M\) systems under state-dependent processor sharing
- An introduction to the theory of point processes
- The M/G/1 processor-sharing model: Transient behavior
- Reduced-load equivalence and induced burstiness in GPS queues with long-tailed traffic flows
- On sojourn times in \(M/GI\) systems under state-dependent processor sharing
- A sample path relation for the sojourn times in \(G/G/1\)-PS systems and its applications
- Insensitive bounds for the moments of the sojourn time distribution in the \(M/G/1\) processor-sharing queue
- Fluid and diffusion limits for transient sojourn times of processor sharing queues with time varying rates
- The sojourn time in the GI/M/1 queue by processor sharing
- Generic subadditive functions
- Insensitive Bounds for the Moments of the Sojourn Times in M/GI Systems Under State-Dependent Processor Sharing
- Insensitivity in processor-sharing networks
- Tail asymptotics for processor-sharing queues
- A Note on Insensitivity in Stochastic Networks
- Waiting Time Distributions for Processor-Sharing Systems
- Short proof of a ?Radon-Nikodym theorem? for additive functionals
This page was built for publication: Additive functionals with application to sojourn times in infinite-server and processor sharing systems
