• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>International Conference on Parallel and Distributed Processing Techniques and Applications(PDPTA'04) v.2; 20040621-20040624; Las Vegas,NV; US >An Empirical Study of Bounded Delay Constrained Bandwidth Routing
【24h】

An Empirical Study of Bounded Delay Constrained Bandwidth Routing

机译：有界延迟约束带宽路由的实证研究

获取原文
获取原文并翻译 | 示例
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Routing protocols usually characterize the network with a single metric such as hop-count or delay, and use shortest-path algorithms for path computation. However, such routing protocols do not satisfy multimedia applications which often require guaranteed and stringent quality-of-service (QoS). To meet such demand, routing protocol should have a more complex model of the network, taking into account important network parameters, such as bandwidth and delay. The basic work of QoS routing is to find a path that satisfies multiple constraints. In addition, optimization of resource utilization measured by an abstract metric, cost, is often considered. In this paper, three heuristics for bounded delay constrained bandwidth least cost problem are considered. These three heuristics are based on Dijkstra's algorithm, Bellman-Ford-Moore algorithm, and Linear Lagrange relaxation. We present an empirical study on these three heuristics by running on regular and irregular graphs with randomly generated or related cost, delay and bandwidth, and compare the results among them.
机译：路由协议通常使用诸如跳数或延迟之类的单个度量来表征网络，并使用最短路径算法进行路径计算。但是，这样的路由协议不能满足多媒体应用程序的需求，而多媒体应用程序通常需要保证严格的服务质量（QoS）。为了满足这种需求，路由协议应该具有更复杂的网络模型，同时考虑到重要的网络参数，例如带宽和延迟。 QoS路由的基本工作是找到满足多个约束的路径。另外，经常考虑以抽象度量（成本）衡量的资源利用率的优化。本文考虑了有限时延约束带宽最小成本问题的三种启发式方法。这三种启发式方法基于Dijkstra算法，Bellman-Ford-Moore算法和线性Lagrange松弛。我们通过在具有随机生成的或相关的成本，延迟和带宽的规则图和不规则图上运行，对这三种启发式方法进行了实证研究，并比较了其中的结果。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号