Decomposability: Queueing and Computer System Applications

Unknown author

479 citations0/0 files stored

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

Decomposability: Queueing and Computer System Applications presents a set of powerful methods for systems analysis. This 10-chapter text covers the theory of nearly completely decomposable systems upon which specific analytic methods are based.The first chapters deal with some of the basic elements of a theory of nearly completely decomposable stochastic matrices, including the Simon-Ando theorems and the perturbation theory. The succeeding chapters are devoted to the analysis of stochastic queuing networks that appear as a type of key model. These chapters also discuss congestion problems in

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

Cited by

1988Stochastic theory of a fluid model of producers and consumers coupled by a buffer 1990Survey of closed queueing networks with blocking 1981Mean-value analysis and convolution method for queue-dependent servers in closed queueing networks 1993Chapter 5 Performance evaluation of production networks 1985On Approximate Queueing Models of Dynamic Job Shops 2004Perturbation analysis for denumerable Markov chains with application to queueing models 1986Analytic Queueing Network Models for Parallel Processing of Task Systems 2001Techniques for fast simulation of models of highly dependable systems

Imported from OpenAlex (CC0) — nothing here is generated.