The DOI matches its Crossref record.
Dynamic load balancing without packet reordering
Abstract
Dynamic load balancing is a popular recent technique that protects ISP networks from sudden congestion caused by load spikes or link failures. Dynamic load balancing protocols, however, require schemes for splitting traffic across multiple paths at a fine granularity. Current splitting schemes present a tussle between slicing granularity and packet reordering. Splitting traffic at the granularity of packets quickly and accurately assigns the desired traffic share to each path, but can reorder packets within a TCP flow, confusing TCP congestion control. Splitting traffic at the granularity of a flow avoids packet reordering but may overshoot the desired shares by up to 60% in dynamic environments, resulting in low end-to-end network goodput Contrary to popular belief, we show that one can systematically split a single flow across multiple paths without causing packet reordering. We propose FLARE, a new traffic splitting algorithm that operates on bursts of packets, carefully chosen to avoid reordering. Using a combination of analysis and trace-driven simulations, we show that FLARE attains accuracy and responsiveness comparable to packet switching without reordering packets. FLARE is simple and can be implemented with a few KB of router state
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
(2010) · doi:10.5555/1855711.1855728 · Cited by 970
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
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
An overview of Internet of Things (IoT): Architectural aspects, challenges, and protocols
Gupta, B. B., & Quamara, M. (2020) · Concurrency and Computation: Practice and Experience · doi:10.1002/cpe.4946 · Cited by 493
A Survey on Data Center Networking (DCN): Infrastructure and Operations
Xia, W., Zhao, P., Wen, Y., & Xie, H. (2017) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2016.2626784 · Cited by 267
Metadata
- Authors
- Kandula, S., Katabi, D., Sinha, S., & Berger, A.
- Venue
- ACM SIGCOMM Computer Communication Review
- Published
- 2007-03-20
- Volume
- 37
- Issue
- 2
- Pages
- 51-62
- ISSN
- 0146-4833 (ISSN-L)
- OpenAlex
- W2062362478
- Cited by
- 402
- References
- 0
- FWCI
- 24.41
- Type
- journal article
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Dynamic load balancing without packet reordering. https://app.cochat.ai/papers/10.1145/1232919.1232925
- The paper
- Kandula, S., Katabi, D., Sinha, S., & Berger, A. (2007). Dynamic load balancing without packet reordering. ACM SIGCOMM Computer Communication Review. https://doi.org/10.1145/1232919.1232925
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.