a performance analysis of a discrete-time priority queueing system with correlated arrivals：具有相关到达的离散时间优先级排队系统的性能分析.pdf

Performance Evaluation 57 (2004) 307–339 A performance analysis of a discrete-time priority queueing system with correlated arrivals M. Mehmet Ali∗, X. Song Department of Electrical and Computer Engineering, Concordia University, 1455 de Maisonneuve Blvd. West, Montreal, Que., Canada H3G 1M8 Received 26 February 2003; received in revised form 22 December 2003 Available online 9 April 2004 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. © 2004 Elsevier B.V. All rights reserved. Keywords: Discrete-time queueing; Priority; Multiplexer; Binary Markov sources; Mean queue length 1. Introduction Broadband networks are expected to integrate the transmission of voice, video and data in a single net- work. A critical issue in this integration is how to meet the different Quality of Service (QoS) requirements of different services. Real-time traffic