Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
|
 |
Smoothed perturbation analysis for queues with finite buffers
| |
|
ArticlesSmoothed perturbation analysis for queues with finite buffers M. C. Fu1 and J. Q. Hu2 | (1) | College of Business and Management, University of Maryland, 20742 College Park, Maryland, USA |
| (2) | Department of Manufacturing Engineering, Boston University, 02215 Boston, Massachusetts, USA |
Received: 4 December 1991 Revised: 4 July 1992 Abstract Applying the technique of smoothed perturbation analysis (SPA) to the GI/G/1/K queue, we derive gradient estimators for two performance measures: the mean steady-state system time of a served customer and the probability that an arriving customer is rejected. Unbiasedness of the estimators follows from results of a previous general framework on SPA estimators. However, in that framework, the estimators often require the simulation of numerous additional sample subpaths, possibly making the technique practically infeasible in applications. We exploit some of the special structure of the GI/G/1/K queue to come up with an estimator which requires at most the simulation of a single additional sample subpath. By establishing certain regenerative properties, we provide a strong consistency proof for the estimator. Keywords Perturbation analysis - sample path analysis - finite buffer queues - simulation
Fulltext Preview (Small, Large)
 References secured to subscribers.
|
|
|
|
|
|