Routing for reducing flow convergence on particular nodes

Flow convergence on particular nodes causes various problems such as degradation in QoS. We describe a new routing method for reducing the maximum number of relay flows on the node that relays maximum flows (called “the maximum number of relay flows”). A full search is required for calculating the optimal algorithm of this problem. Thus, we created an approximate algorithm to calculate a near optimal solution using scalable computational costs. Moreover, when this method permits a call loss, the maximum number of relay flows can be reduced more. However, there is generally a trade-off relationship between the call loss rate and the maximum number of relay flows. Thus, we show the numerical relationship between the call loss rate and the maximum number of relay flows. Finally, we show, using a simulation in various network topology and traffic situations, that the maximum number of relay flows and the network delay can be reduced by our proposed method.