Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

Infinitesimal perturbation analysis of a queueing system with bursty traffic

  • Published:
Discrete Event Dynamic Systems Aims and scope Submit manuscript

Abstract

We study aG/G/1 queueing system with a “bursty” arrival process. Based on a general model for such a bursty process, we derive infinitesimal perturbation analysis (IPA) derivative estimators of the mean system time with respect to various parameters of interest. The cases of both complete and partial state information are considered. To ensure unbiasedness and strong consistency of the estimators, different sample path representations are developed such that sample functions are continuous with respect to the particular parameter of interest. Some of these representations are applicable to a wider class of gradient estimation problems where sample path discontinuities arise. Simulation results are included to compare the convergence rates and variance properties of the different IPA estimators developed.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Cao, X. R., 1985. Convergence of parameter sensitivity estimates in a stochastic experiment.IEEE Trans. Auto. Control., AC-30, pp. 845–853.

    Google Scholar 

  • Cassandras, C. G., 1993.Discrete Event Systems: Modeling and Performance Analysis. Homewood, IL, Irwin.IEEE Trans. Comm., COM-38, pp. 348–359.

    Google Scholar 

  • Cassandras, C. G. and Pan, J., 1991. Perturbation and analysis of queueing systems with a time-varying arrival rate.Proc. 30th IEEE Conf. Dec. and Ctr., pp. 1159–1160.

  • Chong, E. K. P. and Ramadge, P. J., 1992. Convergence of recursive optimization algorithms using infinitesimal perturbation analysis estimates.Discrete Event Dynam. Syst., 1, pp. 339–372.

    Google Scholar 

  • Cox, D. R. and Isham, V. (1980).Point Processes. London: Chapman & Hall.

    Google Scholar 

  • Daigle, J. N. and Langford, J. D. (1986). Models for analysis of packet voice communications systems.IEEE J. Selected Areas Comm., SAC-4, pp. 847–855.

    Google Scholar 

  • Fishman, G. S., 1978,Principles of Discrete Event Simulation. New York: Wiley.

    Google Scholar 

  • Glasserman, P., 1990,Gradient Estimation via Perturbation Analysis. Boston: Kluwer.

    Google Scholar 

  • Gong, W. B., Cassandras, C. G., and Pan, J., 1991. Perturbation analysis of a multiclass queueing system with admission control.IEEE Trans. Auto. Control, AC-36, pp. 707–723.

    Google Scholar 

  • Heffes, H. and Lucantoni, D., 1986. A Markov modulated characterization of voice and data traffic and related statistical multiplexer performance.IEEE J. Selected Areas Comm., SAC-4, pp. 856–867.

    Google Scholar 

  • Ho, Y. C. and Cao, X. R., 1991.Perturbation Analysis of Discrete Event Dynamic Systems. Boston: Kluwer.

    Google Scholar 

  • Ho, Y. C. and Hu, J. Q., 1990. An infinitesimal perturbation analysis algorithm for a multiclassG/G/1 queue.Oper. Res. Lett., 9, pp. 35–44.

    Google Scholar 

  • Hu, J. Q., 1992, Variance properties of sample path derivatives of parametric random variables.Oper. Res. Lett., 11, pp. 47–54.

    Google Scholar 

  • Hu, J. Q., and Strickland, S. G., 1990. Strong consistencys of sample path derivative estimates.Appl. Math. Lett., vol. 3, pp. 55–58.

    Google Scholar 

  • Ide, I., 1989. Superposition of interrupted Poisson processes and its application to packetized voice multiplexers.Teletraffic Sci., pp. 1399–1405.

  • Kallmes, M., 1992. Sensitivity analysis and control of queueing systems with real-time constraints and discontinuous performance measures. Ph.D. thesis, University of Massachusetts.

  • Pan, J., 1993. Sample path based sensitivity analysis techniques in flow control problems. Ph.D. thesis, University of Massachusetts.

  • Ross, S. M., 1983.Stochastic Process. New York Wiley.

    Google Scholar 

  • Sriram, K., and Whitt, W., 1986. Characterizing superposition arrival processes in packet multiplexers for voice and data.IEEE J. Selected Areas Comm., SAC-4, pp. 833–846.

    Google Scholar 

  • Suri, R., 1987. Infinitesimal perturbation analysis for general discrete event systems.J. ACM, 34, pp. 686–717.

    Google Scholar 

  • Vakili, P., 1988. Chapter 3: Alternative representation and perturbation analysis in a routing problem. Ph.D. thesis, Harvard University.

  • Vakili, P., and Ho, Y. C., 1987. Infinitesimal perturbation analysis of a multiclass routing problem.Proc. 25th Allerton Conf. Comm., Ctrl., and Computing, vol I, pp. 279–285.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electrical and Computer Engineering, University of Massachusetts at Amherst, 01003, Amherst, MA

    Jie Pan & Christos G. Cassandras

Authors
  1. Jie Pan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Christos G. Cassandras
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Pan, J., Cassandras, C.G. Infinitesimal perturbation analysis of a queueing system with bursty traffic. Discrete Event Dyn Syst 4, 325–358 (1994). https://doi.org/10.1007/BF01440233

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01440233

Keywords

Search

Navigation