Chapter2010

Error Bounds and Comparison Results: The Markov Reward Approach For Queueing Networks

18 citations0/0 files storedInternational series in management science/operations research/International series in operations research & management 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 Petri Nets in System Modeling

Abstract

No abstract was published for this record.

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

1986Comparison Methods for Queues and Other Stochastic Models.1987An Efficient Decomposition Method for the Approximate Evaluation of Tandem Queues with Finite Storage Space and Blocking 1984The Randomization Technique as a Modeling Tool and Solution Procedure for Transient Markov Processes 1967Finite Queues in Series with Exponential or Erlang Service Times—A Numerical Approach 1981Comparing counting processes and queues 1993Queueing Networks and Product Forms: A Systems Approach 1991Product forms for queueing networks with state-dependent multiple job transitions 1986On equivalencies of blocking mechanisms in queueing networks with blocking

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.