IDEAS home Printed from https://ideas.repec.org/a/hin/jnlmpe/3464389.html
   My bibliography  Save this article

A Fast Simulation Model Based on Lindley’s Recursion for the G/G/1/K Queue

Author

Listed:
  • J. L. Vazquez-Avila
  • R. Sandoval-Arechiga
  • Agustin Perez-Ramirez
  • R. Sanchez-Lara
  • Homero Toral-Cruz
  • Y. El Hamzaoui

Abstract

There are many applications where it is necessary to model queuing systems that involve finite queue size. Most of the models consider traffic with Poisson arrivals and exponentially distributed service times. Unfortunately, when the traffic behavior does not consider Poisson arrivals and exponentially distributed service times, closed-form solutions are not always available or have high mathematical complexity. Based on Lindley’s recursion, this paper presents a fast simulation model for an accurate estimation of the performance metrics of G/G/1/K queues. One of the main characteristics of this approach is the support for long-range dependence traffic models. The model can be used to model queuing systems in the same way that a discrete event simulator would do it. This model has a speedup of at least two orders of magnitude concerning implementations in conventional discrete event simulators.

Suggested Citation

  • J. L. Vazquez-Avila & R. Sandoval-Arechiga & Agustin Perez-Ramirez & R. Sanchez-Lara & Homero Toral-Cruz & Y. El Hamzaoui, 2019. "A Fast Simulation Model Based on Lindley’s Recursion for the G/G/1/K Queue," Mathematical Problems in Engineering, Hindawi, vol. 2019, pages 1-11, July.
    • Handle: RePEc:hin:jnlmpe:3464389
    DOI: 10.1155/2019/3464389
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/MPE/2019/3464389.pdf
    Download Restriction: no
    File URL: http://downloads.hindawi.com/journals/MPE/2019/3464389.xml
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2019/3464389?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
    ---><---

    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:hin:jnlmpe:3464389. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    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.