|
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
|
BACCELLI, F., AND BR}~MAUD, P. 1980. Palm Probab~ht~es and Statwnary Queues. Lecture Notes in Statistics, vol. 41. Springer-Verlag, New York.
|
| |
2
|
BRMAUD, P. 1981. Point Processes and Queues: Martingale Dynamics. Sprmger-Verlag, New York.
|
| |
3
|
|
| |
4
|
|
| |
5
|
CAO, X~-R. 1985. Convergence of parameter sensitivity estimates in a stochastic experiment. IEEE Trans. Automat. Contr. AC-30, 9, 845-853.
|
| |
6
|
DuPuIS, P., AND SIMHA, R. 1991. On sampling controlled stochastic approximation. IEEE Trans. Automat. Contr. AC-36, 8, 915-924.
|
| |
7
|
GALLAGER, R. G. 1977. A minimum delay routing algorithm using distributed computation. IEEE Trans. Commun. COM-25 (Jan), 73-85.
|
| |
8
|
|
| |
9
|
GLASSERMAN, P. 1990. Gradient Esttmatzon via Perturbation Analysts. Kluwer, Boston.
|
 |
10
|
|
 |
11
|
|
| |
12
|
GONG, W.-B~ 1987. Smoothed perturbation analysis of discrete event dynamical systems. Ph.D. thesis, Div. of Applied Sciences, Harvard Univ., Cambridge, Mass.
|
| |
13
|
Ho, Y. C., AND CAO, X.-R. 1991. Perturbation Analysis of Discrete Event Dynamical Systems. Kluwer, Boston.
|
| |
14
|
KANSTANTOPOULOS, K., AND ZAZANIS, M. 1992. Sensivity analysis for stationary and ergodic queues. Advances Appl. Probab. 24, 738-750.
|
| |
15
|
LIPTSER, R. S., AND SHIRYAYEV, A. N. 1977. Statistics of Random Processes. Vol. I and II. Springer-Verlag, New York.
|
| |
16
|
LOYNES, R.M. 1962. The stability of queues with non-independent interarrival and service times. Proc. Cambridge Philos. Soc. 58, 497-520.
|
| |
17
|
|
| |
18
|
MATTHES, K. 1962. Zur theorie der bediennungsprozesse. In Transactions of the 3rd Prague Conference on Information Theory Statistics. In German.
|
| |
19
|
REIMAN, M., AND WEISS, A. 1989. Sensitivity analysis for simulations via likelihood ratios. Oper. Res. 37, 830-844.
|
| |
20
|
|
| |
21
|
|
| |
22
|
SEGAL, A. 1977. The modeling of adaptive routing in data communication networks. IEEE Trans. Commun. COM-25 (Jan.), 85-95.
|
REVIEW
"Osman Balci : Reviewer"
Motivated by the network routing problem, the authors present stationary gradient estimates of the cycle variables with respect to a thinning parameter in the arrival process of G/G/1 queueing systems. The type of routing problems considered in
more...
Peer to Peer - Readers of this Article have also read:
-
Data structures for quadtree approximation and compression
Communications of the ACM
28, 9
Hanan Samet
-
A hierarchical single-key-lock access control using the Chinese remainder theorem
Proceedings of the 1992 ACM/SIGAPP Symposium on Applied computing
Kim S. Lee
, Huizhu Lu
, D. D. Fisher
-
The GemStone object database management system
Communications of the ACM
34, 10
Paul Butterworth
, Allen Otis
, Jacob Stein
-
An intelligent component database for behavioral synthesis
Proceedings of the 27th ACM/IEEE Design Automation Conference on
Gwo-Dong Chen
, Daniel D. Gajski
-
Putting innovation to work: adoption strategies for multimedia communication systems
Communications of the ACM
34, 12
Ellen Francik
, Susan Ehrlich Rudman
, Donna Cooper
, Stephen Levine
|