Kronecker representation and decompositional analysis of closed queueing networks with phase-type service distributions and arbitrary buffer sizes
From MaRDI portal
Publication:2271825
DOI10.1007/s10479-008-0429-8zbMath1169.90340OpenAlexW2127656123MaRDI QIDQ2271825
Publication date: 4 August 2009
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11693/22974
fixed-point iterationmultilevel methodclosed queueing networknetwork decompositionKronecker representationphase-type service distribution
Stochastic network models in operations research (90B15) Queues and service in operations research (90B22)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- The exponentialization approach to flexible manufacturing system models with general processing times
- Iterative methods based on splittings for stochastic automata networks
- A class of hierarchical queueing networks and their analysis
- Comparison of multilevel methods for Kronecker-based Markovian representations
- Efficient descriptor-vector multiplications in stochastic automata networks
- On the Convergence of a Class of Multilevel Methods for Large Sparse Markov Chains
- A Variable Buffer-Size Model and Its Use in Analyzing Closed Queueing Networks with Blocking
- Approximate Analysis of Queues in Series with Phase-Type Service Times and Blocking
- Mean-Value Analysis of Closed Multichain Queuing Networks
- Kronecker products and shuffle algebra
- Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
- Closed Queuing Systems with Exponential Servers
- Computational algorithms for closed queueing networks with exponential servers
This page was built for publication: Kronecker representation and decompositional analysis of closed queueing networks with phase-type service distributions and arbitrary buffer sizes
