Some bounds for many-server systems GI/G/s

Dietrich Stoyan

18 citations0/0 files storedMathematische Operationsforschung Statistik

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 Probability and Statistical Research Probability and Risk Models

Abstract

In the paper some bounds are proved for the mean waising time in reany server queues, especially in M/G/s queues which are more precise than those of KINGMAL and BRUMELLE. For M/G/s queues bounds are given for the probility that an arriving customor has to loss probility in G/M/s loss systems using a semi-ordering relation.

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 — 18 citations exist upstream.

References

1963Introduction to the Theory of Queues.1963Introduction to the Theory of Queues 1963Stochastic Service Systems.1967QUEUES AND INVENTORIES 1970Inequalities in the Theory of Queues 1966Queues and Inventories.1962Some Inequalities for the Queue GI/G/1 1968Some Inequalities in Queuing

Cited by

1984Simulating hospital emergency departments queuing systems: (GI/G/m(t)) : (IHFF/N/∞)1980Nonpreemptive Multi-Server Priority Queues 1976A critical remark on a system approximation in queueing theory 1997Analysis of multiple-server polling systems by means of the power-series algorithm

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.