Abstract

A serial closed queueing network with arbitrary service time distributions is considered and a second served at some node with respect to a parameter of the service distribution at that node is derived. The authors' approach recovers the first derivative estimator along the way. Despite the complexity of the analysis, the final algorithm is relatively simple. It is shown that the authors' estimators are unbiased. Strong consistency is proved for a special case. A numerical example is included. The authors contend that their estimators can be used in conjunction with other techniques to obtain approximations of the entire throughput response surface as a function of system parameters. >

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.