Abstract
The following queuing system is considered:Two independent recurrent input streams (streams 1 and 2) arrive at a server. It is assumed that stream 1 is of Poisson type. Three priority disciplines are studied in case that these customers have priority:head-of-the-line, preemptive-resume, and preemptive-repeat discipline. Formulas derived for the limiting distribution functions of the actual and the virtual waiting time of low priority customers and of the number of these customers in the system, by using of independences of certain random processes when the time tends to infinity.
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.
