In QoS networks, routing algorithms for QoS traffic have to provide the tra
nsmission path satisfying its QoS requirement. while achieving high utiliza
tion of network resources. Therefore, server-based QoS routine, algorithms
would be more effective than distributed routing ones which are very common
on the Internet. Furthermore, we believe that rerouting function enhances
the advantage of their algorithms in which an already accepted flow with es
tablished path is replaced on some other path in order to accept newly arri
ving transmission request if it can not be accepted without doing so. Thus
in this paper, we will propose a rerouting algorithm with the server-based
QoS routing and evaluate its performance in tet ms of the blocking probabil
ity by computer simulation. In addition, we will investigate the impact, of
the amount of traffic with high-priority on the performance in some networ
k topologies. Through some simulation results, we also discuss some issues
arising in improving the effectiveness of rerouting.