Call Admission and Routing in MLulti-Service Loss Networks

AbstTact- A state-dependent policy for call admission and routing in a multi-service circuit-switched network is syn-thesiced. To meet different requirements the objective func-tion is defined as the mean value of reward from the net-work. Policy iteration is applied to find the optimal control. Assuming link independence the network reward process is decomposed into the set of link reward processes thereby significantly reducing complexity. The approach is imple-mentable for large systems if certain approximations are used. A simulation study shows that the algorithm con-verges in two iterations, exhibits good traffic efficiency, and provides a flexible tool for performance allocation among services. The approach also constitutes a framework for studying, synthesizing and optimizing other call admission and routing strategies. In particular the results of sensitiv-ity analysis are used to compare the proposed decomposition approach with that developed by F.P.Kelly for optimiration of a load sharing policy in telephone networks. Keuwords- state-dependent routing, heterogeneous trafflc, Markov decision process, decomposition, shadow prices, sen-sitivity analysis, optimization. I