Abstract
This paper presents the performance analysis of a discrete-time finite-buffer queue with batch input, general interarrival and geometric service times. It is assumed that a batch arriving with size larger than the available buffer is partially accepted and the rest is rejected. The queue is analyzed for early arrival system as well as for late-arrival system with delayed access using both the supplementary variable and imbedded Markov chain techniques. Besides obtaining state probabilities at various epochs and loss probability of a batch as well as of a customer, other performance measures have also been discussed. The waiting time analysis of an arbitrary customer of a batch is also carried out.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
