Approximation Method for Performance Analysis of Queueing System with Multimedia Traffics

We consider a single server queueing system with two types of traffic where traffic of type 1 (such as data) are delay-insensitive and loss-sensitive and traffic of type 2 (such as voice) are delay-sensitive and loss-insensitive. To provide the required Quality of Service (QoS) of each type of traffic, we adopt the strict priority scheme for delay and push-out scheme with threshold for loss. This queueing system is modeled as a 2-dimensional Markov chain (MC) whose steady state probability requires considerable computation time for large buffer sizes. Thus we provide a simple approximation method suitably modified version of Korolyuk’s state merging algorithm for calculation of steady state probability and thus loss probability and mean delay for each type of traffic. Numerical comparison shows that this simple approximate algorithm is quite accurate and requires much less computation time.