Smoothed perturbation analysis for queues with finite buffers

Smoothed perturbation analysis for queues with finite buffers

0.00 Avg rating0 Votes
Article ID: iaor19941206
Country: Netherlands
Volume: 14
Issue: 1/2
Start Page Number: 57
End Page Number: 78
Publication Date: Aug 1993
Journal: Queueing Systems
Authors: ,
Keywords: simulation: applications
Abstract:

Applying the technique of smoothed perturbation analysis (SPA) to the GI/G/1/K queue, the authors 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. The authors 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, a strong consistency proof for the estimator is provided.

Reviews

Required fields are marked *. Your email address will not be published.