Year-end Sale % OFF 
Abstract
We present performance analysis of a discrete-time system with two priority queues and correlated arrivals. The arrival process to each priority queue consists of the superposition of the traffic generated by independent binary Markov sources with the arrivals to the two queues being independent of one another. The first step is the determination of the busy period of a queue with correlated arrivals. Next, the joint probability generating function of the two queue lengths is derived and the unknown boundary function is determined using the busy period of the high-priority queue. The next step is to determine closed form expressions for the mean and variance of the queue lengths. Finally, the results are extended to multiple priority queueing systems with multiple types of traffic sources. Numerical results that demonstrate the impact of the correlated arrival process in the system are presented.
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.
