The DOI matches its Crossref record; 25 of the 25 references it cites were found in a registry or an index.
On consistent updates in software defined networks
Abstract
We argue for the development of efficient methods to update the data plane state of an SDN, while maintaining desired consistency properties (e.g., no packet should be dropped). We highlight the inherent trade-off between the strength of the consistency property and dependencies it imposes among rules at different switches; these dependencies fundamentally limit how quickly data plane can be updated. For one basic consistency property---no packet should loop---we develop an update algorithm that has provably minimal dependency structure. We also sketch a general architecture for consistent updates that separates the twin concerns of consistency and efficiency.
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
Depth-First Search and Linear Graph Algorithms
Tarjan, R. (1972) · SIAM Journal on Computing · doi:10.1137/0201010 · Cited by 6,081
B4: experience with a globally-deployed software defined wan
Jain, S., Kumar, A., Mandal, S., Ong, J., Poutievski, L., Singh, A., Venkata, S., Wanderer, J., Zhou, J., Zhu, M., et al. (2013) · Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM · doi:10.1145/2486001.2486019 · Cited by 1,771
NOX: towards an operating system for networks
Gude, N., Koponen, T., Pettit, J., Pfaff, B., Casado, M., McKeown, N., & Shenker, S. (2008) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1384609.1384625 · Cited by 1,446
Onix: a distributed control platform for large-scale production networks
Koponen, T., Casado, M., Gude, N. S., Stribling, J., Poutievski, L., Zhu, M., Ramanathan, R., Iwata, Y., Inoue, H., Hama, T., et al. (2010) · doi:10.5555/1924943.1924968 · Cited by 1,212
Achieving high utilization with software-driven WAN
Hong, C.-Y., Kandula, S., Mahajan, R., Zhang, M., Gill, V., Nanduri, M., & Wattenhofer, R. (2013) · Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM · doi:10.1145/2486001.2486012 · Cited by 1,057
Self-citationDevoFlow: scaling flow management for high-performance networks
Curtis, A. R., Mogul, J. C., Tourrilhes, J., Yalagandula, P., Sharma, P., & Banerjee, S. (2011) · Proceedings of the ACM SIGCOMM 2011 conference · doi:10.1145/2018436.2018466 · Cited by 959
Ethane: taking control of the enterprise
Casado, M., Freedman, M. J., Pettit, J., Luo, J., McKeown, N., & Shenker, S. (2007) · Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/1282380.1282382 · Cited by 754
A clean slate 4D approach to network control and management
Greenberg, A., Hjalmtysson, G., Maltz, D. A., Myers, A., Rexford, J., Xie, G., Yan, H., Zhan, J., & Zhang, H. (2005) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1096536.1096541 · Cited by 650
Frenetic: a network programming language
Foster, N., Harrison, R., Freedman, M. J., Monsanto, C., Rexford, J., Story, A., & Walker, D. (2011) · ACM SIGPLAN Notices · doi:10.1145/2034574.2034812 · Cited by 584
Abstractions for network update
Reitblatt, M., Foster, N., Rexford, J., Schlesinger, C., & Walker, D. (2012) · Proceedings of the ACM SIGCOMM 2012 conference on Applications, technologies, architectures, and protocols for computer communication · doi:10.1145/2342356.2342427 · Cited by 584
OpenFlow-based server load balancing gone wild
Wang, R., Butnariu, D., & Rexford, J. (2011) · USENIX conference on Hot topics in management of internet, cloud, and enterprise networks and services · Cited by 450
Characterization of failures in an IP backbone
Markopoulou, A., Iannaccone, G., Bhattacharyya, S., Chuah, C.-N., & Diot, C. (2005) · IEEE INFOCOM 2004 · doi:10.1109/infcom.2004.1354653 · Cited by 430
Design and implementation of a routing control platform
Caesar, M., Caldwell, D., & Shaikh, A. (2005) · Cited by 395
Ethane: taking control of the enterprise
Casado, M., Freedman, M. J., Pettit, J., Luo, J., McKeown, N., & Shenker, S. (2007) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1282427.1282382 · Cited by 373
A compiler and run-time system for network programming languages
Monsanto, C., Foster, N., Harrison, R., & Walker, D. (2012) · ACM SIGPLAN Notices · doi:10.1145/2103621.2103685 · Cited by 201
Incremental consistent updates
Katta, N. P., Rexford, J., & Walker, D. (2013) · Proceedings of the second ACM SIGCOMM workshop on Hot topics in software defined networking · doi:10.1145/2491185.2491191 · Cited by 195
Disruption Free Topology Reconfiguration in OSPF Networks
Francois, P., Shand, M., & Bonaventure, O. (2007) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.2007.19 · Cited by 114
Consensus routing: the internet as a distributed system
John, J. P., Katz-Bassett, E., Krishnamurthy, A., Anderson, T. E., & Venkataramani, A. (2008) · Cited by 94
Seamless network-wide IGP migrations
Vanbever, L., Vissicchio, S., Pelsser, C., François, P., & Bonaventure, O. (2011) · ACM SIGCOMM Conference (SIGCOMM) · doi:10.1145/2018436.2018473 · Cited by 72
Nettle: Functional Reactive Programming for OpenFlow Networks
Voellmy, A., Agarwal, A., & Hudak, P. (2010) · doi:10.21236/ada555162 · Cited by 61
Avoiding disruptions during maintenance operations on BGP sessions
Francois, P., Bonaventure, O., Decraene, B., & Coste, P.-A. (2007) · IEEE Transactions on Network and Service Management · doi:10.1109/tnsm.2007.021102 · Cited by 49
Lossless migrations of link-state IGPs
Vanbever, L., Vissicchio, S., Pelsser, C., Francois, P., & Bonaventure, O. (2012) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2012.2190767 · Cited by 46
Raza, S. A., Zhu, Y., & Chuah, C. (2009) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.2009.5061932 · Cited by 16
A Consistency Management Layer for Inter-Domain Routing
Kushman, N., Katabi, D., & Wroclawski, J. T. (2006) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 10
Cited by
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
Network Innovation using OpenFlow: A Survey
Lara, A., Kolasani, A., & Ramamurthy, B. (2014) · IEEE Communications Surveys & Tutorials · doi:10.1109/surv.2013.081313.00105 · Cited by 622
Abstractions for network update
Reitblatt, M., Foster, N., Rexford, J., Schlesinger, C., & Walker, D. (2012) · Proceedings of the ACM SIGCOMM 2012 conference on Applications, technologies, architectures, and protocols for computer communication · doi:10.1145/2342356.2342427 · Cited by 584
A roadmap for traffic engineering in SDN-OpenFlow networks
Akyildiz, I. F., Lee, A., Wang, P., Luo, M., & Chou, W. (2014) · Computer Networks · doi:10.1016/j.comnet.2014.06.002 · Cited by 536
A security enforcement kernel for OpenFlow networks
Porras, P., Shin, S., Yegneswaran, V., Fong, M., Tyson, M., & Gu, G. (2012) · Proceedings of the first workshop on Hot topics in software defined networks · doi:10.1145/2342441.2342466 · Cited by 529
Metadata
- Authors
- Mahajan, R., & Wattenhofer, R.
- Venue
- Proceedings of the Twelfth ACM Workshop on Hot Topics in Networks
- Publisher
- ACM
- Published
- 2013-11-21
- Pages
- 1-7
- OpenAlex
- W2068384525
- Cited by
- 301
- References
- 25
- FWCI
- 34.12
- 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.