Network Specification Mining With High Fidelity, Scalability, and Readability

Author:  
Ning Kang Peng Zhang
Li Hao
Wen Sisi
Ji Chaoyang
, and 
Yang Yongqiang
IEEE Transactions on Networking

People

Ning Kang
Ph.D. Candidate
Peng Zhang
Professor

Abstract

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 NetMiner, which can mine specification from network configurations, with high scalability, fidelity, and easier to read. The key idea of NetMiner 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, NetMiner improves the scalability by identifying relevant failure scenarios, and aggregating them to significantly reduce the number of needed simulations. Moreover, NetMiner 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 NetMiner can mine specification 10× faster, and reduce the number of intents by 100×, compared to state-of-the-art tools.
Research Area:
Mining

Resources

BibTeX

@ARTICLE{11178104,
  author={Kang, Ning and Zhang, Peng and Li, Hao and Wen, Sisi and Ji, Chaoyang and Yang, Yongqiang},
  journal={IEEE Transactions on Networking}, 
  title={Network Specification Mining With High Fidelity, Scalability, and Readability}, 
  year={2025},
  volume={},
  number={},
  pages={1-16},
  keywords={Topology;Network topology;Scalability;Routing;Costs;Computational modeling;Data mining;Analytical models;Data models;Complexity theory;Specification;scalability;fidelity;readability},
  doi={10.1109/TON.2025.3607440}}