What is it about?
We introduce ShortCut that routes the packets in a loop free fashion, avoiding costly detours and decreasing link load. ShortCut achieves this by leveraging data plane programmability: when a loop is locally observed, it can be removed by short-cutting the respective route parts. As such, ShortCut is topology-independent and agnostic to the type of FRR currently deployed. Our first experimental simulations show that ShortCut can outperform control plane convergence mechanisms; moreover avoiding loops and keeping packet loss minimal opposed to existing FRR mechanisms.
Featured Image
Photo by Dimitri Karastelev on Unsplash
Why is it important?
We propose ShortCut, which augments FRR by locally removing reroute loops while maintaining protection to a link failure, largely agnostic to underlying FRR. ShortCut is enabled by data plane methods, but unlike convergence methods, is purely local, without (implicit) message exchange by, e.g., link reversals, and furthermore does not rely on packet loss TCP signaling, maintaining immediate protection. Hereby ShortCut expands the design space of hierarchical FRR and convergence schemes, placing itself as an intermediate layer between both.
Perspectives
Writing this article was a great pleasure as it has co-authors with whom I have had good relations but never had collaborations. This article also lead me to a greater involvement in the interesting FRR (Fast Reroute) research.
Dr. Apoorv Shukla
Huawei Technologies Co Ltd
Read the Original
This page is a summary of: Shortcutting Fast Failover Routes in the Data Plane, December 2021, ACM (Association for Computing Machinery),
DOI: 10.1145/3493425.3502751.
You can read the full text:
Resources
Contributors
The following have contributed to this page
