Today's communication networks have stringent availability requirements and hence need to rapidly restore connectivity after failures. Modern networks thus implement various forms of fast reroute mechanisms in the data plane, to bridge the gap to slow global control plane convergence. State-of-the-art fast reroute commonly relies on disjoint route structures, to offer multiple independent paths to the destination. We propose to leverage the network's path diversity to extend edge disjoint path mechanisms to tree routing, in order to improve the performance of fast rerouting. We present two such tree-mechanisms in detail and show that they boost resilience by up to 12% and 25% respectively on real-world, synthetic, and data center topologies, while still retaining good path length qualities.
翻译:今天的通信网络有严格的可用性要求,因此,在失败后需要迅速恢复连通性。现代网络因此在数据平面上实施各种形式的快速改道机制,以弥补差距,减缓全球控制飞机的趋同。最先进的快速改道通常依赖脱节路线结构,提供通往目的地的多种独立路径。我们提议利用网络的多样性将边缘脱节路径机制扩大到树木路线,以便改善快速改道的性能。我们详细介绍了两个这样的树机制,并表明它们在现实世界、合成和数据中心的地形上分别提高了12%和25%的复原力,同时保留了良好的路径长度。