On the M/G/1 foreground-background processor-sharing queue

DOI10.1007/BF02100271MaRDI QIDQ1825530zbMATH OpenFDO

Authors Philippe Robert, R. Schaßberger

Publication date 1989

Published in Queueing Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF02100271

zbMATH Keywords

equilibrium system stateprocessor-sharing systemsservice system with Poisson batch arrivals

Mathematics Subject Classification ID

Point processes (e.g., Poisson, Cox, Hawkes processes) (60G55) Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Review text

The authors give a new derivation of the distribution of the equilibrium system state of a service system with Poisson batch arrivals and general service time requirement distribution. The discipline is such that customers whose attained service is x units receive service only when no customers are present with smaller attained service. Those present with least attained service receive service at a rate inversely proportional to their number. The application of the model is to processor-sharing systems.

Recommendations

• The \(\text{BMAP}/\text{G}/1/\infty\) queue with the foreground-background processor-sharing discipline
• The M/G/1 queue with processor sharing and its relation to a feedback queue
• A \(MAP_{K}/G_{K}/1/\infty\) queueing system with generalized foreground-background processor sharing discipline
• A finite capacity \(BMAPK/GK/1\) queue with the generalized foreground-background processor-sharing discipline
• Processor-sharing queues: Some progress in analysis
• Using the M/G/1 queue under processor sharing for exact simulation of queues
• The gi/m/1 processor-sharing queue and its heavy traffic analysis
• On the transient behavior of the processor sharing queue
• The steady-state distribution of spent service times present in theM/G/1 foreground–background processor-sharing queue

Cites work

• scientific article; zbMATH DE number 3913667 (Why is no real title available?)
• Processor-sharing queues: Some progress in analysis
• Sur les mesures de Palm de deux processus ponctuels stationnaires
• The steady-state distribution of spent service times present in theM/G/1 foreground–background processor-sharing queue

Cited in

(5)

• Mathematical problems in the theory of processor-sharing queueing systems
• A finite capacity \(BMAPK/GK/1\) queue with the generalized foreground-background processor-sharing discipline
• scientific article; zbMATH DE number 3932753 (Why is no real title available?)
• scientific article; zbMATH DE number 1222144 (Why is no real title available?)
• Batch processor sharing with hyper-exponential service time

This page was built for publication: On the M/G/1 foreground-background processor-sharing queue

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