Optimizing unique shortest paths for resilient routing and fast reroute in IP-based networks
Optimizing unique shortest paths for resilient routing and fast reroute in IP-based networks
复制标题
优化独特的最短路径，以实现基于 IP 的网络中的弹性路由和快速重新路由
DOI：
10.1109/noms.2010.5488482
复制
发表时间：
2010
期刊：
影响因子：
--
通讯作者：
Christian Schwartz
中科院分区：
文献类型：
--
作者：
D. Hock;Matthias Hartmann;M. Menth;Christian Schwartz
IP网络中的域内路由根据管理链路成本遵循最短路径。当存在多条等成本最短路径时，使用等成本多路径（ECMP）的路由器会将流量分配到所有路径上。为了产生单最短路径（SSP）路由，选择机制（平局决胜局）只选择一条等价路径。决胜局的标准化程度很低，使用的信息可能会随着时间的推移而变化，这使得SSP路由不可预测。因此，产生唯一最短路径（USP）的链路成本是优选的。
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.