Abstract
This paper describes and analyzes a single-server queueing model with a finite buffer and session arrivals. Generation of the sessions is described by the Markov Arrival Process (MAP). Arrival of the groups of the requests within any admitted session is described by the Terminating Batch Markov Arrival Process (TBMAP). Service time of the request has Phase (PH) type distribution. The number of the sessions that can be simultaneously admitted to the system is under control.Analysis of the joint distribution of the number of sessions and requests in the system is implemented by means of the matrix technique. Analysis of the sojourn time of an arbitrary and admitted session is performed by means of the extension of the method of catastrophes. Effect of control on the main performance measures of the system is numerically demonstrated.
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.
