IDEAS home Printed from https://ideas.repec.org/a/ids/ijmore/v2y2010i2p233-257.html
   My bibliography  Save this article

Discrete-time batch service GI/Geo#47;1#47;N queue with accessible and non-accessible batches

Author

Listed:
  • Veena Goswami
  • K. Sikdar

Abstract

Discrete-time queues are extensively used in modelling the asynchronous transfer mode environment at cell level. In this paper, we consider a discrete-time single-server finite-buffer queue with general inter-arrival and geometric service times where the services are performed in accessible or non-accessible batches of maximum size b with a minimum threshold value a. We provide a recursive method, using the supplementary variable technique and treating the remaining inter-arrival time as the supplementary variable, to develop the steady-state queue/system length distributions at pre-arrival and arbitrary epochs under the early arrival system. The method is depicted analytically for geometrical and deterministic inter-arrival time distributions, respectively. Various performance measures and outside observer's observation epochs are also discussed. Finally, some computational results have been presented.

Suggested Citation

  • Veena Goswami & K. Sikdar, 2010. "Discrete-time batch service GI/Geo#47;1#47;N queue with accessible and non-accessible batches," International Journal of Mathematics in Operational Research, Inderscience Enterprises Ltd, vol. 2(2), pages 233-257.
    • Handle: RePEc:ids:ijmore:v:2:y:2010:i:2:p:233-257
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=30818
    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.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Achyutha Krishnamoorthy & Anu Nuthan Joshua & Vladimir Vishnevsky, 2021. "Analysis of a k -Stage Bulk Service Queuing System with Accessible Batches for Service," Mathematics, MDPI, vol. 9(5), pages 1-16, March.

    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:ids:ijmore:v:2:y:2010:i:2:p:233-257. 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: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=320 .

    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.