An approximation for the sojourn-time distribution for the gi/g/1 processor-sharing queue

DOI10.1080/15326349208807213zbMath0749.60091OpenAlexW2033337497MaRDI QIDQ4009174

Bhaskar Sengupta

Publication date: 27 September 1992

Published in: Communications in Statistics. Stochastic Models (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/15326349208807213

zbMATH Keywords

approximationsimulationsGamma distributionprocessor-sharing queueheavy traffic theorynumerical information

Mathematics Subject Classification ID

Probabilistic models, generic numerical methods in probability and statistics (65C20) Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Related Items (13)

Processor-shared service systems with queue-dependent processors ⋮ A stochastic network with mobile users in heavy traffic ⋮ Tail behavior of conditional sojourn times in processor-sharing queues ⋮ Sojourn time distribution in a MAP/M/1 processor-sharing queue ⋮ Processor sharing: a survey of the mathematical theory ⋮ Processor-sharing and random-service queues with semi-Markovian arrivals ⋮ The \(M/G/1\) processor-sharing queue with disasters ⋮ Concavity of the conditional mean sojourn time in the \(M/G/1\) processor-sharing queue with batch arrivals ⋮ Asymptotic expansions for the sojourn time distribution in the \(M/G/1\)-PS queue ⋮ A Cost-Equation Analysis of General-Input General-Service Processor Sharing System ⋮ A sample path relation for the sojourn times in \(G/G/1\)-PS systems and its applications ⋮ Discriminatory Processor Sharing Queues and the DREB Method ⋮ AnRG-Factorization Approach for a BMAP/M/1 Generalized Processor-Sharing Queue

This page was built for publication: An approximation for the sojourn-time distribution for the gi/g/1 processor-sharing queue