Additive functionals with application to sojourn times in infinite-server and processor sharing systems
type: Item
instance of: scholarly article
title: Additive functionals with application to sojourn times in infinite-server and processor sharing systems
zbMATH Open document ID: 1275.60072
author: Manfred Brandt
author: Andreas Brandt
published in: Queueing Systems
publication date: 2013-11-25T00:00:00Z
Mathematics Subject Classification ID: 60K25
Mathematics Subject Classification ID: 68M20
Mathematics Subject Classification ID: 90B22
Mathematics Subject Classification ID: 60E15
Mathematics Subject Classification ID: 60G10
zbMATH DE Number: 6232291
zbMATH Keywords: additive functionals
zbMATH Keywords: time transformation
zbMATH Keywords: infinite-server
zbMATH Keywords: random environment
zbMATH Keywords: sojourn times
zbMATH Keywords: virtual requests
zbMATH Keywords: moments
zbMATH Keywords: distribution
zbMATH Keywords: bounds
zbMATH Keywords: \(GI(n)/GI(n)/\infty\)
zbMATH Keywords: \(M(n)/GI(n)/\infty\)
zbMATH Keywords: state-dependent processor sharing
MaRDI profile type: Publication
full work available at URL: s11134-012-9282-1
OpenAlex ID: W2000668847
cites work: Q4485682
cites work: Generic subadditive functions
cites work: Insensitivity in processor-sharing networks
cites work: Reduced-load equivalence and induced burstiness in GPS queues with long-tailed traffic flows
cites work: A sample path relation for the sojourn times in \(G/G/1\)-PS systems and its applications
cites work: Waiting times for \(M/M\) systems under state-dependent processor sharing
cites work: Insensitive Bounds for the Moments of the Sojourn Times in M/GI Systems Under State-Dependent Processor Sharing
cites work: On sojourn times in \(M/GI\) systems under state-dependent processor sharing
cites work: Q4692356
cites work: Insensitive bounds for the moments of the sojourn time distribution in the \(M/G/1\) processor-sharing queue
cites work: Waiting Time Distributions for Processor-Sharing Systems
cites work: An introduction to the theory of point processes
cites work: Q3678435
cites work: Tail asymptotics for processor-sharing queues
cites work: A note on the event horizon for a processor sharing queue
cites work: Fluid and diffusion limits for transient sojourn times of processor sharing queues with time varying rates
cites work: Short proof of a ?Radon-Nikodym theorem? for additive functionals
cites work: Q2774021
cites work: The M/G/1 processor-sharing model: Transient behavior
cites work: Scaling limits via excursion theory: interplay between Crump-Mode-Jagers branching processes and processor-sharing queues
cites work: The sojourn time in the GI/M/1 queue by processor sharing
cites work: Processor sharing: a survey of the mathematical theory
cites work: A Note on Insensitivity in Stochastic Networks
cites work: On a processor sharing queue that models balking
DOI: 10.1007/S11134-012-9282-1
Recommended article: On the sojourn time distribution in a finite capacity processor shared queue
Recommended article: Sojourn time asymptotics in processor-sharing queues
Recommended article: Sojourn time asymptotics in processor sharing queues with varying service rate
Recommended article: A functional central limit theorem for Markov additive arrival processes and its applications to queueing systems
Recommended article: On the sojourn time distribution in a finite population Markovian processor sharing queue
Recommended article: On sojourn times in the finite capacity \(M/M/1\) queue with processor sharing
Recommended article: Sojourn time asymptotics in the \(M/G/1\) processor sharing queue
Recommended article: Insensitive bounds for the moments of the sojourn time distribution in the \(M/G/1\) processor-sharing queue
Recommended article: ASYMPTOTIC PROPERTIES OF SOJOURN TIMES IN MULTICLASS TIME-SHARED SYSTEMS
description: scientific article; zbMATH DE number 6232291