Skip to main content
SpringerLink
Log in

A discrete time bulk service queue with accessible batch: Geo/ NB (L,K)/1

  • Theory and Methodology
  • Published:
OPSEARCH Aims and scope Submit manuscript

Abstract

This paper considers a discrete-time queue of packets awaiting movement according to the bulk service rule (L, K). Time is assumed to be divided into equal intervals called slots. The analysis has been carried out under the assumption that (i) service times of batches are independent of the number of packets in any batch, and (ii) there is no simultaneous arrival of packets and departure of batch in a single slot. The packets arrive one by one and their inter arrival times follow geometric distribution. The arriving packets are queued in FIFO order. One server transports packets in batches of minimum number L and maximum K and service times follow negative binomial NB(α, p1) distribution. The server accesses new arrivals even after service has started on any batch of initial number ‘j’ (L ≤ j < K). This operation continues till the random service time of the ongoing batch is completed or the maximum capacity of the batch being served attains “K’ whichever occurs first. The distribution of system occupancy just before and after the departure epochs is obtained using discrete-time analysis (DTA). The primary focus is on the various performance measures of the steady state distribution of the batch server at departure instants and also on numerical illustrations.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Tran-Gia P.: Discrete-time analysis technique and application to usage parameter control modeling in ATM systems, In Proceedings of the 8th Australian Teletraffic Research Seminar, Melbourne, Australia (1993)

  2. Hameed N, Yasser F: Analysis of two-class discrete packet queues with Y homogeneous arrivals and prioritized service, Commun Inform Syst, 3, 101–118 (2003)

    Google Scholar 

  3. Kleinrock L.: Queueing system, Vol. 1: theory, Wiley, New York (1975)

    Google Scholar 

  4. Sivasamy R.: A bulk service queue with accessible and non-accessible batches, opsearch, 27(1), 46–54 (1990)

    Google Scholar 

  5. Sivasamy R.: A Bulk service queueing system with a provision to admit input in to certain batches being served, Pure Appl Math Sci, 23(1–2), 37–41 (1986)

    Google Scholar 

  6. Sivasamy R., Elangovan R.: Bulk service queues of M/G/1 type with accessible batches and single vacation, Bull Pure Appl Sci, 22E(1), 73–78 (2003)

    Google Scholar 

  7. Senthamaraikannan K., Sivasamy R.: Markov renewal queues of a M/M(a,d)/1/(b,N) System — Part I, Optim, 40, 121–131 (1997)

    Article  Google Scholar 

  8. Sivasamy R., Senthamaraikannan K.: Embedded processes of a Markov renewal bulk service queue, Asia Pac J Oper Res, 11(1), 51–65 (1994)

    Google Scholar 

  9. Neuts MF.: A general class of bulk queues with Poisson input, Ann Math Stat, 38, 759–770 (1967)

    Article  Google Scholar 

  10. Chaudhry M.L., Templeton J.G.: A first course in bulk queues, Wiley, New York (1983)

    Google Scholar 

  11. Mathias D.: Analysis of the departure process of a batch service queuing system, Research report series. (Report No: 210), University of Wiirzburg, Institute of computer Science, (1998)

  12. Mathias A.D., Alexander K.S.: Using discrete-time analysis in the performance evaluation of manufacturing systems, Research Report Series. (Report No: 215), University of Wiirzburg, Institute of computer Science (1998)

  13. Chaudhry M.L.: On numerical Computations of some discrete-time queues, Computational Probability, W.K. Grassmann (ed.). Kluwer Academic Publishers, Boston, 365–407 (2000)

    Google Scholar 

  14. Gupta U.C., Goswami V.: Performance Analysis of finite buffer discrete-time with bulk service, Comput Oper Res, 29, 1331–1341 (2000)

    Article  Google Scholar 

  15. Hunter J.J.: Mathematical techniques of applied probability, Vol. II, Discretetime models: techniques and applications. Academic Press, New York (1983)

    Google Scholar 

  16. Latouche G., Ramaswami V.: Introduction to matrix analytic methods in stochastic modeling, American Statistical Association and the Society for industrial and applied Mathematics. Alexandria, Virginia, (1999)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Statistics Department, Faculty of Social Sciences, University of Botswana, P. Bag 00705, Gaborone, Botswana

    R. Sivasamy

  2. Statistics Department, Annamalai University, Annamalai Nagar, 608 002, Tamil Nadu, India

    N. Pukazhenthi

Authors
  1. R. Sivasamy
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. N. Pukazhenthi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to R. Sivasamy.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Sivasamy, R., Pukazhenthi, N. A discrete time bulk service queue with accessible batch: Geo/ NB (L,K)/1 . OPSEARCH 46, 321–334 (2009). https://doi.org/10.1007/s12597-009-0021-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12597-009-0021-2

Keywords

Search

Navigation