Call admission and routing in multi-service loss networks

A state-dependent policy for call admission and routing in a multi-service circuit-switched network is synthesized. To meet different requirements the objective function is defined as the mean value of reward from the network. 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 implementable for large systems if certain approximations are used. A simulation study shows that the algorithm converges 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 sensitivity analysis are used to compare the proposed decomposition approach with that developed by F. P. Kelly (1988) for optimization of a load sharing policy in telephone networks. >

[1]  Ronald A. Howard,et al.  Dynamic Programming and Markov Processes , 1960 .

[2]  Michal Pioro,et al.  On adaptive call routing strategies in circuit switched networks - maximum revenue approach , 1988 .

[3]  Keith W. Ross,et al.  Optimal circuit access policies in an ISDN environment: a Markov decision approach , 1989, IEEE Trans. Commun..

[4]  Zbigniew Dziong,et al.  Control of multi-service loss networks , 1989, Proceedings of the 28th IEEE Conference on Decision and Control,.

[5]  Martin I. Reiman,et al.  Open Queueing Systems in Light Traffic , 1989, Math. Oper. Res..

[6]  R. H. Cardwell,et al.  Design and optimization of networks with dynamic routing , 1981, The Bell System Technical Journal.

[7]  Y. Watanabe,et al.  Optimal trunk reservation for a group with multislot traffic streams , 1990, IEEE Trans. Commun..

[8]  Gerald R. Ash,et al.  Teletraffic and Datatraffic in a Period of Change, Itc-13 Real-time Network Routing in a Dynamic Class-of-service Network , 2011 .

[9]  Z. Dziong,et al.  An analysis of near optimal call admission and routing model for multi-service loss networks , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.

[10]  F. Kelly.  Routing in circuit-switched networks: optimization, shadow prices and decentralization , 1988, Advances in Applied Probability.

[11]  Henk Tijms,et al.  Stochastic modelling and analysis: a computational approach , 1986 .

[12]  Zbigniew Dziong,et al.  Adaptive bandwidth management in ATM networks , 1994 .

[13]  Pierre Brémaud,et al.  On the pathwise computation of derivatives with respect to the rate of a point process: The phantom RPA method , 1992, Queueing Syst. Theory Appl..

[14]  K. Krishnan,et al.  State-dependent routing for telephone traffic: Theory and results , 1986, 1986 25th IEEE Conference on Decision and Control.

[15]  Zbigniew Dziong,et al.  Dynamic link bandwidth allocation in an integrated services network , 1989, IEEE International Conference on Communications, World Prosperity Through Communications,.

[16]  A. Gersht,et al.  Virtual-circuit load control in fast packet-switched broadband networks , 1988, IEEE Global Telecommunications Conference and Exhibition. Communications for the Information Age.

[17]  Kumpati S. Narendra,et al.  Application of Learning Automata to Telephone Traffic Routing and Control , 1977, IEEE Transactions on Systems, Man, and Cybernetics.

[18]  R. Bellman,et al.  Dynamic Programming and Markov Processes , 1960 .