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

DOI10.1007/978-3-319-68069-9_31zbMath1397.90151OpenAlexW2759650281MaRDI QIDQ4685110

Maksim A. Kornach, Vladimir N. Zadorozhnyi

Publication date: 5 October 2018

Published in: Information Technologies and Mathematical Modelling. Queueing Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-68069-9_31

zbMATH Keywords

Monte Carlo simulationtraffic networksnon-Markov queueing networksgradient optimization methodsvariable service intensity

Mathematics Subject Classification ID

Queues and service in operations research (90B22)

Cites Work

• Unnamed Item
• Unnamed Item
• Optimizing uniform non-Markov queueing networks
• Parametric and structural optimization of the capacity of a queuing network
• Mathematical theories of traffic flow
• Perturbation Analysis Gives Strongly Consistent Sensitivity Estimates for the M/G/1 Queue
• Infinitesimal Perturbation Analysis: A Tool for Simulation
• Optimization of Uniform Non-Markov Queueing Networks Using Resources and Transition Probabilities Redistribution

This page was built for publication: Semi-Analytical Methods for Complex Optimization of Non-Markov Queueing Networks