Affiliation:
1. University of Adelaide, Adelaide, Australia
Abstract
Routing oscillation is highly detrimental. It can decrease performance and lead to a high level of update churn placing unnecessary workload on router the problem is distributed between many providers. However, iBGP --- the routing protocol used to distribute routes inside a single Autonomous System --- has also been shown to oscillate. Despite the fact that iBGP is configured by a single provider according to apparently straight forward rules, more than eight years of research has not solved the problem of iBGP oscillation. Various solutions have been proposed but they all lack critical features: either they are complicated to implement, restrict routing flexibility, or lack guarantees of stability. In this paper we propose a very simple adaptation to the BGP decision process. Despite its simplicity and negligible cost we prove algebraically that it prevents iBGP oscillation. We extend the idea to provide routing flexibility, such as respecting the MED attribute, without sacrificing network stability.
Publisher
Association for Computing Machinery (ACM)
Subject
Computer Networks and Communications,Software
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. From Non-Optimal Routing Protocols to Routing on Multiple Optimality Criteria;IEEE/ACM Transactions on Networking;2023-02
2. Eliminating Routing Loops and Oscillations in BGP Using Total Ordering;2022 IEEE 47th Conference on Local Computer Networks (LCN);2022-09-26
3. QoS Routing Using Dominant-Distance Vectors;2022 IEEE/ACM 30th International Symposium on Quality of Service (IWQoS);2022-06-10
4. Path stability in partially deployed secure BGP routing;Computer Networks;2022-04
5. Routing on Multiple Optimality Criteria;Proceedings of the Annual conference of the ACM Special Interest Group on Data Communication on the applications, technologies, architectures, and protocols for computer communication;2020-07-30