|
 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.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
M.Bello, S. M. thesis, Dep. Elec. Eng. and Comput. Sci., Massachusetts Inst. Technol., Cambridge, Sept. 1976.
|
| |
2
|
D.P.Bertsekas, E.M.Gafni and R.G.Gallager, 'Second Derivative Algorithms for Minimum Delay Routing in Networks', IEEE trans, on Communication, Vol.Com-32,911- 919 Aug. 1984.
|
| |
3
|
Coo, X.R., 'Convergence of parameter sensitivity estimates in a stochastic experiment,' 1EEE Transactions on Automatic Control, A U-30, pp.845-853, 1985.
|
| |
4
|
Coo, X.R., 'Sensitivity estimates based on one realization of a stochastic system', submitted to Journal of Statistical Computation and Simulation.
|
| |
5
|
Cassandras, C.G., Abidi, M.V., and Towsley D., 'Distributed Routing with On-line Marginal Delay Estimation', submmited to IEEE Transactions on Communication, 1987.
|
| |
6
|
Gallager, R.G., 'A minimum delay routing ~lgorithm using distributed computation,' 1EEE Transactions on Communication, COM-25, pp.73-85, 1977.
|
| |
7
|
Glynn, P.W., 'Process differentiable representation of a random ,~ariable', Technical Report, University of Wisconsin, 1986.
|
| |
8
|
Glynn, P.W. and Sanders, J.L., 'Monte Carlo optimization of stochastic systems: two new approaches,' Proceedings of the 1986 ASME Computers in Engineering Con}erence, 1986.
|
| |
9
|
Gong, W.B. and Ho, Y.C., 'Smoothed perturbation analysis of discrete-event dynamic systems', IEEE Transactions on Automatic Con.tral, Vol.10, pp.858-866, 1987.
|
| |
10
|
Gong, W.B., 'Smoothed perturbation analysis of discreteevent dynamic systems', Ph.D. Thesis, Division of Applied Sciences, Harvard University, 1987.
|
| |
11
|
|
| |
12
|
Ho, Y.C. and Coo, X.R., 'Perturbation analysis of queueing networks,' .Journal of Optimization Theory and Applications, 40, pp.559-582, 1983.
|
| |
13
|
Ho, Y.C. and Coo, X.R., 'Performance Sensitivity to Routing Changes in Queueing Networks and Flexible Manufacturing systems Using Perturbation Analysis', IEEE Journal of Robotics and Automation, RA-1, pp. 615-172, 1985
|
| |
14
|
I-lo, Y. C. and Vakili, P. 'Infinitesimal perturbation analysi:~ algorithm for a routing problem', Allerton Control Confer-. enc~., 1987.
|
| |
15
|
Kleinrock, 'Queueing Syusterns' John & Wiely, 1975.
|
| |
16
|
|
| |
17
|
Reiman, M.I. and Weiss, A., 'Sensitivity analysis for simulations via likelihood ratios', Manuscript,, AT& T Bell Laboratories, 1986.
|
| |
18
|
Rubinstein, R., 'Sensitivity analysis and performance extrapolation for simulation models', Math. of Simulation and Computers, 1987.
|
| |
19
|
Sasaki, G. and Hajek, B., 'Optimal Dynamic Routing in Single Commodity Networks by Iterative Methods', lEEE Trans. Communications, Vol.Com-35, Nov.1987
|
| |
20
|
A.Segalt, 'The Modeling of Adaptive Routing in Data Communication Networks', IEEE Trans. Communications, Vol .Com- 25,85-95,J an. 1977.
|
 |
21
|
|
| |
22
|
Zazanis, M. and Suri, R., 'Comparison of perturbation analysis with conventional estimates for regenerative stochastic systems', submitted to Operations Research, 1984.
|
CITED BY 7
|
|
Michael C. Fu , Jian-Qiang Hu , Leyuan Shi, An application of perturbation analysis to a replacement problem in maintenance theory, Proceedings of the 25th conference on Winter simulation, p.329-337, December 12-15, 1993, Los Angeles, California, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Adobe Acrobat
QuickTime
Windows Media Player
Real Player
Pdf
G.3