Approximate Analysis of General Queuing Networks by Decomposition
From MaRDI portal
Publication:4174048
DOI10.1109/TCOM.1979.1094270zbMATH Open0392.60070WikidataQ56784374 ScholiaQ56784374MaRDI QIDQ4174048FDOQ4174048
Authors: Paul J. Kühn
Publication date: 1979
Published in: IEEE Transactions on Communications (Search for Journal in Brave)
Cited In (70)
- Buffer allocation for an integer nonlinear network design problem
- Tandem behavior of a telecommunication system with repeated calls. II: A general case without buffers
- Tractable stochastic analysis in high dimensions via robust optimization
- Analytical approximations to predict performance measures of Markovian type manufacturing systems with job failures and parallel processing
- Approximate analysis of load-dependent generally distributed queuing networks with low service time variability
- A unified framework for approximation of general telecommunication networks
- Open finite queueing networks with \(M/M/C/K\) parallel servers
- The two-moment three-parameter decomposition approximation of queueing networks with exponential residual renewal processes
- Capacity planning with congestion effects
- Analysis of a finite capacity assembly system
- Theory of queuing networks and its applications to the analysis of information-computing systems
- Taking account of correlations between streams in queueing network approximations
- The interdeparture-time distribution for each class in the \(\Sigma _ iM_ i/G_ i/1\) queue
- Approximating the tandem behaviour of a G|M|1 queueing system
- MODELING TRAFFIC FLOWS WITH QUEUEING MODELS: A REVIEW
- Discrete-time approximation of the machine interference problem with generally distributed failure, repair, and walking times
- A new method for analysing the equilibrium and time-dependent behaviour of Markovian models
- Asymptotically exact decomposition approximations for open queueing networks
- Robust queueing theory
- Modeling and optimization of buffers and servers in finite queueing networks
- Tandem behavior of a finite capacity G/M/1 queueing system: An algorithm
- Travel times in queueing networks and network sojourns
- Operating a flexible assembly line: To control the bottleneck
- Traffic allocation for manufacturing systems
- Approximate transient analysis of queuing networks by quasi product forms
- Setting defect charts control limits to balance cycle time and yield for a tandem production line
- An approximate analysis of open tandem queueing networks with blocking and general service times
- The QNET method for two-moment analysis of open queueing networks
- Mean sojourn times in two-queue fork-join systems: bounds and approximations
- An optimal policy for controlling the flow time in an assembly line system
- A review of open queueing network models of manufacturing systems
- Queueing theory in manufacturing systems analysis and design: A classification of models for production and transfer lines
- Buffer allocation in flow-shop-type production systems with general arrival and service patterns
- Approximate analysis for queueing networks with finite capacity and customer loss
- An assembly cell with and automated quality control station. Exponentially distributed processing times
- Optimal selection of buffers in a tandem finite capacity G/M/1 queueing system
- MRE hierarchical decomposition of general queueing network models
- Performance analysis of single stage kanban controlled production systems using parametric decomposition
- An analytical solution for the discrete time single server system with semi-Markovian arrivals
- Performance analysis of a batch service queue arising out of manufacturing system modelling
- A stochastic recirculation system with random access
- Capacity planning in manufacturing networks with discrete options
- Asymptotic behavior of the expansion method for open finite queueing networks
- Performance analysis of virtual circuit connections for bursty data sources in ATM networks
- Performance analysis of an ISDN switch with distributed architecture: Circuit switched calls
- Qeueing models for performance analysis: Selection of single station models
- Towards better multi-class parametric-decomposition approximations for open queueing networks
- Approximation of the departure processes from G/M/1/K and M/G/1/K queueing systems
- The heavy-traffic bottleneck phenomenon under splitting and superposition
- Approximate decomposition methods for the analysis of multicommodity flow routing in generalized queuing networks
- Conditional inter-departure times from the \(M/G/s\) queue
- System planning and configuration problems for optimal system design
- Analysis and design of rate-based congestion control of high speed networks. I: Stochastic fluid models, access regulation
- Higher order approximations for the single server queue with splitting, merging and feedback
- The generalized expansion method for open finite queueing networks
- Lot size optimisation under pooled and unpooled scenarios in batch production system
- Tandem behavior of a telecommunication system with finite buffers and repeated calls
- Describing processing time when simulating JIT environments
- Higher order approximations for tandem queueing networks
- A hybrid method for performance analysis of \(G/G/m\) queueing networks
- Approximating the departure and the overflow processes from aG/G/Kloss system
- Markovian approximations for a grid computing network with a ring structure
- A robust queueing network analyzer based on indices of dispersion
- Evaluation of the performance parameters of a closed queuing network using artificial neural networks
- Analytical approximations to predict performance measures of manufacturing systems with general distributions, job failures and parallel processing
- Diffusion parameters of flows in stable multi-class queueing networks
- Characterization of the departure process from anME/ME/1queue
- Tandem behaviour of a finite-capacity G/M/1 queueing system with instantaneous Bernoulli feedback: an algorithm
- A spreadsheet model approach for integrating static capacity planning and stochastic queueing models
- Point and interval estimation of decomposition error in discrete-time open tandem queues
This page was built for publication: Approximate Analysis of General Queuing Networks by Decomposition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4174048)