The DOI matches its Crossref record.
Incremental consistent updates
Open accessAbstract
A consistent update installs a new packet-forwarding policy across the switches of a software-defined network in place of an old policy. While doing so, such an update guarantees that every packet entering the network either obeys the old policy or the new one, but not some combination of the two. In this paper, we introduce new algorithms that trade the time required to perform a consistent update against the rule-space overhead required to implement it. We break an update in to k rounds that each transfer part of the traffic to the new configuration. The more rounds used, the slower the update, but the smaller the rule-space overhead. To ensure consistency, our algorithm analyzes the dependencies between rules in the old and new policies to determine which rules to add and remove on each round. In addition, we show how to optimize rule space used by representing the minimization problem as a mixed integer linear program. Moreover, to ensure the largest flows are moved first, while using rule space efficiently, we extend the mixed integer linear program with additional constraints. Our initial experiments show that a 6-round, optimized incremental update decreases rule space overhead from 100% to less than 10%. Moreover, if we cap the maximum rule-space overhead at 5% and assume the traffic flow volume follows Zipf's law, we find that 80% of the traffic may be transferred to the new policy in the first round and 99% in the first 3 rounds.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Cited by
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
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
Software-Defined Networking: A survey
Farhady, H., Lee, H., & Nakao, A. (2015) · Computer Networks · doi:10.1016/j.comnet.2015.02.014 · Cited by 347
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
Self-citationOn consistent updates in software defined networks
Mahajan, R., & Wattenhofer, R. (2013) · Proceedings of the Twelfth ACM Workshop on Hot Topics in Networks · doi:10.1145/2535771.2535791 · Cited by 301
Metadata
- Authors
- Katta, N. P., Rexford, J., & Walker, D.
- Venue
- Proceedings of the second ACM SIGCOMM workshop on Hot topics in software defined networking
- Publisher
- ACM
- Published
- 2013-08-16
- Pages
- 49-54
- OpenAlex
- W2071580597
- Cited by
- 195
- References
- 0
- FWCI
- 22.57
- Type
- conference paper
- Language
- en
- Open access
- gold
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Incremental consistent updates. https://app.cochat.ai/papers/10.1145/2491185.2491191
- The paper
- Katta, N. P., Rexford, J., & Walker, D. (2013). Incremental consistent updates. Proceedings of the second ACM SIGCOMM workshop on Hot topics in software defined networking. https://doi.org/10.1145/2491185.2491191
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.