Abstract
Purchase PDF (678 K)
E-mail Article
Add to my Quick Links
Cited By in Scopus (11)
Purchase PDF (300 K)
doi:10.1016/j.peva.2004.01.001 
Copyright © 2004 Elsevier B.V. All rights reserved.
A performance analysis of a discrete-time priority queueing system with correlated arrivals
References and further reading may be available for this article. To view references and further reading you must purchase this article.
Received 26 February 2003;
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.
Author Keywords: Discrete-time queueing; Priority; Multiplexer; Binary Markov sources; Mean queue length
Article Outline
- 1. Introduction
- 2. Analytical model
- 3. Performance analysis
- 3.1. Transformation of the functional equation into a new form
- 3.2. Determination of the unknown boundary function
- 3.3. Solution of the functional equation
- 3.4. Marginal PGF of the high and low-priority queues
- 4. Numerical results
- 5. Conclusion
- Appendix A. Derivation of Θ′(1) and Θ″(1)
- Appendix B. The analysis of a multiplexer with multiple priority queues and multiple type of sources
- References
- Vitae
