Stability of an M|G|1 queue with thick tails and excess capacity

DOI10.1007/BF02673713MaRDI QIDQ1585947zbMATH OpenFDO

Authors S. Verwijmeren, August A. Balkema

Publication date 16 December 2001

Published in Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

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

zbMATH Keywords

foreground-background serviceM/G/1 queue

Mathematics Subject Classification ID

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

Review text

In computer networks queues are encountered which receive mostly jobs with a small required service time and only occasionally a job with a large service time, as compared to the interarrival times of jobs. The authors consider an M/G/1 queue of this type, where the traffic intensity is infinite. Under the first-come-first-served discipline the occasional long job will generate a long queue. In computer systems one therefore prefers something like the foreground-background (FB) discipline: at any given time the jobs with the least amount of service time received are being served, at a rate inversely proportional to the number of such jobs. This will, for one effect, increase the time it takes to build up a long queue, i.e. the queue, which is unstable under both disciplines, will be `more stable' under FB. Such stability aspects of the behaviour of the given M/G/1 queue under FB are the topic of the paper.

Recommendations

• The maximum queue length for heavy-tailed service times in the M/G/1 FB queue
• SOJOURN TIMES IN THE M/G/1 FB QUEUE WITH LIGHT-TAILED SERVICE TIMES
• On the nonoptimality of the foreground-background discipline for IMRL service times
• Queues with equally heavy sojourn time and service requirement distributions
• Large Fluctuations in a Deterministic Multiclass Network of Queues

Cites work

• scientific article; zbMATH DE number 3709377 (Why is no real title available?)
• scientific article; zbMATH DE number 3755546 (Why is no real title available?)
• scientific article; zbMATH DE number 3772724 (Why is no real title available?)
• On the asymptotic behaviour of the distributions of the busy period and service time in M/G/1
• Processor-sharing queues: Some progress in analysis
• The Influence of the Maximum Term in the Addition of Independent Random Variables
• The steady-state distribution of spent service times present in theM/G/1 foreground–background processor-sharing queue

Cited in

(3)

• On the nonoptimality of the foreground-background discipline for IMRL service times
• STABILITY CONDITIONS FOR GATED M/G/∞ QUEUES
• SOJOURN TIMES IN THE M/G/1 FB QUEUE WITH LIGHT-TAILED SERVICE TIMES

This page was built for publication: Stability of an M\(|G|1\) queue with thick tails and excess capacity

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