Parametric Analysis of Queuing Networks

From MaRDI portal
Publication:4047348


DOI10.1147/rd.191.0036zbMath0294.90026WikidataQ56170524 ScholiaQ56170524MaRDI QIDQ4047348

No author found.

Publication date: 1975

Published in: IBM Journal of Research and Development (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/032776fce098453cc49f164f45bc7808876d6945


60K25: Queueing theory (aspects of probability theory)

90B10: Deterministic network models in operations research


Related Items

Model reduction of general queueing networks, Product Form Approximation of Transient Probabilities in Stochastic Reaction Networks, Mean value analysis of closed queueing networks with Erlang service time distributions, An extension to Norton's equivalent, Simplification of a complex signal transduction model using invariants and flow equivalent servers, On the perturbation analysis of discrete-event dynamic systems, Throughput concavity and response time convexity, A four-input three-stage queuing network approach to model an industrial system, Approximate analysis of load-dependent generally distributed queuing networks with low service time variability, A note on stable flow-equivalent aggregation in closed networks, Theory of queuing networks and its applications to the analysis of information-computing systems, Relevance of network theory to models of distributed/parallel processing, Ersatzteilbemessung für reparierbare Geräte. Grundlegende Modelle und Verfahren, New performance sensitivity formulae for a class of product-form queueing networks, A linear algebraic formulation of the performance sensitivities of queueing networks, Validation of a computer performance model of the exponential queuing network family, The behaviour of a single queue in a general queueing network, A hierarchical approach for capacity coordination in multiple products single-machine production systems with stationary stochastic demands, A generalization of Norton's theorem for queueing networks, NORTON'S THEOREM FOR BATCH ROUTING QUEUEING NETWORKS, Approximate Transient Analysis of Queuing Networks by Quasi Product Forms, Optimal flow control of an end-to-end communication network with fixed routing