A multi-class routing algorithm based on QoS fluctuation function

In an integrated services network, multiple traffic classes share resources. Path selection algorithms play an essential role in supporting the QoS requirements of a session and achieving efficient resource utilization. We propose a QoS fluctuation function (QoSFF) to compute the distribution states of network resources such as bandwidth and buffer. Then, based on QoSFF, we improve the path selection algorithm proposed by Sung-Eok Jeon and T. Randal (see IEEE Commun. Lett., vol.6, no.2, p.88-90, 2002) to cope with the fluctuation of subscribers´ requirements and network service resources. The aim is to improve the QoS performance of high priority traffic and ensure the performance of low priority traffic. Simulation experiments show that the new algorithm supports stabilizing high priority traffic and enhancing low priority traffic throughput.