Advertisement

Sensitivity Analysis and Concurrent Estimation

  • Christos G. Cassandras
  • Stéphane Lafortune
Part of the The Kluwer International Series on Discrete Event Dynamic Systems book series (DEDS, volume 11)

Abstract

After going through all the previous chapters, it would be natural for readers to conclude that DES are inherently complex and hard to analyze, regardless of the modeling framework adopted. It would also be natural to wonder whether there are any properties at all in DES that we can exploit in our effort to develop mathematical techniques for analysis, design, and control.

Keywords

Service Time Sample Path Busy Period Sample Function Idle Period 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Selected References

  1. Bao, G., C.G. Cassandras, and M. Zazanis, “;First and Second Derivative Estimators for Closed Jackson-Like Queueing Networks Using Perturbation Analysis Techniques,” Journal of Discrete Event Dynamic Systems, Vol. 7, No. 1, pp. 29–67, 1997.MATHCrossRefGoogle Scholar
  2. Brémaud, P., and F.J. Vazquez-Abad, “;On the Pathwise Computation of Derivatives with Respect to the Rate of a Point Process: The Phantom RPA Method,” Queueing Systems, Vol. 10, pp. 249–270, 1992.MATHCrossRefGoogle Scholar
  3. Cao, X., Realization Probabilities: The Dynamics of Queueing Systems, Springer-Verlag, 1994.Google Scholar
  4. Cao, X., “;Convergence of Parameter Sensitivity Estimates in a Stochastic Experiment,” IEEE Transactions on Automatic Control, Vol. 30, pp. 834–843, 1985.CrossRefGoogle Scholar
  5. Cassandras, C.G., W.B. Gong, and J.I. Lee, “;On the Robustness of Perturbation Analysis Estimators for Queueing Systems with Unknown Distributions,” Journal of Optimization Theory and Applications, Vol. 30, No. 3, pp. 491–519, 1991.MathSciNetGoogle Scholar
  6. Cassandras, C.G., and V. Julka, “;Scheduling Policies Using Marked/Phantom Slot Algorithms,” Queueing Systems, Vol. 20, pp. 207254, 1995.Google Scholar
  7. Dai, L., and Y.C. Ho, “;Structural Infinitesimal Perturbation Analysis (SIPA) for Derivative Estimation of Discrete Event Dynamic Systems,” IEEE Transactions on Automatic Control, Vol. 40, pp. 1154–1166, 1995.MathSciNetMATHCrossRefGoogle Scholar
  8. Fu, M.C., and J.Q. Hu, “;Smoothed Perturbation Analysis for Queues with Finite Buffers,” Queueing Systems, Vol. 14, pp. 57–78, 1993.MathSciNetMATHGoogle Scholar
  9. Fu, M.C., and J.Q. Hu, “;Smoothed Perturbation Analysis Derivative Estimation for Markov Chains,” Operations Research Letters, Vol. 15, pp. 241–251, 1994.MathSciNetMATHCrossRefGoogle Scholar
  10. Fu, M.C., and J.Q. Hu, Conditional Monte Carlo: Gradient Estimation and Optimization Applications, Kluwer Academic Publishers, Boston, 1997.MATHCrossRefGoogle Scholar
  11. Glasserman, P., and W.B. Gong, “;Smoothed Perturbation Analysis for a Class of Discrete Event Systems,” IEEE Transactions on Automatic Control, Vol. AC-35, No. 11, pp. 1218–1230, 1990.MathSciNetCrossRefGoogle Scholar
  12. Glasserman, P., Gradient Estimation via Perturbation Analysis, Kluwer Academic Publishers, Boston, 1991.MATHGoogle Scholar
  13. Gong, W.B., and Y.C. Ho, “;Smoothed Perturbation Analysis of Discrete Event Systems,” IEEE Transactions on Automatic Control, Vol. AC-32, No. 10, pp. 858–866, 1987.CrossRefGoogle Scholar
  14. Gong, W.B., and P. Glasserman, “;Perturbation Analysis of the M/G/1/K Queue,” Proceedings of 27th IEEE Conference on Decision and Control, 1988.Google Scholar
  15. Gong, W.B., C.G. C.ssandras, and J.Pan, “;Perturbation Analysis of a Multiclass Queueing System with Admission Control,” IEEE Transactions on Automatic Control, Vol. AC-36, No. 6, pp. 707–723, 1991.Google Scholar
  16. Gong, W.B., and H. Schulzrinne, “;Perturbation Analysis of the M/G/1/K Queue,” Mathematics and Computers in Simulation, Vol. 34, pp. 1–19, 1992.CrossRefGoogle Scholar
  17. Heidelberger, P., X. Cao, M. Zazanis, and R. Suri, “;Convergence Properties of Infinitesimal Perturbation Analysis Estimates,” Management Science, Vol. 34, No. 11, pp. 1281–1302, 1988.MathSciNetMATHCrossRefGoogle Scholar
  18. Ho, Y.C., M.A. Eyler, and D.T. Chien, “;A Gradient Technique for General Buffer Storage Design in a Serial Production Line,” Intl. Journal of Production Research, Vol. 17, pp. 557–580, 1979.CrossRefGoogle Scholar
  19. Ho, Y.C., and C.G. Cassandras, “;A New Approach to the Analysis of Discrete Event Dynamic Systems,” Automatica, Vol. 19, No. 2, pp. 149–167, 1983.MathSciNetMATHCrossRefGoogle Scholar
  20. Ho, Y.C., and X. Cao, “;Perturbation Analysis and Optimization of Queueing Networks,” Journal of Optimization Theory and Applications, Vol. 40, No. 4, pp. 559–582, 1983.MathSciNetMATHCrossRefGoogle Scholar
  21. Ho, Y.C., X. Cao, and C.G. Cassandras, “;Infinitesimal and Finite Perturbation Analysis for Queueing Networks,” Automatica, Vol. 19, pp. 439–445, 1983.MATHCrossRefGoogle Scholar
  22. Ho, Y.C., and S. Li, “;Extensions of Perturbation Analysis of Discrete Event Dynamic Systems,” IEEE Transactions on Automatic Control, Vol. AC-33, pp. 427–438, 1988.Google Scholar
  23. Ho, Y.C., and J.Q. Hu, “;An Infinitesimal Perturbation Analysis Algorithm for a Multiclass GIG’ 1 Queue,” Operations Research LettersVol. 9, pp. 35–44, 1990. Google Scholar
  24. Ho, Y.C., and X. Cao, Perturbation Analysis of Discrete Event Dynamic Systems, Kluwer Academic Publishers, Boston, 1991.MATHCrossRefGoogle Scholar
  25. Ho, Y.C., and C.G. Cassandras, “;Perturbation Analysis for Control and Optimization of Queueing Systems: An Overview and the State of the Art,” in Frontiers in Queueing (J. Dshalalow, Ed.), CRC Press, pp. 395–420, 1997.Google Scholar
  26. Hu, J.Q., and S.G. Strickland, “;Strong Consistency of Sample Path Derivative Estimates,” Applied Mathematics Letters, Vol. 3, No. 4, pp. 55–58, 1990.MathSciNetMATHCrossRefGoogle Scholar
  27. Hu, J.Q., “;Convexity of Sample Path Performances and Strong Consistency of Infinitesimal Perturbation Analysis Estimates,” IEEE Transactions on Automatic Control, Vol. AC-37, No. 2, pp. 258–262, 1992.Google Scholar
  28. Suri, R., “;Implementation of Sensitivity Calculations on a Monte-Carlo Experiment,” Journal of Optimization Theory and ApplicationsVol. 40, No. 4, pp. 625–630, 1983. Google Scholar
  29. Suri, R., and X. Cao, “;The Phantom and Marked Customer Methods for Optimization of Closed Queueing Networks with Blocking and General Service Times,” ACM Performance Evaluation Review, Vol. 12, No. 3, pp. 234–256, 1986.Google Scholar
  30. Suri, R., and M. Zazanis, “;Perturbation Analysis Gives Strongly Consistent Sensitivity Estimates for the M/G/1 Queue,” Management ScienceVol. 34, pp. 39–64, 1988. Google Scholar
  31. Suri, R., “;Perturbation Analysis: The State of the Art and Research Issues Explained via the GI/G/1 Queue,” Proceedings of the IEEE, Vol. 77, No. 1, pp. 114–137, 1989.CrossRefGoogle Scholar
  32. Vakili, P., and Y.C. Ho, “;Infinitesimal Perturbation Analysis of a Multiclass Routing Problem,” Proceedings of 25th Allerton Conference on Communication Control and Computingpp. 279–286, 1987. Google Scholar
  33. Wardi, Y., and J.Q. Hu, “;Strong Consistency of Infinitesimal Per-Google Scholar
  34. turbation Analysis for Tandem Queueing Networks,“; Journal of Discrete Event Dynamic Systems,Vol. 1, No. 1, pp. 37–60, 1991.Google Scholar
  35. Wardi, Y., W.B. Gong, C.G. Cassandras, and M.H. Kallmes, “;Smoothed Perturbation Analysis for a Class of Piecewise Constant Sample Performance Functions,” Journal of Discrete Event Dynamic Systems, Vol. 1, No. 4, pp. 393–414, 1992.MATHGoogle Scholar
  36. Zazanis, M., and R. Suri, “;Perturbation Analysis of the GI/G/1 Queue,” Technical Report, IE/MS Dept., Northwestern University, 1989.Google Scholar
  37. Cassandras, C.G., and J.I. Lee, “;Applications of Perturbation Techniques to Optimal Resource Sharing in Discrete Event Systems,” Proceedings of 1988 American Control Conference, pp. 450–455, 1988.Google Scholar
  38. Cassandras, C.G., M.V. Abidi, and D. Towsley, “;Distributed Routing with On-Line Marginal Delay Estimation,” IEEE Transactions on Communications, Vol. COM-38, No. 3, pp. 348–359, 1990.Google Scholar
  39. Chong, E.K.P., and P.J. Ramadge„ “;Convergence of Recursive Optimization Algorithms Using Infinitesimal Perturbation Analysis Estimates,” Journal of Discrete Event Dynamic Systems, Vol. 1, No. 4, pp. 339–372, 1992.MathSciNetMATHGoogle Scholar
  40. Fu, M.C., “;Convergence of a Stochastic Approximation Algorithm for the GI/G/1 Queue Using Infinitesimal Perturbation Analysis,” Journal of Optimization Theory and Applications, Vol. 65, pp. 149160, 1990.Google Scholar
  41. Suri, R., and Y.T. Leung, “;Single Run Optimization of Discrete Event Simulations–An Empirical Study using the M/M/1 Queue,” HE Transactions, Vol. 21, No. 1, pp. 35–49, 1989.Google Scholar
  42. Vazquez-Abad, F.J., C.G. Cassandras, and V. Julka, “;Centralized and Decentralized Asynchronous Optimization of Stochastic Discrete Event Systems,” IEEE Transactions on Automatic Control, Vol. AC-43, No. 5, pp. 631–655, 1998.MathSciNetCrossRefGoogle Scholar
  43. Aleksandrov, V.M., V.J. Sysoyev, and V.V. Shemeneva, “;Stochastic Optimization,” Engineering Cybernetics, Vol. 5, pp. 11–16, 1968.Google Scholar
  44. Glynn, P.W., “;Likelihood Ratio Gradient Estimation: An Overview,” Proceedings of 1987 Winter Simulation Conference, pp. 366–375, 1987.Google Scholar
  45. Reiman, M.I., and A. Weiss, “;Sensitivity Analysis via Likelihood Ratio,” Operations Research, Vol. 37, pp. 830–844, 1989.MathSciNetMATHCrossRefGoogle Scholar
  46. Cassandras, C.G., and S.G. Strickland, “;Sample Path Properties of Timed Discrete Event Systems,” Proceedings of the IEEE, Vol. 77, No. 1, pp. 59–71, 1989a.MathSciNetCrossRefGoogle Scholar
  47. Cassandras, C.G., and S.G. Strickland, “;On-Line Sensitivity Analysis of Markov Chains,” I Transactions on Automatic Control, Vol. AC-34, No. 1, pp. 76–86, 1989b.MathSciNetCrossRefGoogle Scholar
  48. Cassandras, C.G., and S.G. Strickland, “;Observable Augmented Systems for Sensitivity Analysis of Markov and Semi-Markov Processes,” IEEE Transactions on Automatic Control, Vol. AC-34, No. 10, pp. 1026–1037, 1989c.MathSciNetGoogle Scholar
  49. Cassandras, C.G., J.I. Lee, and Y.C. Ho, “;Efficient Parametric Analysis of Performance Measures for Communication Networks,” IEEE Journal on Selected Areas in CommunicationsVol. 8, No. 9, pp. 1709–1722,1990. Google Scholar
  50. Cassandras, C.G., and C.G. Panayiotou, “;Concurrent Sample Path Analysis of Discrete Event Systems,” Journal of Discrete Event Dynamic Systems1999. Google Scholar
  51. Cassandras, C.G. (Ed.), Special Issue on Parallel Simulation and Optimization of Discrete Event Dynamic Systems Journal of Discrete Event Dynamic SystemsVol. 5, No. 2/3, 1995. Google Scholar
  52. Vakili, P., “;A Standard Clock Technique for Efficient Simulation,” perations Research Letters, Vol. 10, pp. 445–452, 1991.MathSciNetMATHCrossRefGoogle Scholar
  53. Bratley, P.B., B.L. Fox,, and L.E. Schrage, A Guide to Simulation, 2nd Edition, Springer-Verlag, New York, 1987.Google Scholar
  54. Cassandras, C.G., L. Dai, and C.G. Panayiotou, “;Ordinal Optimization for Deterministic and Stochastic Resource Allocation,” IEEE Transactions on Automatic Control, Vol. AC-43, No. 7, pp. 881–900, 1998.MathSciNetCrossRefGoogle Scholar
  55. Ho, Y.C., R. Sreenivas, and P. Vakili, “;Ordinal Optimization of Discrete Event Dynamic Systems,” Journal of Discrete Event Dynamic SystemsVol. 2, No. 1, pp. 61–88, 1992. Google Scholar
  56. Gallager, R.G., “;A Minimum Delay Routing Algorithm Using Distributed Computation,” IEEE Transactions on Communications, Vol. COM-23, pp. 73–85, 1977.Google Scholar
  57. Rubinstein, R.V., Monte Carlo Optimization, Simulation, and Sensitivity Analysis of Queueing Networks, Wiley, New York, 1986.Google Scholar

Copyright information

© Springer Science+Business Media New York 1999

Authors and Affiliations

  • Christos G. Cassandras
    • 1
  • Stéphane Lafortune
    • 2
  1. 1.Boston UniversityUSA
  2. 2.The University of MichiganUSA

Personalised recommendations