Hostname: page-component-77f85d65b8-nc6n8 Total loading time: 0 Render date: 2026-03-26T09:28:47.872Z Has data issue: false hasContentIssue false
  • English
  • Français

NONSTATIONARY LOSS QUEUES VIA CUMULANT MOMENT APPROXIMATIONS

Published online by Cambridge University Press:  15 September 2014

Jamol Pender
Jamol Pender*
Affiliation:
School of Operations Research and Information Engineering, Cornell University, Ithaca, NY 14850, USA E-mail: jjp274@cornell.edu
Get access Rights & Permissions [Opens in a new window]

Abstract

In this paper, we provide a new technique for analyzing the nonstationary Erlang loss queueing model with abandonment. Our method uniquely combines the use of the functional Kolmogorov forward equations with the well-known Gram-Charlier series expansion from the statistics literature. Using the Gram-Charlier series expansion, we show that we can estimate salient performance measures of the loss queue such as the mean, variance, skewness, kurtosis, and blocking probability. Lastly, we provide numerical examples to illustrate the effectiveness of our approximations.

Information

Type
Research Article
Information
Probability in the Engineering and Informational Sciences , Volume 29 , Issue 1 , January 2015 , pp. 27 - 49
Copyright
Copyright © Cambridge University Press 2014 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

1.Davis, J.L., Massey, W.A. & Whitt, W. (1995). Sensitivity to the service-time distribution in the nonstationary Erlang loss model. Management Science 41: 1107–1116.CrossRefGoogle Scholar
2.Grier, N., Massey, W.A., McKoy, T. & Whitt, W. (1997). The time-dependent Erlang loss model with retrials. Telecommunication Systems 7: 253–265.CrossRefGoogle Scholar
3.Hampshire, R. (2007). Dynamic Queueing Models for the Operations Management of Communication Services, Ph.D. Thesis, Princeton University.Google Scholar
4.Hampshire, R., Jennings, O.B. & Massey, W.A. (2009). A time varying call center design with Lagrangian mechanics. Probability in the Engineering and Informational Sciences 23: 231–259.Google Scholar
5.Hampshire, R. & Massey, W.A. (2010). A tutorial on dynamic optimization and applications to queueing systems with time-varying rates. Tutorials in Operations Research 208–247.Google Scholar
6.Jagerman, D.L. (1975). Nonstationary blocking in telephone traffic. Bell System Technical Journal 54: 625–661.Google Scholar
7.Ko, Y.M. & Gautam, N. (2013). Critically loaded time-varying multiserver queues: computational challenges and approximations. Informs Journal on Computing 25: 285–301.Google Scholar
8.Mandelbaum, A., Massey, W.A. & Reiman, M. (1998). Strong approximations for Markovian service networks. Queueing Systems, 30: 149–201.Google Scholar
9.Massey, W.A. & Pender, J. (2011). Skewness variance approximation for dynamic rate multi-server queues with abandonment. ACM SIGMETRICS Performance Evaluation Review 39: 74–74.CrossRefGoogle Scholar
10.Massey, W.A. & Pender, J. (2013). Gaussian skewness approximation for dynamic rate multiserver queues with abandonment. Queueing Systems 75: 243–277.Google Scholar
11.Massey, W.A. & Whitt, W. (1994). An analysis of the modified offered load approximation for the Erlang loss model. Annals of Applied Probability 4: 1145–1160.Google Scholar
12.Massey, W.A. & Whitt, W. (1996). Stationary-process approximations for the nonstationary Erlang loss model. Operations Research, 44: 976–983.Google Scholar
13.Pender, J. (2014). Gram Charlier expansions for time varying multiserver queues with abandonment. SIAM Journal of Applied Mathematics To AppearGoogle Scholar
14.Pender, J. (2012). Time Varying Queues with Abandonment Via Laguerre Polynomial Expansions, Princeton University, http://www.princeton.edu/~jpender/publicationsGoogle Scholar
15.Stein, C.M. (1986). Approximate computation of expectations, Lecture Notes Monograph Series, Vol. 7, Hayward, CA: Institute of Mathematical Statistics.Google Scholar
16.Wallace, R. (2004). Performance modeling and design of call centers with skill-based routing. Ph.D. dissertation, School of Engineering and Applied Science, George Washington University, Washington, DC.Google Scholar