Internet QoS Routing Using the Bellman-Ford Algorithm
Internet QoS Routing Using the Bellman-Ford Algorithm
复制标题
使用 Bellman-Ford 算法的 Internet QoS 路由
DOI：
10.1007/978-0-387-35388-3_37
复制
发表时间：
1998
期刊：
影响因子：
--
通讯作者：
M. Gerla
中科院分区：
文献类型：
--
作者：
D. Cavendish;M. Gerla
多媒体应用对服务质量（QoS）非常敏感，因此在高速综合业务分组网络（ISPN）中对QoS的支持是必不可少的。QoS路由是一个重要方面，即在会话建立时根据用户请求和可用网络资源信息提供QoS路由。本文研究了自治系统（AS）中最优QoS路由算法。以前的方法要么基于最小化单个度量（例如延迟），要么基于最小化多个度量的组合，以分层方式一次优化一个。我们的方法找到满足多qos约束的最小跳路径。我们认为Bellman-Ford路由算法的QoS版本为给定类型的QoS路由问题提供了最佳策略。如果最小跳数是主要目标函数，那么Bellman-Ford在解决平面网络（自治系统内）中出现的大多数多约束路由问题方面非常有效。通过仿真实验进一步说明了Bellman-Ford QoS路由算法在网络利用率和会话阻塞方面的重要性。
Multimedia applications are Quality of Service (QoS) sensitive, which makes QoS support indispensable in high speed Integrated Services Packet Networks (ISPN). An important aspect is QoS routing, namely, the provision of QoS routes at session set up time based on user request and information about available network resources. This paper develops optimal QoS routing algorithms within an Autonomous System (AS). Previous approaches have been based either on minimizing asinglemetric (delay, for instance) or a combination of multiple metrics, optimizing one at a time, in a hierarchical fashion. Our approach finds minimum hop paths which satisfymultipleQoS constraints. We argue that a QoS version of the Bellman-Ford routing algorithm provides the best strategy for QoS routing problems of a given type. We show that Bellman-Ford is very powerful in solving most multiple constrained routing problems arising in a flat network (within an autonomous system), if the minimum hop is the main objective function. We further illustrate the importance of Bellman-Ford QoS routing algorithms with regard to network utilization and session blocking through simulation experiments.