Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Optimizing uniform non-Markov queueing networks

From MaRDI portal
Publication:612087
Jump to:navigation, search

DOI10.1134/S0005117910060172zbMath1218.93113MaRDI QIDQ612087

Sumit K. Garg

Publication date: 3 January 2011

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


zbMATH Keywords

analytic-imitational methodnon-Markov queueing networks


Mathematics Subject Classification ID

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


Related Items (2)

Semi-Analytical Methods for Complex Optimization of Non-Markov Queueing Networks ⋮ Optimization of Uniform Non-Markov Queueing Networks Using Resources and Transition Probabilities Redistribution


Uses Software

  • AnyLogic



Cites Work

  • Regenerative simulation of response times in networks of queues
  • Modeling of in-house electronic mail systems
  • Optimization of closed queueing networks with several classes of messages
  • Perturbation Analysis Gives Strongly Consistent Sensitivity Estimates for the M/G/1 Queue
  • Infinitesimal Perturbation Analysis: A Tool for Simulation
  • Nonlinear Programming
  • Unnamed Item
  • Unnamed Item




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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:612087&oldid=12503976"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 07:52.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki