Network Specification Mining With High Fidelity, Scalability, and Readability
Network specification, which describes what an existing network is designed for, can help operators better understand and manage their networks, and is a critical pre-condition for network verification and synthesis tools to work. Existing tools for specification mining either cannot scale to large networks, or scale by sacrificing fidelity. Moreover, the specification contains a huge number of low-level intents (e.g., tens of thousands of pairwise reachability), making it hard for operators to read. To this end, this paper presents <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">NetMiner</i>, which can mine specification from network configurations, with high scalability, fidelity, and easier to read. The key idea of <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">NetMiner</i> is to faithfully simulate the network routing and forwarding behaviors with control plane simulators and data plane verifiers, so as to achieve high fidelity. Meanwhile, <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">NetMiner</i> improves the scalability by identifying relevant failure scenarios, and aggregating them to significantly reduce the number of needed simulations. Moreover, <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">NetMiner</i> clusters similar low-level intents into a high-level intent, to make the specification more concise and easier to read. Experiments using real configurations from a large cloud service provider and synthetic configurations show that <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">NetMiner</i> can mine specification <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$10\times $</tex-math> </inline-formula> faster, and reduce the number of intents by <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$100\times $</tex-math> </inline-formula>, compared to state-of-the-art tools.
Authors
- Chaoyang Ji (ORCID: https://orcid.org/0009-0008-3686-4464)
- Sisi Wen
- Hao Li (ORCID: https://orcid.org/0000-0001-8776-6911)
- Yongqiang Yang (ORCID: https://orcid.org/0000-0001-9733-4346)
- Peng Zhang (ORCID: https://orcid.org/0000-0001-7721-2675)
- Nathan Jihoon Kang
Institutions
- Huawei Technologies (China) (CN)
- Xi'an Jiaotong University (CN)
Publication Details
- Journal
- IEEE Transactions on Networking
- Published
- 2025-09-24
- DOI
- https://doi.org/10.1109/ton.2025.3607440
- Primary Topic
- Software System Performance and Reliability
- Type
- article
- Field-Weighted Citation Impact
- 0.00