Routing Support for Providing Guaranteed End-to-End Quality-of-Service
Routing Support for Providing Guaranteed End-to-End Quality-of-Service
复制标题
DOI：
--
复制
发表时间：
1999
期刊：
影响因子：
--
通讯作者：
Shigang Chen
中科院分区：
文献类型：
--
作者：
Shigang Chen
即将到来的Gbps高速网络有望支持广泛的实时、通信密集型应用。多媒体信息及时传输的服务质量要求对综合业务宽带网络的发展提出了新的挑战。其中一个关键问题是QoS路由，它允许为请求的QoS参数选择具有足够资源的网络路由。QoS路由解决方案的目标有两个：满足每个允许的连接的QoS要求和实现资源利用的全局效率。最近发表了许多单播/组播QoS路由算法。然而，在这方面还存在着许多尚未解决的问题。下面列出了几个例子。(1) np完全多约束路由问题缺乏一种性能可预测、开销可调的简单解决方案。(2)现有的所有算法都是针对特定问题量身定制的，缺乏一个简单、通用的路由框架，可以很容易地扩展到处理新问题。(3)大多数路由算法假设网络的精确状态信息是可用的，然而这在现实世界中是不切实际的。针对上述问题，本文的目标是为QoS路由提供简单、通用和可扩展的解决方案。我们研究了不同的路由策略，对它们进行了比较，并概述了挑战。提出了基于不同网络状态模型的各种算法，通过分析和仿真对这些算法进行了评价，讨论了不同路由策略的优缺点，并与现有算法进行了比较。本文的主要成果概述如下。(1)提出了一种求解多约束路由问题的启发式方法。它允许在性能和开销之间进行动态权衡。(2)提出了一种分布式路由框架，集成了一系列路由算法，支持对带宽、延迟、延迟抖动、开销、路径长度及其组合有QoS要求的应用。(3)提出了源路由算法和分布式路由算法来处理高度不精确的状态信息。(4)针对网络拓扑随着节点移动、加入或离开而变化的移动自组织网络，提出了分布式QoS路由算法。(5)提出了一个集成的框架来支持共存的QoS和best-effort流的路由和调度。
The up-coming Gbps high-speed networks are expected to support a wide range of real-time, communication-intensive applications. The quality-of-service (QoS) requirements for the timely delivery of multimedia information raise new challenges for the development of integrated-service broadband networks. One of the key issues is QoS routing, which allows selecting network routes with sufficient resources for requested QoS parameters. The goal of QoS routing solutions is two-fold: satisfying the QoS requirements for every admitted connection and achieving global efficiency in resource utilization. Many unicast/multicast QoS routing algorithms were published recently. However, there still exist a lot of unsolved problems in this area. A few examples are listed as follows. (1) There lacks a simple solution with predictable performance and adjustable overhead for the NP-complete multi-constraint routing problem. (2) All existing algorithms are tailored towards specific problems, and there lacks a simple, general routing framework which can be easily extended to handle new problems. (3) Most routing algorithms assume the availability of precise state information about the network, which however is impractical in the real world. We address the above problems, and the goal of this dissertation is to provide simple, general and extensible solutions for QoS routing. We study different routing strategies, compare them and outline the challenges. We propose various algorithms based on different network state models, evaluate these algorithms by analysis and simulation, discuss their strengths and weaknesses of different routing strategies, and compare them with the existing algorithms. The major achievement of this dissertation is outlined in the following. (1) A heuristic approach is proposed to solve the multi-constraint routing problem. It allows the dynamic tradeoff between performance and overhead. (2) A distributed routing framework is proposed to integrate a family of routing algorithms which support applications with QoS requirements on bandwidth, delay, delay jitter, cost, path length, and their combination. (3) Source and distributed routing algorithms axe proposed to work with state information which has a high degree of imprecision. (4) Distributed QoS routing algorithms are proposed for mobile ad-hoc networks whose topologies change as nodes move, join, or leave the networks. (5) An integrated framework is proposed to support routing and scheduling of co-existing QoS and best-effort flows.