GI/G/1 processor sharing queue in heavy traffic

S. A. Grishechkin

21 citations0/0 files storedAdvances in Applied Probability

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Advanced Queuing Theory Analysis Stochastic processes and statistical mechanics Probability and Risk Models

Abstract

ConsiderGI/G/1 processor sharing queues with traffic intensity tending to 1. Using the theory of random measures and the theory of branching processes we investigate the limiting behaviour of the queue length, sojourn time and random measures describing attained and residual processing times of customers present.

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Citations in this library

Citation map →

Stored only when both papers are in the corpus — 21 citations exist upstream.

References

1987Applied Probability and Queues 1987Processor-sharing queues: Some progress in analysis 1992On a relationship between processor-sharing queues and Crump–Mode–Jagers branching processes 1992An approximation for the sojourn-time distribution for the gi/g/1 processor-sharing queue

Cited by

2003Resource sharing with subexponential distributions 2006The M/G/1 processor-sharing queue with disasters 2007Heavy traffic limit for a processor sharing queue with soft deadlines

Explore the map →

Papers that cite the same references — the relational fallback while embeddings are still backfilling.

Imported from OpenAlex (CC0) — nothing here is generated.