Hostname: page-component-7b7567c8c-48dgx Total loading time: 0 Render date: 2026-11-18T03:49:37.350Z Has data issue: false hasContentIssue false

NONSTATIONARY LOSS QUEUES VIA CUMULANT MOMENT APPROXIMATIONS

Published online by Cambridge University Press:  15 September 2014

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

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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
Copyright
Copyright © Cambridge University Press 2014