DocumentCode
3476576
Title
Smoothed perturbation analysis algorithms for estimating the derivatives of occupancy-related functions in serial queueing networks
Author
Wardi, Y. ; Gong, W.-B. ; Cassandras, C.G. ; Kallmes, M.H.
Author_Institution
Sch. of Electr. Eng., Georgia Inst. of Technol., Atlanta, GA, USA
fYear
1991
fDate
11-13 Dec 1991
Abstract
The authors present smoothed perturbation analysis (SPA) estimators for the derivative of a number of occupancy-related functions in serial queueing networks with finite buffer spaces. The functions are the average number of customers at a network as seen by an arrival, the probability that a customer is blocked at a particular queue, and the probability that a customer leaves a queue empty. In all three cases, the variable is a parameter of the distribution of service times at one of the queues. The derivative estimators considered are very simple and flexible, and they easily lend themselves to analysis of unbiasedness. Unlike most of the established SPA estimators, the present ones are not based on the computation of hazard rates
Keywords
graph theory; perturbation techniques; queueing theory; finite buffer spaces; occupancy-related function derivatives; probability; serial queueing networks; smoothed perturbation analysis; unbiasedness; Algorithm design and analysis; Hazards; Queueing analysis; Random variables; Space technology; Steady-state;
fLanguage
English
Publisher
ieee
Conference_Titel
Decision and Control, 1991., Proceedings of the 30th IEEE Conference on
Conference_Location
Brighton
Print_ISBN
0-7803-0450-0
Type
conf
DOI
10.1109/CDC.1991.261656
Filename
261656
Link To Document