In order to meet users' QoS requirements, routing should be executed in a way of finding routes meeting them. When there are more than one feasible route, only one route is often chosen among them to minimize its hop counts. That usually leads to an efficient use of network resources. Suppose here that the network accommodates traffic from some users with priority. It can happen that there is not any feasible route due to transient congestion when such a user wants to start communication. The focus of this paper is on a way of improving the blocking probability of those users with priority while keeping other already established routes. Here, we examine a rerouting of established routes for this purpose. In this paper, we propose a new dynamic rerouting algorithm and evaluate its performance by simulation. As a result, our new dynamic rerouting algorithm can improve the performance in terms of the blocking rate of a high-priority traffic.
展开▼
