Unbiased estimates for gradients of stochastic network performance measures

Abstract

Three classes of stochastic networks and their performance measures are considered. These performance measures are defined as the expected value of some random variables and cannot normally be obtained analytically as functions of network parameters in a closed form. We give similar representations for the random variables to provide a useful way of analytical study of these functions and their gradients. The representations are used to obtain sufficient conditions for the gradient estimates to be unbiased. The conditions are rather general and usually met in simulation study of the stochastic networks. Applications of the results are discussed and some practical algorithms of calculating unbiased estimates of the gradients are also presented.

Cited by in corpus (7)

• A max-algebra approach to modeling and simulation of tandem queueing systems
• A recursive equations based representation for the $G/G/m$ queue
• Recursive equations based models of queueing systems
• Using max-algebra linear models in the representation of queueing systems
• Efficient algorithms for tandem queueing system simulation
• Efficient parallel algorithms for tandem queueing system simulation
• Unbiased gradient estimation in queueing networks with parameter-dependent routing