确保安全QoS的WFS路由算法

中的最关键的功能组件之一就是基于QoS的路由，从本质上看QoS路由实际就是端点到端点的带结点条件限制和边条件限制的最短路径问题，在文1]中指出这种问题是NP完全的。本文研究对丢失敏感对延时不敏感的QoS路由模型——确保安全QoS的路由算法，并提出了一种新启发式算法；首先，我们讨论QoS一般模型，然后利用图论中的WFS算法求解QoS路由，该算法的时间复杂度为O(nlog(n)+n×d×K_0)，优于化前在该问题上的求解算法。

Width-first-search Routing Algorithm for the Guaranteeing Safety QoS Model

ion the one of critical functional component of QoS deployment is the QoS-based routing. In essence, the QoS-based is an end-to-end path finding problem with some constraints in nodes and in edges. In paper, the author have proved that this problem is NP-completed problem. In this paper, we address the QoS model that is subtle to loss-rating butdelay, we call this model as the Guaranteeing Safety QoS model, and proposal a new heuristic algorithm to solve this problem. First, we address the conception about QoS model and then present the guaranteeing QoS model. Then we put forward a new algorithm to solve this problem. The new algorithm' s time-complexity is O (+ n XdXK0) and it is better than the other algorithm for this problem.