A discrete time bulk service queue with accessible batch: Geo/ NB (L,K) /1
Tóm tắt
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.
Tài liệu tham khảo
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)
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)
Kleinrock L.: Queueing system, Vol. 1: theory, Wiley, New York (1975)
Sivasamy R.: A bulk service queue with accessible and non-accessible batches, opsearch, 27(1), 46–54 (1990)
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)
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)
Senthamaraikannan K., Sivasamy R.: Markov renewal queues of a M/M(a,d)/1/(b,N) System — Part I, Optim, 40, 121–131 (1997)
Sivasamy R., Senthamaraikannan K.: Embedded processes of a Markov renewal bulk service queue, Asia Pac J Oper Res, 11(1), 51–65 (1994)
Neuts MF.: A general class of bulk queues with Poisson input, Ann Math Stat, 38, 759–770 (1967)
Chaudhry M.L., Templeton J.G.: A first course in bulk queues, Wiley, New York (1983)
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)
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)
Chaudhry M.L.: On numerical Computations of some discrete-time queues, Computational Probability, W.K. Grassmann (ed.). Kluwer Academic Publishers, Boston, 365–407 (2000)
Gupta U.C., Goswami V.: Performance Analysis of finite buffer discrete-time with bulk service, Comput Oper Res, 29, 1331–1341 (2000)
Hunter J.J.: Mathematical techniques of applied probability, Vol. II, Discretetime models: techniques and applications. Academic Press, New York (1983)
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)