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
Locating internet routing instabilities
Feldmann, A., Maennel, O., Mao, Z. M., Berger, A., & Maggs, B. (2004) · Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/1015467.1015491 · Cited by 252
On static reachability analysis of IP networks
Xie, G. G., Zhan, J., Maltz, D. A., Zhang, H., Greenberg, A., Hjalmtysson, G., & Rexford, J. (2005) · Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies. · doi:10.1109/infcom.2005.1498492 · Cited by 214
SherLog: error diagnosis by connecting clues from run-time logs
Yuan, D., Mai, H., Xiong, W., Tan, L., Zhou, Y., & Pasupathy, S. (2010) · ACM SIGARCH Computer Architecture News · doi:10.1145/1735970.1736038 · Cited by 212
Self-citationGoodell, G., Aiello, W. A., Griffin, T. G., Ioannidis, J. P. A., McDaniel, P. D., & Rubin, A. D. (2003) · UCL Discovery (University College London) · Cited by 197
Unraveling the complexity of network management
Benson, T., Akella, A., & Maltz, D. A. (2009) · Cited by 181
SherLog: error diagnosis by connecting clues from run-time logs
Yuan, D., Mai, H., Xiong, W., Tan, L., Zhou, Y., & Pasupathy, S. (2010) · Proceedings of the fifteenth International Conference on Architectural support for programming languages and operating systems · doi:10.1145/1736020.1736038 · Cited by 176
Self-citationAccurate Real-time Identification of IP Prefix Hijacking
Hu, X., & Mao, Z. M. (2007) · 2007 IEEE Symposium on Security and Privacy (SP '07) · doi:10.1109/sp.2007.7 · Cited by 172
D 3 S: debugging deployed distributed systems
Liu, X., Guo, Z., Wang, X., Chen, F., Lian, X., Tang, J., Wu, M., Kaashoek, M. F., & Zhang, Z. (2008) · Networked Systems Design and Implementation · Cited by 156
Finding a needle in a haystack: pinpointing significant BGP routing changes in an IP network
Wu, J., Mao, Z. M., Rexford, J., & Wang, J. (2005) · doi:10.5555/1251203.1251204 · Cited by 127
Silveira, F., Diot, C., Taft, N., & Govindan, R. (2010) · ACM SIGCOMM Conference (SIGCOMM) · doi:10.1145/1851182.1851215 · Cited by 68
Towards optimal sampling for flow size estimation
Tune, P., & Veitch, D. (2008) · ACM Internet Measurement Conference (IMC) · doi:10.1145/1452520.1452550 · Cited by 44
Roscoe, T., Hand, S., Isaacs, R., Mortier, R., & Jardetzky, P. (2003) · ACM SIGCOMM Computer Communication Review · doi:10.1145/774763.774773 · Cited by 39
Towards understanding bugs in open source router software
Yin, Z., Caesar, M., & Zhou, Y. (2010) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1823844.1823849 · Cited by 31
Self-citation
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
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.