Approximate Analysis of General Queuing Networks by Decomposition

From MaRDI portal
Publication:4174048

DOI10.1109/TCOM.1979.1094270zbMath0392.60070WikidataQ56784374 ScholiaQ56784374MaRDI QIDQ4174048

Paul J. Kühn

Publication date: 1979

Published in: IEEE Transactions on Communications (Search for Journal in Brave)




Related Items (70)

Markovian Approximations for a Grid Computing Network with a Ring StructureTraffic allocation for manufacturing systemsLot size optimisation under pooled and unpooled scenarios in batch production systemAn analytical solution for the discrete time single server system with semi-Markovian arrivalsRobust Queueing TheoryA stochastic recirculation system with random accessTandem behavior of a finite capacity G/M/1 queueing system: An algorithmEvaluation of the performance parameters of a closed queuing network using artificial neural networksDescribing processing time when simulating JIT environmentsPerformance analysis of single stage kanban controlled production systems using parametric decompositionSetting defect charts control limits to balance cycle time and yield for a tandem production lineBuffer allocation for an integer nonlinear network design problemAsymptotic behavior of the expansion method for open finite queueing networksA new method for analysing the equilibrium and time-dependent behaviour of Markovian modelsThe interdeparture-time distribution for each class in the \(\Sigma _ iM_ i/G_ i/1\) queueApproximate analysis for queueing networks with finite capacity and customer lossDiscrete-time approximation of the machine interference problem with generally distributed failure, repair, and walking timesConditional inter-departure times from the \(M/G/s\) queueAnalytical approximations to predict performance measures of manufacturing systems with general distributions, job failures and parallel processingA robust queueing network analyzer based on indices of dispersionMODELING TRAFFIC FLOWS WITH QUEUEING MODELS: A REVIEWDiffusion parameters of flows in stable multi-class queueing networksAnalytical approximations to predict performance measures of Markovian type manufacturing systems with job failures and parallel processingAn assembly cell with and automated quality control station. Exponentially distributed processing timesOptimal selection of buffers in a tandem finite capacity G/M/1 queueing systemMean sojourn times in two-queue fork-join systems: bounds and approximationsMRE hierarchical decomposition of general queueing network modelsTandem behavior of a telecommunication system with finite buffers and repeated callsThe QNET method for two-moment analysis of open queueing networksAnalysis of a finite capacity assembly systemCapacity planning in manufacturing networks with discrete optionsAn approximate analysis of open tandem queueing networks with blocking and general service timesAsymptotically exact decomposition approximations for open queueing networksThe two-moment three-parameter decomposition approximation of queueing networks with exponential residual renewal processesA hybrid method for performance analysis of \(G/G/m\) queueing networksModeling and optimization of buffers and servers in finite queueing networksQeueing models for performance analysis: Selection of single station modelsPerformance analysis of virtual circuit connections for bursty data sources in ATM networksPerformance analysis of an ISDN switch with distributed architecture: Circuit switched callsApproximating the tandem behaviour of a G|M|1 queueing systemA review of open queueing network models of manufacturing systemsApproximate decomposition methods for the analysis of multicommodity flow routing in generalized queuing networksA spreadsheet model approach for integrating static capacity planning and stochastic queueing modelsThe heavy-traffic bottleneck phenomenon under splitting and superpositionA unified framework for approximation of general telecommunication networksApproximate analysis of load-dependent generally distributed queuing networks with low service time variabilityCapacity planning with congestion effectsTractable stochastic analysis in high dimensions via robust optimizationThe generalized expansion method for open finite queueing networksBuffer allocation in flow-shop-type production systems with general arrival and service patternsApproximation of the departure processes from G/M/1/K and M/G/1/K queueing systemsTandem behavior of a telecommunication system with repeated calls. II: A general case without buffersQueueing theory in manufacturing systems analysis and design: A classification of models for production and transfer linesCharacterization of the departure process from anME/ME/1queueApproximating the departure and the overflow processes from aG/G/Kloss systemApproximate Transient Analysis of Queuing Networks by Quasi Product FormsHigher order approximations for the single server queue with splitting, merging and feedbackHigher order approximations for tandem queueing networksPoint and interval estimation of decomposition error in discrete-time open tandem queuesTaking account of correlations between streams in queueing network approximationsTheory of queuing networks and its applications to the analysis of information-computing systemsTandem behaviour of a finite-capacity G/M/1 queueing system with instantaneous Bernoulli feedback: an algorithmAn optimal policy for controlling the flow time in an assembly line systemTravel times in queueing networks and network sojournsTowards better multi-class parametric-decomposition approximations for open queueing networksSystem planning and configuration problems for optimal system designOpen finite queueing networks with \(M/M/C/K\) parallel serversAnalysis and design of rate-based congestion control of high speed networks. I: Stochastic fluid models, access regulationOperating a flexible assembly line: To control the bottleneckPerformance analysis of a batch service queue arising out of manufacturing system modelling




This page was built for publication: Approximate Analysis of General Queuing Networks by Decomposition