保证QoS的路径级网络资源分配算法研究

随着越来越多的实时业务接入因特网,如何在满足业务端到端QoS要求的前提下,使网络接纳更多用户成为一个严峻的挑战.本文首先对路径级的网络资源最优分配问题建立数学模型.理论推导证明:该问题可以通过一个简单的最优规划问题求解.随后,根据求得的最优解的特点,本文提出了一种结合网络资源状态和用户业务QoS要求的资源分配算法—ERA算法.ERA算法不仅运算简单,而且仿真结果也表明,在相同网络资源总量的前提下,其接纳的用户数目可以达到理论的上界.

Study of a Path Level Network Resource Allocation Algorithm with QoS Guarantees

As more and more services with definite QoS requirements go into the Internet,ISP's face a severe challenge that how maximum number of users can be admitted into networks with QoS guarantees.In this paper,a mathematical model is built first for describing the problem of optimum network resource allocation.Secondly,it is proved that the problem above can be simplified into an easy optimization programming,the unique optimal solution to which is just that of the original problem,and whose optimal value is the upper bound of the number of admitted users.At last,a novel path level network resource allocation algorithm,ERA algorithm,is developed based on the characteristics of that optimal solution.The ERA algorithm possesses the good simplicity and efficiency,and the numerical results also show that it outperforms other algorithms dealing with the same problem.