A method to minimize the blocking probability for heterogeneous traffic flows

The 3G wireless networks must support heterogeneous types of traffic. Although it is well known that, for the single type of traffic, the blocking probability of a single server queuing system can be reduced by evenly splitting the server´s capacity into multiple servers, it is less known what the outcome would be in the multi-type traffic system if the server´s capacity is unevenly split into multiple servers. In this paper, we analytically prove the existence of the minimum blocking probability under some constraints. This result would have an obvious significance since the blocking probability is one of the most important performance metrics in modern wireless communication systems