Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 194

The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.

Redundancy in network traffic: findings and implications

Anand, Ashok, Muthukrishnan, Chitra, Akella, Aditya, Ramjee, Ramachandran·2009·Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems

Abstract

A large amount of popular content is transferred repeatedly across network links in the Internet. In recent years, protocol-independent redundancy elimination, which can remove duplicate strings from within arbitrary network flows, has emerged as a powerful technique to improve the efficiency of network links in the face of repeated data. Many vendors offer such redundancy elimination middleboxes to improve the effective bandwidth of enterprise, data center and ISP links alike.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1145/1555349.1555355

Cites

1 of 1 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

  • Untitled work

    Schleimer, S., S, W. D., & Aiken, A. (2003) · Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data · doi:10.1145/872757.872770 · Cited by 1,099 · cited 6×

    “Winnowing, similar to the work by Man­ber [20], was also introduced in the context of identifying similar documents and can be easily adapted to identifying redundancy in network traf.c.”
    MethodInfluential

Show all 1 references

Cited by

See all 194

Metadata

Authors
Anand, A., Muthukrishnan, C., Akella, A., & Ramjee, R.
Venue
Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems
Publisher
ACM
Published
2009-06-15
Pages
37-48
OpenAlex
W2112939204
Cited by
194
References
1
FWCI
16.19
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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Redundancy in network traffic: findings and implications. https://app.cochat.ai/papers/10.1145/1555349.1555355
The paper
Anand, A., Muthukrishnan, C., Akella, A., & Ramjee, R. (2009). Redundancy in network traffic: findings and implications. Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems. https://doi.org/10.1145/1555349.1555355

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.