UPEA: A Novel BGP Convergence Verification Algorithm with Zero False Positives and Minimal False Negatives

The Border Gateway Protocol (BGP) is the core routing protocol for inter-domain routing, providing substantial flexibility but lacking convergence guarantees, which can lead to network oscillations and instability. Despite prior research proposing various methods to address these issues, existing algorithms still fall short in terms of accuracy and efficiency.In this paper, we introduce a novel and efficient algorithm that statically analyzes BGP configurations to accurately determine routing convergence. Our algorithm achieves several major advancements:•Superior Accuracy: It outperforms the state-of-the-art algorithm by correctly identifying a broader range of configurations.•Scalability: It is highly efficient, capable of analyzing Internet-scale configurations within polynomial time complexity.•Reliability: It eliminates false positives, ensuring that potentially oscillating configurations are never incorrectly reported as convergence.Our experimental results demonstrate that the proposed algorithm significantly enhances accuracy and efficiency compared to existing methods, making it highly suitable for large-scale Internet applications. This work represents a substantial step forward in ensuring the stability and reliability of BGP routing, addressing critical challenges in modern Internet infrastructure.