Optimization of Uniform Non-Markov Queueing Networks Using Resources and Transition Probabilities Redistribution

DOI10.1007/978-3-319-44615-8_32zbMath1398.60098OpenAlexW2508600475MaRDI QIDQ4690255

Vladimir N. Zadorozhnyi

Publication date: 22 October 2018

Published in: Communications in Computer and Information Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-44615-8_32

zbMATH Keywords

transition probabilitiesnon-Markov queueing networksmulti-channel nodes

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25)

Related Items (1)

Semi-Analytical Methods for Complex Optimization of Non-Markov Queueing Networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimizing uniform non-Markov queueing networks
• Parametric and structural optimization of the capacity of a queuing network
• Regenerative simulation of response times in networks of queues
• Optimization of closed queueing networks with several classes of messages
• Investigation of the Queueing Network $$GI-(GI|\infty )^K$$ G I - ( G I | ∞ ) K by Means of the First Jump Equation and Asymptotic Analysis
• Perturbation Analysis Gives Strongly Consistent Sensitivity Estimates for the M/G/1 Queue
• Infinitesimal Perturbation Analysis: A Tool for Simulation
• Nonlinear Programming

This page was built for publication: Optimization of Uniform Non-Markov Queueing Networks Using Resources and Transition Probabilities Redistribution