IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v64y2013i5p679-689.html
   My bibliography  Save this article

A generalised Little's law and its applications for a discrete-time G/D/1 queue with correlated arrivals

Author

Listed:
  • D W-C Miao

    (National Taiwan University of Science and Technology, Taipei, Taiwan)

  • H Chen

    (National Taiwan University, Taipei, Taiwan)

Abstract

The discrete-time G/D/1 queues with serially correlated batch arrivals and unit service times have wide applications in modern telecommunication systems. Despite the rich literature in their performance analysis, no simple formula on the relation between system size and sojourn time is known. We show that for this specific type of queues, the Little's law can be extended to higher moments. The benefit of this generalised result is that once the moments of either performance measure are available, those of the other will be obtained simultaneously. This result is applied to a particular example of OO-G/D/1 system, where the mean, variance, and skewness of the sojourn delay are derived in closed-form. Numerical examples are given to examine how the correlation influences these performance measures.

Suggested Citation

  • D W-C Miao & H Chen, 2013. "A generalised Little's law and its applications for a discrete-time G/D/1 queue with correlated arrivals," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 64(5), pages 679-689, May.
    • Handle: RePEc:pal:jorsoc:v:64:y:2013:i:5:p:679-689
    as

    Download full text from publisher

    File URL: http://www.palgrave-journals.com/jors/journal/v64/n5/pdf/jors201281a.pdf
    File Function: Link to full text PDF
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: http://www.palgrave-journals.com/jors/journal/v64/n5/full/jors201281a.html
    File Function: Link to full text HTML
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    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:pal:jorsoc:v:64:y:2013:i:5:p:679-689. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.palgrave-journals.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.