Monotonicity of the Throughput of a Closed Queueing Network in the Number of Jobs

Ivo Adan · Jan van der Wal

30 citations0/0 files storedOperations Research

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 Petri Nets in System Modeling Age of Information Optimization

Abstract

Using a sample path argument, it is shown that the throughput of a closed queueing network with general service times is nondecreasing in the number of jobs.

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

References

1985A Concept of Monotonicity and Its Characterization for Closed Queueing Networks 1985Some properties of the throughput function of closed networks of queues

Cited by

2020The Case for a Unified Science of Operations 2010Error Bounds and Comparison Results: The Markov Reward Approach For Queueing Networks 1987A formal proof for the insensitivity of simple bounds for finite multi-server non-exponential tandem queues based on monotonicity results

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.