首页> 外文会议>Proceedings of the 2010 IEEE Network Operations and Management Symposium >Optimizing unique shortest paths for resilient routing and fast reroute in IP-based networks
【24h】

Optimizing unique shortest paths for resilient routing and fast reroute in IP-based networks

机译:优化唯一的最短路径以在基于IP的网络中进行弹性路由和快速重新路由

获取原文
获取原文并翻译 | 示例

摘要

Intradomain routing in IP networks follows shortest paths according to administrative link costs. When several equal-cost shortest paths exist, routers that use equal-cost multipath (ECMP) distribute the traffic over all of them. To produce single-shortest path (SSP) routing, a selection mechanism (tie-breaker) chooses just one of the equal-cost paths. Tie-breakers are poorly standardized and use information that may change over time, which makes SSP routing unpredictable. Therefore, link costs producing unique shortest paths (USP) are preferred.
机译:IP网络中的域内路由根据管理链接成本遵循最短路径。当存在几个等价的最短路径时,使用等价多路径(ECMP)的路由器会将流量分配给所有这些路径。为了产生单最短路径(SSP)路由,选择机制(抢七局)只会选择一条等价路径。抢七局的标准化程度很低,并且使用的信息可能会随着时间而变化,这使得SSP路由无法预测。因此,首选产生唯一的最短路径(USP)的链路成本。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号