The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
Debugging the data plane with anteater
Abstract
Diagnosing problems in networks is a time-consuming and error-prone process. Existing tools to assist operators primarily focus on analyzing control plane configuration. Configuration analysis is limited in that it cannot find bugs in router software, and is harder to generalize across protocols since it must model complex configuration languages and dynamic protocol behavior.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
McKeown (2008) · doi:10.1145/1355734.1355746 · Cited by 8,513
Symbolic Model Checking without BDDs
Biere, A., Cimatti, A., Clarke, E., & Zhu, Y. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-49059-0_14 · Cited by 2,150
Measuring ISP topologies with rocketfuel
Spring, N., Mahajan, R., & Wetherall, D. (2002) · Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/633025.633039 · Cited by 1,256
Measuring ISP Topologies With Rocketfuel
Spring, N., Mahajan, R., Wetherall, D., & Anderson, T. (2004) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2003.822655 · Cited by 1,010
Understanding BGP misconfiguration
Mahajan, R., Wetherall, D., & Anderson, T. (2002) · Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/633025.633027 · Cited by 533
Generic Routing Encapsulation (GRE)
Farinacci, D., Li, T., Hanks, S., Meyer, D., & Traina, P. (2000) · doi:10.17487/rfc2784 · Cited by 504
Discovery of policy anomalies in distributed firewalls
Al-Shaer, E. S., & Hamed, H. (2005) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.2004.1354680 · Cited by 418
FIREMAN: a toolkit for firewall modeling and analysis
Yuan, L., Chen, H., Mai, J., Chuah, C.-N., Su, Z., & Mohapatra, P. (2006) · 2006 IEEE Symposium on Security and Privacy (S&P'06) · doi:10.1109/sp.2006.16 · Cited by 398
Boolector: An Efficient SMT Solver for Bit-Vectors and Arrays
Brummayer, R., & Biere, A. (2009) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-00768-2_16 · Cited by 369
Detecting BGP configuration faults with static analysis
Feamster, N., & Balakrishnan, H. (2005) · doi:10.5555/1251203.1251207 · Cited by 307
Cited by
Software-Defined Networking: A Comprehensive Survey
Kreutz, D., Ramos, F. M. V., Esteves Verissimo, P., Esteve Rothenberg, C., Azodolmolky, S., & Uhlig, S. (2015) · Proceedings of the IEEE · doi:10.1109/jproc.2014.2371999 · Cited by 5,050
A Survey of Software-Defined Networking: Past, Present, and Future of Programmable Networks
Nunes, B. A. A., Mendonca, M., Nguyen, X.-N., Obraczka, K., & Turletti, T. (2014) · IEEE Communications Surveys & Tutorials · doi:10.1109/surv.2014.012214.00180 · Cited by 2,203
A Survey on Software-Defined Networking
Xia, W., Wen, Y., Foh, C. H., Niyato, D., & Xie, H. (2015) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2014.2330903 · Cited by 1,096
Alur, R., Bodik, R., Juniwal, G., Martin, M. M. K., Raghothaman, M., Seshia, S. A., Singh, R., Solar-Lezama, A., Torlak, E., & Udupa, A. (2013) · 2013 Formal Methods in Computer-Aided Design · doi:10.1109/fmcad.2013.6679385 · Cited by 656
A Survey of Security in Software Defined Networks
Scott-Hayward, S., Natarajan, S., & Sezer, S. (2016) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2015.2453114 · Cited by 501
(2013) · doi:10.1145/2342441.2342452 · Cited by 426
“As argued in [19], verifying network correctness in the data plane offers several advantages over verifying higher-level code such as configuration files.”
InfluentialSelf-citationSoftware‐defined networking (SDN): a survey
Benzekki, K., El Fergougui, A., & Elbelrhiti Elalaoui, A. (2016) · Security and Communication Networks · doi:10.1002/sec.1737 · Cited by 405
SPHINX: Detecting Security Attacks in Software-Defined Networks
Dhawan, M., Poddar, R., Mahajan, K., & Mann, V. (2015) · Proceedings 2015 Network and Distributed System Security Symposium · doi:10.14722/ndss.2015.23064 · Cited by 378
NetKAT: semantic foundations for networks
Anderson, C. J., Foster, N., Guha, A., Jeannin, J.-B., Kozen, D., Schlesinger, C., & Walker, D. (2014) · Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages · doi:10.1145/2535838.2535862 · Cited by 373
Dynamic scheduling of network updates
Jin, X., Liu, H. H., Gandhi, R., Kandula, S., Mahajan, R., Zhang, M., Rexford, J., & Wattenhofer, R. (2014) · Proceedings of the 2014 ACM conference on SIGCOMM · doi:10.1145/2619239.2626307 · Cited by 329
(2014) · doi:10.5555/2616448.2616456 · Cited by 281
A general approach to network configuration verification
Beckett, R., Gupta, A., Mahajan, R., & Walker, D. (2017) · Proceedings of the Conference of the ACM Special Interest Group on Data Communication · doi:10.1145/3098822.3098834 · Cited by 262
Network configuration synthesis with abstract topologies
Beckett, R., Mahajan, R., Millstein, T., Padhye, J., & Walker, D. (2017) · Proceedings of the 38th ACM SIGPLAN Conference on Programming Language Design and Implementation · doi:10.1145/3062341.3062367 · Cited by 62
Automatic, verifiable and optimized policy-based security enforcement for SDN-aware IoT networks
Bringhenti, D., Yusupov, J., Zarca, A. M., Valenza, F., Sisto, R., Bernabe, J. B., & Skarmeta, A. (2022) · Computer Networks · doi:10.1016/j.comnet.2022.109123 · Cited by 26
Integrating verification and repair into the control plane
Gember-Jacobson, A., Raiciu, C., & Vanbever, L. (2017) · Proceedings of the 16th ACM Workshop on Hot Topics in Networks · doi:10.1145/3152434.3152439 · Cited by 7
“Feature coverage is not a problem for data plane veri-fiers [22,23,24,30,31,34], because they operate on the output of the actual control plane.”
Background
Metadata
- Authors
- Mai, H., Khurshid, A., Agarwal, R., Caesar, M., Godfrey, P. B., & King, S. T.
- Venue
- Proceedings of the ACM SIGCOMM 2011 conference
- Publisher
- ACM
- Published
- 2011-08-15
- Pages
- 290-301
- OpenAlex
- W2115526539
- Cited by
- 365
- References
- 24
- FWCI
- 21.14
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.