Smoothed perturbation analysis algorithm for a G/G/1 routing problem
Weibo Gong · 1988
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.