Blocking evaluation for networks with reward maximization routing

Abstract

A model for node-to-node blocking probability evaluation in loss networks with state-dependent routing minimizing the reward from carried calls is synthesized. The model is based on the link independence assumption and results in an extended set of fixed point equations solved by repeated substitutions. The policy maximizing the reward from the network and the network performance under this policy are evaluated at the same time. The extensive numerical study covers the issues of accuracy, convergence, and control of performance allocation among different call classes.<>