Multi-constraint QoS routing using a new single mixed metric
Multi-constraint QoS routing using a new single mixed metric
复制标题
DOI：
10.1016/j.jnca.2007.11.004
复制
发表时间：
2004-06
期刊：
影响因子：
--
通讯作者：
P. Khadivi;S. Samavi;T. D. Todd
中科院分区：
文献类型：
--
作者：
P. Khadivi;S. Samavi;T. D. Todd
随着Internet向支持实时服务的方向发展，多约束服务质量(Qos)路由变得越来越重要。然而，众所周知，最优多约束服务质量路由的计算是复杂的，因此已经提出了各种启发式算法用于实际情况下的路由。在这些方法中，使用单一混合度量的方法最受欢迎。尽管混合度量路由丢弃了潜在的有用信息，但通过显著降低复杂性来弥补这一点。在需要低复杂性设计的地方，例如在电池供电的无线应用中，利用这种权衡变得越来越重要。针对多约束路由问题，提出了一种新的单一混合度量算法。与现有的低复杂度方法相比，所提出的方法具有相似的复杂度。仿真和分析结果表明，该算法在生成可行路径方面比同类技术具有更好的性能。
Multi-constraint quality-of-service (QoS) routing has become increasingly important as the Internet evolves to support real-time services. It is well known, however, that optimum multi-constraint QoS routing is computationally complex, and for this reason various heuristics have been proposed for routing in practical situations. Among these methods, those that use a single mixed metric are the most popular. Although mixed metric routing discards potentially useful information, this is compensated for by significant complexity reduction. Exploiting this tradeoff is becoming increasingly important where low complexity designs are desired, such as in battery operated wireless applications. In this paper, novel single mixed metrics for multi-constraint routing are introduced. The proposed techniques have similar complexity compared with existing low complexity methods. Simulation and analytical results are presented which show that it can obtain better performance than comparable techniques in terms of generating feasible routes.