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

DOI10.1007/S11134-006-6264-1MaRDI QIDQ2494553zbMATH OpenOpenAlexFDO

Authors 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

Sojourn timeWaiting timeBusy periodProcessor sharingComparative analysisSample pathFirst come first servedMean sojourn time approximation

Mathematics Subject Classification ID

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

Recommendations

• The sojourn time in the GI/M/1 queue by processor sharing
• On sojourn times in M/GI systems under state-dependent processor sharing
• Sojourn time asymptotics in the M/G/1 processor sharing queue
• Sojourn times in the \(M/ PH/1\) processor sharing queue
• The M/G/1 queue with processor sharing and its relation to a feedback queue

Cites work

• scientific article; zbMATH DE number 47258 (Why is no real title available?)
• scientific article; zbMATH DE number 50996 (Why is no real title available?)
• scientific article; zbMATH DE number 1460450 (Why is no real title available?)
• scientific article; zbMATH DE number 3796940 (Why is no real title available?)
• scientific article; zbMATH DE number 805121 (Why is no real title available?)
• scientific article; zbMATH DE number 1416627 (Why is no real title available?)
• A note on the stability of the many-queue head-of-the-line processor-sharing system with permanent customers
• A reduced-load equivalence for generalised processor sharing networks with long-tailed input flows
• An approximation for the sojourn-time distribution for the gi/g/1 processor-sharing queue
• Analysis of the M/G/1 processor-sharing queue with bulk arrivals
• 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
• Reduced-load equivalence and induced burstiness in GPS queues with long-tailed traffic flows
• Sojourn time asymptotics in the M/G/1 processor sharing queue
• Sojourn times in a processor sharing queue with service interruptions
• The customer response times in the processor sharing queue are associated
• The processor‐sharing queueing model for time‐shared systems with bulk arrivals
• The sojourn time in the GI/M/1 queue by processor sharing

Cited in

(7)

• Processor sharing: a survey of the mathematical theory
• Waiting times for \(M/M\) systems under state-dependent processor sharing
• A cost-equation analysis of general-input general-service processor sharing system
• The equivalence between processor sharing and service in random order.
• Additive functionals with application to sojourn times in infinite-server and processor sharing systems
• Ratio between average sojourn times under processor sharing and fair sojourn protocol
• On the stability of the multi-queue multi-server processor sharing with limited service

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2494553)