Optimization of uniform non-Markov queueing networks using resources and transition probabilities redistribution

DOI10.1007/978-3-319-44615-8_32zbMATH Open1398.60098OpenAlexW2508600475MaRDI QIDQ4690255FDOQ4690255

Authors: 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

Recommendations

• Semi-Analytical Methods for Complex Optimization of Non-Markov Queueing Networks
• Parametric and structural optimization of the capacity of a queuing network
• Computational algorithms of optimization of closed queuing networks
• scientific article; zbMATH DE number 870457
• Optimization of closed stochastic networks

zbMATH Keywords

transition probabilitiesnon-Markov queueing networksmulti-channel nodes

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Nonlinear Programming
• Title not available (Why is that?)
• Perturbation Analysis Gives Strongly Consistent Sensitivity Estimates for the M/G/1 Queue
• Regenerative simulation of response times in networks of queues
• Optimization of closed queueing networks with several classes of messages
• Infinitesimal Perturbation Analysis: A Tool for Simulation
• Optimizing uniform non-Markov queueing networks
• Title not available (Why is that?)
• Parametric and structural optimization of the capacity of a queuing network
• Investigation of the queueing network \(\mathrm{GI}-(\mathrm{GI}|\infty )^K\) by means of the first jump equation and asymptotic analysis

Cited In (4)

• Software rejuvenation and resource reservation policies for optimizing server resource availability using cyclic nonhomogeneous Markov chains
• Title not available (Why is that?)
• Optimal server resource reservation policies for priority classes of users under cyclic non-homogeneous Markov modeling
• Semi-Analytical Methods for Complex Optimization of Non-Markov Queueing Networks

This page was built for publication: Optimization of uniform non-Markov queueing networks using resources and transition probabilities redistribution

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4690255)