A sample path relation for the sojourn times in \(G/G/1\)-PS systems and its applications

DOI10.1007/s11134-006-6264-1zbMath1114.90017OpenAlexW1969920600MaRDI QIDQ2494553

Andreas Brandt, Manfred Brandt

Publication date: 28 June 2006

Published in: Queueing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11134-006-6264-1

zbMATH Keywords

Busy periodSojourn timeWaiting timeProcessor sharingComparative analysisSample pathFirst come first servedMean sojourn time approximation

Mathematics Subject Classification ID

Stationary stochastic processes (60G10) Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Sample path properties (60G17) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (5)

On the stability of the multi-queue multi-server processor sharing with limited service ⋮ Additive functionals with application to sojourn times in infinite-server and processor sharing systems ⋮ Processor sharing: a survey of the mathematical theory ⋮ A Cost-Equation Analysis of General-Input General-Service Processor Sharing System ⋮ Waiting times for \(M/M\) systems under state-dependent processor sharing

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Mathematical problems in the theory of processor-sharing queueing systems
• On the sojourn times for many-queue head-of-the-line processor-sharing systems with permanent customers
• Analysis of the M/G/1 processor-sharing queue with bulk arrivals
• Sojourn times in a processor sharing queue with service interruptions
• Sojourn time asymptotics in the \(M/G/1\) processor sharing queue
• A reduced-load equivalence for generalised processor sharing networks with long-tailed input flows
• Reduced-load equivalence and induced burstiness in GPS queues with long-tailed traffic flows
• The customer response times in the processor sharing queue are associated
• A note on the stability of the many-queue head-of-the-line processor-sharing system with permanent customers
• The sojourn time in the GI/M/1 queue by processor sharing
• An approximation for the sojourn-time distribution for the gi/g/1 processor-sharing queue
• The processor‐sharing queueing model for time‐shared systems with bulk arrivals

This page was built for publication: A sample path relation for the sojourn times in \(G/G/1\)-PS systems and its applications