Note—Simple Inequalities for Multiserver Queues

Matthew J. Sobel

29 citations0/0 files storedManagement Science

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 Age of Information Optimization

Abstract

Simple inequalities are obtained for some operating characteristics of multiserver queueing models. “Loss system” and “delay system” results are presented.

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

References

1961A Proof for the Queuing Formula: L = λ W 1976Stochastic Processes in Queueing Theory 1970Inequalities in the Theory of Queues 1980Congestion in Blocking Systems-A Simple Approximation Technique 1971Some Inequalities for Parallel-Server Queues 1972A Generalization of L = λW to Moments of Queue Length and Waiting Times

Cited by

1996Simulation run lengths to estimate blocking probabilities 1988Maximum entropy two-station cyclic queues with multiple general servers 2009Sharp and simple bounds for the Erlang delay and loss formulae 1988Simple Bounds and Monotnicity the Call Congestion of Finite Multiserver Delay Systems 1980Note—Comments on a Queueing Inequality

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.