Exploring Multiple Converged States of Network Configurations
Shunyu Yang, Dan Wang, Peng Zhang

TL;DR
This paper investigates the non-deterministic convergence behavior of networks under BGP, proving the existence of critical links that influence stable states and proposing an efficient method to verify non-determinism.
Contribution
It introduces a theoretical proof of critical links affecting network convergence and proposes a practical, low-complexity verification method for non-determinism in networks.
Findings
Critical links determine network stable states.
The proposed method has O(n) complexity for verification.
In real-world cases, non-determinism can be efficiently checked.
Abstract
Due to the policy-rich BGP, multiple stable forwarding states might exist for the same network topology and configuration, rendering the network convergence non-deterministic. This paper proves that any network with multiple converged states possesses a specific set of critical links which, when flipped (disconnect then reconnect), shifts the network between different stable states. We establish this result under the Stable Path Problem (SPP) framework, and also examine a real-world corner case where SPP doesn't apply. Building on this theoretical foundation, we propose a tentative theoretical verification method for non-determinism with complexity, where is the number of edges in a network. Specifically, we separately flip each link in the network and observe whether new converged states emerge. If no new states are discovered, the network is guaranteed to be free of…
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
TopicsSoftware-Defined Networks and 5G · Complex Network Analysis Techniques · Network Traffic and Congestion Control
