Efficient computational technique for virtual partitioning

A numerically efficient approximation for virtual partitioning, a scheme for connection admission control, is considered. It shares the resource among several traffic classes in a fair and efficient manner using a state-dependent trunk reservation. In the absence of a product form, an approximation for the occupancy distribution for this multirate loss system was originally suggested by Borst and Mitra. Based on this approximation, a more numerically efficient approximation is developed here. It combines asymptotic approximation methods with recursive formulas in a way that the computational complexity is reduced by several orders of magnitude. Furthermore, a modified approximation is derived such that its complexity scales independent of the state space. It avoids recursive formulas and thus is well suited for real-time computations, but with reduced accuracy. Numerical results show the computational efficiency of the new approximations and their accuracy is compared with the simulation results. It is clearly shown that this accuracy is comparable to that of the existing approximation methods.