Smoothed perturbation analysis algorithm for a G/G/1 routing problem
- 1 January 1988
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 525-531
- https://doi.org/10.1145/318123.318247
Abstract
The smoothed perturbation analysis (SPA) algorithm is proposed for estimating the derivative of the mean delay with respect to the routing probability for a routing problem in data-communication networks. The algorithm requires minimum knowledge about the system and is very suitable for on-line optimization of data-communication networks. It is shown that the SPA algorithm is unbiased.Keywords
This publication has 0 references indexed in Scilit: