Analysis of a distributed switching overload control using a semi-Markov decision process
暂无分享,去创建一个
Future switching architectures lead to the distribution of call processing and fabric control in separate processing entities. Message exchange among fabric controllers and call processors occurs in order to establish a communication path in the network. As new switching fabrics and network applications are introduced, volume and type of call requests at a distributed switch are also expected to increase. Even more so than in the past, overload control is becoming critical and requires special attention. In this paper, after describing a distributed switching architecture we consider the problem of multivariate overload control by formulating it as a Semi-Markov Decision Process. The model consists of observation of the system states at each state change. At each system state, an action appropriate for overload control in the switch entity is selected. The objective is to maximize the average system throughput.
[1] H. Heffes,et al. Comparison of control schemes for a class of distributed systems , 1982, 1982 21st IEEE Conference on Decision and Control.
[2] Anurag Kumar,et al. Traffic Overload Control in a Fully Distributed Switching Environnlent , 1988 .
[3] Henk Tijms,et al. Stochastic modelling and analysis: a computational approach , 1986 .
[4] Arthur W. Berger. Comparison of call gapping and percent blocking for overload control in distributed switching systems and telecommunications networks , 1991, IEEE Trans. Commun..