Optimizing uniform non-Markov queueing networks

DOI10.1134/S0005117910060172MaRDI QIDQ612087zbMATH OpenFDO

Authors Sumit K. Garg

Publication date 3 January 2011

Published in Automation and Remote Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/S0005117910060172

zbMATH Keywords

analytic-imitational methodnon-Markov queueing networks

Mathematics Subject Classification ID

Discrete-time control/observation systems (93C55) Optimal stochastic control (93E20)

Cites work

• scientific article; zbMATH DE number 3522951 (Why is no real title available?)
• scientific article; zbMATH DE number 3562235 (Why is no real title available?)
• Infinitesimal Perturbation Analysis: A Tool for Simulation
• Modeling of in-house electronic mail systems
• Nonlinear Programming
• Optimization of closed queueing networks with several classes of messages
• Perturbation Analysis Gives Strongly Consistent Sensitivity Estimates for the M/G/1 Queue
• Regenerative simulation of response times in networks of queues

Cited in

(4)

• Engset formulas for nonhomogeneous non-Markov queueing systems and their application in communication networks
• Semi-Analytical Methods for Complex Optimization of Non-Markov Queueing Networks
• Optimization of uniform non-Markov queueing networks using resources and transition probabilities redistribution
• Utility Optimization in Congested Queueing Networks

Describes a project that uses

Uses Software

• AnyLogic

This page was built for publication: Optimizing uniform non-Markov queueing networks

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