Learning to Identify Conflicts in RPKI
Haya Schulmann, Shujie Zhao

TL;DR
This paper introduces LOV, a mechanism for whitelisting benign RPKI conflicts, enabling networks to avoid filtering legitimate BGP routes and thus promoting RPKI deployment.
Contribution
The paper presents LOV, a novel whitelisting approach that identifies and allows benign RPKI conflicts at scale, reducing traffic loss and encouraging RPKI adoption.
Findings
Whitelisted 52,846 benign routes during six months of live measurement.
LOV effectively distinguishes benign conflicts from malicious ones.
Enabling RPKI deployment by reducing legitimate traffic loss.
Abstract
The long history of misconfigurations and errors in RPKI indicates that they cannot be easily avoided and will most probably persist also in the future. These errors create conflicts between BGP announcements and their covering ROAs, causing the RPKI validation to result in status invalid. Networks that enforce RPKI filtering with Route Origin Validation (ROV) would block such conflicting BGP announcements and as a result lose traffic from the corresponding origins. Since the business incentives of networks are tightly coupled with the traffic they relay, filtering legitimate traffic leads to a loss of revenue, reducing the motivation to filter invalid announcements with ROV. In this work, we introduce a new mechanism, LOV, designed for whitelisting benign conflicts on an Internet scale. The resulting whitelist is made available to RPKI supporting ASes to avoid filtering RPKI-invalid…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMulti-Agent Systems and Negotiation
