• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>International IFIP-TC6 Networking Conference(NETWORKING 2004); 20040509-20040514; Athens; GR >A Traffic Engineer ing-A ware Shortest-Path Routing Algorithm in IP Networks
【24h】

A Traffic Engineer ing-A ware Shortest-Path Routing Algorithm in IP Networks

机译：IP网络中的流量工程A软件最短路径路由算法

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

摘要

Single shortest-path routing is known to perform poorly for Internet traffic engineering (TE) where the typical optimization objective is to minimize the maximum link load. Splitting traffic uniformly over equal-cost multiple shortest paths in OSPP and IS-IS does not always minimize the maximum link load when multiple paths axe not carefully selected for the global traffic demand matrix. However, a TE-aware shortest path among all the equal-cost multiple shortest paths between each ingress-egress pair can be selected such that the maximum link load is significantly reduced. IP routers can use the TE-aware shortest path without any change to existing routing protocols and without any serious configuration overhead. While calculating TE-aware shortest paths, the destination-based forwarding constraint at a node should be satisfied, because an IP router will forward a packet to the next-hop towards the destination by looking up the destination prefix. In this paper, we present a mathematical problem formulation for finding a set of TE-aware shortest paths for the given network as an integer linear program (ILP), and we propose a simple heuristic for solving large instances of the problem. The proposed algorithm is evaluated through simulations in IP networks.
机译：对于Internet流量工程（TE）而言，单个最短路径路由的性能较差，在该情况下，典型的优化目标是最小化最大链路负载。当没有为全局流量需求矩阵仔细选择多条路径时，在OSPP和IS-IS中等价的多个最短路径上均匀地划分流量并不能始终使最大链路负载最小化。但是，可以选择每个入口-出口对之间所有等价的多个最短路径中的TE感知的最短路径，以便最大程度地减少最大链路负载。 IP路由器可以使用支持TE的最短路径，而无需对现有路由协议进行任何更改，也不会造成任何严重的配置开销。在计算TE感知的最短路径时，应满足节点上基于目的地的转发约束，因为IP路由器将通过查找目的地前缀将数据包转发到目的地的下一跳。在本文中，我们提出了一种数学问题公式，以整数线性程序（ILP）的形式找到给定网络的一组TE感知最短路径，并提出了一种简单的启发式方法来解决问题的大量实例。通过在IP网络中的仿真评估了所提出的算法。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号