The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Infinite CacheFlow in software-defined networks
Abstract
Software-Defined Networking (SDN) enables fine-grained policies for firewalls, load balancers, routers, traffic monitoring, and other functionality. While Ternary Content Addressable Memory (TCAM) enables OpenFlow switches to process packets at high speed based on multiple header fields, today's commodity switches support just thousands to tens of thousands of rules. To realize the potential of SDN on this hardware, we need efficient ways to support the abstraction of a switch with arbitrarily large rule tables. To do so, we define a hardware-software hybrid switch design that relies on rule caching to provide large rule tables at low cost. Unlike traditional caching solutions, we neither cache individual rules (to respect rule dependencies) nor compress rules (to preserve the per-rule traffic counts). Instead we ``splice'' long dependency chains to cache smaller groups of rules while preserving the semantics of the network policy. Our design satisfies four core criteria: (1) elasticity (combining the best of hardware and software switches), (2) transparency (faithfully supporting native OpenFlow semantics, including traffic counters), (3) fine-grained rule caching (placing popular rules in the TCAM, despite dependencies on less-popular rules), and (4) adaptability (to enable incremental changes to the rule caching as the policy changes).
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
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: Control plane scalability issues and approaches in Software-Defined Networking (SDN)
Karakus, M., & Durresi, A. (2017) · Computer Networks · doi:10.1016/j.comnet.2016.11.017 · Cited by 373
Software Defined Networking Architecture, Security and Energy Efficiency: A Survey
Rawat, D. B., & Reddy, S. R. (2017) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2016.2618874 · Cited by 372
Optimizing the "one big switch" abstraction in software-defined networks
Kang, N., Liu, Z., Rexford, J., & Walker, D. (2013) · Proceedings of the ninth ACM conference on Emerging networking experiments and technologies · doi:10.1145/2535372.2535373 · Cited by 282
Self-citationHybrid SDN evolution: A comprehensive survey of the state-of-the-art
Khorsandroo, S., Sánchez, A. G., Tosun, A. S., Arco, J., & Doriguzzi-Corin, R. (2021) · Computer Networks · doi:10.1016/j.comnet.2021.107981 · Cited by 111
“The issue related to the capacity of SDN forwarding tables has been already investigated and tackled by leveraging the properties of the SDN paradigm [38], [39], [40].”
MethodSoftedgenet: SDN based energy-efficient distributed network architecture for edge computing
Sharma, P. K., Rathore, S., Jeong, Y.-S., & Park, J. H. (2018) · IEEE Communications Magazine · doi:10.1109/mcom.2018.1700822 · Cited by 67
Metadata
- Authors
- Katta, N., Alipourfard, O., Rexford, J., & Walker, D.
- Venue
- Proceedings of the third workshop on Hot topics in software defined networking
- Publisher
- ACM
- Published
- 2014-08-22
- Pages
- 175-180
- OpenAlex
- W2071552523
- Cited by
- 171
- References
- 1
- FWCI
- 17.65
- 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.