Quantization, state reduction and cost-based admission and routing

Abstract

Cost-based admission and routing have been widely discussed and used in telephone switching networks, but their application in a multirate high-speed network is severely hindered by the enormous number of states of the Markov model describing the network. In this paper we show how to apply the concept of quantization to reduce the states of the model. Once the state space is reduced, conventional techniques can then be used to compute the cost function for a cost-based admission and routing scheme. The proposed method is policy-independent, meaning that it can be applied to different call admission policies.