⌘+K

Pulse Explore Communities Researchers Journals

Home Communities Explore

January 1, 1974Mathematische Operationsforschung Statistik

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

Dietrich Stoyan

View at Publisher

Ask AI

Bookmark

Share

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.

Discussion

No takes yet. Share an insight, caveat, or question.

Cite This Study

Dietrich Stoyan (1974) studied this question.

synapsesocial.com/papers/6a9fefe5faf072eb699c9683 https://doi.org/10.1080/02331887408801152

View at Publisher

Ask AI

Bookmark

Share

Keep reading

Synapse has enriched 5 related papers. Consider them for comparative context:

1Some Inequalities for Parallel-Server QueuesOriginal Research · 1971 · 96 citations
2Some inequalities for the queue GI/G/1Original Research · 1962 · 222 citations
3Inequalities in the Theory of QueuesOriginal Research · 1970 · 250 citations
4Some Inequalities in QueuingOriginal Research · 1968 · 191 citations
5Some results for the two armed bandit problemMathematische Operationsforschung Statistik · Thu,

More from Mathematische Operationsforschung Statistik

Some remarks to system availabilityThu,
Heterogeneous queueing with arrivals depending on queue lengthThu,
Existence, uniqueness and some in variance properties of stationary distributions for general single server queuesThu,
On a Switch-Over Policy for Controlling the Workload in a Queueing System with Two Constant Service Rates and Fixed Switch-Over CostsThu,
Nonparametric Estimation and Testing Linear Hypotheses in the Linear Regression ModelWed,