The sojourn time in the GI/M/1 queue by processor sharing

From MaRDI portal
Publication:3332052

DOI10.2307/3213654zbMath0543.60093OpenAlexW2081676700MaRDI QIDQ3332052

Vaidyanathan Ramaswami

Publication date: 1984

Published in: Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/3213654




Related Items (20)

On the stability of the multi-queue multi-server processor sharing with limited serviceProcessor-sharing queues: Some progress in analysisSojourn time distribution in some processor-shared queuesAdditive functionals with application to sojourn times in infinite-server and processor sharing systemsThe Unconditional Sojourn Time Distribution in the Queue GI/M/1‐K with Processor Sharing ServiceSojourn time distribution in a MAP/M/1 processor-sharing queueThe equivalence between processor sharing and service in random order.Processor sharing: a survey of the mathematical theoryProcessor-sharing and random-service queues with semi-Markovian arrivalsMathematical problems in the theory of processor-sharing queueing systemsThe \(M/G/1\) processor-sharing queue with disastersThe conditional sojourn time distribution in the \(GI/M/1\) processor- sharing queue in heavy trafficAsymptotic expansions for the conditional sojourn time distribution in the \(M/M/1\)-PS queueConcavity of the conditional mean sojourn time in the \(M/G/1\) processor-sharing queue with batch arrivalsAsymptotic expansions for the sojourn time distribution in the \(M/G/1\)-PS queueA Cost-Equation Analysis of General-Input General-Service Processor Sharing SystemA sample path relation for the sojourn times in \(G/G/1\)-PS systems and its applicationsSojourn time asymptotics in processor-sharing queuesDiscriminatory Processor Sharing Queues and the DREB MethodAnRG-Factorization Approach for a BMAP/M/1 Generalized Processor-Sharing Queue




This page was built for publication: The sojourn time in the GI/M/1 queue by processor sharing