A mathematical model for evaluation of overload traffic in communication networks
Masataka Ohta · Electronics and Communications in Japan (Part I Communications) · 1993
Abstract With the advent of the information age, congestion of communication networks due to natural and social phenomena occurs more easily, and coping with this overload traffic is necessary. In this paper, a mathematical model for evaluating overload traffic is presented, and methods for using this model to evaluate overload traffic are shown. Since the state of a congested network varies with time, the transient behavior of the traffic needs to be analyzed. However, it is impossible to conduct the analysis by means of existing methods because of the enormous amount of computations required. Therefore, by regarding the traffic in a congested network as deterministic, an approximate solution, by means of deterministic equations, is proposed in this paper. The transient analysis of the throughput and overflow rate of networks with finite resources can be evaluated by means of this approximate solution. In accordance with the proposed model, the methods to compute the call blocking probability, which is used to evaluate the network robustness against temporary overload, and the throughput in circuit‐switched networks are shown. It is possible to compute the number of resources (i.e., buffers) which is appropriate for a given blocking probability considering the robustness of the network against congestion. The maximum throughput of the network can also be evaluated with transient analysis of the throughput.