论文部分内容阅读
随着高性能网络、移动网络及Internet的不断发展,具有QoS约束的多播路由技术已成为网络及分布式系统领域的一个重要研究课题。基于约束多播路由的目的在于鉴别一条路径满足QoS约束,然而,多加、乘约束的路由是一个NP-完全性问题。因此,快速的和精确的约束路由算法是少有的,甚至不存在。如此基于路由算法的需求导致众多的启发算法和一些少有的QoS算法的出现。文章描述了一种适用于研究QoS多播路由的网络模型,给出一个完全,简洁和公平地评价7个典型的基于多约束QoS多播路由算法,并且提供多约束路径算法的最坏情况下复杂性的比较。
With the continuous development of high-performance networks, mobile networks and the Internet, multicast routing technology with QoS constraints has become an important research topic in the field of networks and distributed systems. The purpose of constraint-based multicast routing is to identify a path to satisfy QoS constraints. However, multipathing and constrained routing is an NP-complete problem. Therefore, fast and accurate constrained routing algorithms are rare or not even present. The demand based on routing algorithms has led to the emergence of numerous heuristic algorithms and some rare QoS algorithms. This paper describes a network model that is suitable for studying QoS multicast routing and gives a complete, concise and fair evaluation of seven typical multi-constrained QoS multicast routing algorithms and provides the worst case of multi-constrained path algorithm Comparisons of complexity.