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.
My Menu
Saved Items

Articles

Smoothed 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 theGI/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 theGI/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)
Image of the first page of the fulltext

References secured to subscribers.



Export this article
Export this article as RIS | Text
 
Referenced by
1 newer article

  1. Miyoshi, N. (1996) On-line derivative estimation for the multiclass single-server priority queue using perturbation analysis. IEEE Transactions on Automatic Control 41(2)
    [CrossRef]
Remote Address: 38.107.191.114 • Server: mpweb20
HTTP User Agent: CCBot/1.0 (+http://www.commoncrawl.org/bot.html)