Abstract
We investigate the sensitivity analysis for a discrete-time queueing system using perturbation analysis. In discrete-time queues, not only the sample performance function but also the sampled event lifetimes are essentially discontinuous in some system parameter, and therefore the well-known infinitesimal perturbation analysis (IPA) technique fails to apply to even a simple single-server queue. We here apply an idea similar to the smoothed perturbation analysis for probabilistic routing problem (or equivalently, negative customer rare perturbation analysis), and under the stationarity and ergodicity assumptions, we obtain the strongly consistent estimator. Some simulation experiments demonstrate the validity of our estimator.
Sign-in/Register to access full text options 
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 callMore From: Journal of the Operations Research Society of Japan
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.
