Towards efficient call admission control for state-dependent routing in multirate networks

We consider a link serving multiple service classes. We evaluate the properties of the link admission control policies that are obtained from an efficient scheme proposed by Krishnan and Hubner (1997). The Krishnan and Hubner approach suggests efficient calculations of state-dependent routing criteria for multi-rate networks through state-space aggregation. Through simple examples we show that it is possible that the approximations made in the approach might lead to degraded performance, instead of the expected improvement. We outline and discuss a possible extension to the Krishnan and Hubner approach in an effort to address this problem