Sojourn times in the m/g/1 queue with deterministic feedback

DOI10.1080/15326348908807101zbMath0668.60087OpenAlexW1993613995MaRDI QIDQ3821396

Wim P. Groenendijk, J. L. van den Berg, Onno J. Boxma

Publication date: 1989

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

Full work available at URL: https://ir.cwi.nl/pub/1687

zbMATH Keywords

Laplace-Stieltjes transformqueue with processor sharingsojourn times of the consecutive visits

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Related Items (9)

The \(M/G/1\) queue with processor sharing and its relation to a feedback queue ⋮ Mathematical problems in the theory of processor-sharing queueing systems ⋮ Analysis of multiclass Markovian polling systems with feedback and composite scheduling algorithms ⋮ Unnamed Item ⋮ Analysis of a Markovian feedback queue with multi-class customers and its application to the weighted round-robin queue ⋮ Sojourn time problems in feedback queues ⋮ A tandem Jackson network with feedback to the first node ⋮ On the \(M/G/1\) queue with Bernoulli feedback ⋮ An \(M\)/\(G\)/1 queue with multiple types of feedback, gated vacations and FCFS policy

This page was built for publication: Sojourn times in the m/g/1 queue with deterministic feedback