IDEAS home Printed from https://ideas.repec.org/a/taf/lstaxx/v54y2024i12p3692-3710.html
   My bibliography  Save this article

A Bayesian approach to determine sample size in Erlang single server queues

Author

Listed:
  • Laxmipriya Singh
  • E. S. Gomes
  • F. R. B. Cruz

Abstract

An essential aspect of the practical application of Erlang single-server queues is the statistical inference of their parameters, notably traffic intensity. This metric is crucial as it serves as a fundamental performance indicator, allowing the derivation of other significant measures, including the mean queue size and the expected number of customers in the system. Additionally, it provides the proportion of time the queue system is occupied. This article explores algorithms for calculating sample sizes for these estimations, based on the number of customers who arrived during service periods, a highly intuitive approach, allowing data collection without concerns about correlations among data points. For this purpose, we have considered two forms of informative priors: Gauss hypergeometric and beta priors. Additionally, a non conjugate and objective prior, known as Jeffreys prior, has been taken into account. We present tables with sample sizes for specific configurations and abacuses for more general configurations obtainable through approximate interpolations.

Suggested Citation

  • Laxmipriya Singh & E. S. Gomes & F. R. B. Cruz, 2024. "A Bayesian approach to determine sample size in Erlang single server queues," Communications in Statistics - Theory and Methods, Taylor & Francis Journals, vol. 54(12), pages 3692-3710, October.
  • Handle: RePEc:taf:lstaxx:v:54:y:2024:i:12:p:3692-3710
    DOI: 10.1080/03610926.2024.2401602
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/03610926.2024.2401602
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/03610926.2024.2401602?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:taf:lstaxx:v:54:y:2024:i:12:p:3692-3710. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/lsta .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.