The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
On the constancy of internet path properties
Abstract
Many Internet protocols and operational procedures use measurements to guide future actions. This is an effective strategy if the quantities being measured exhibit a degree of constancy: that is, in some fundamental sense, they are not changing. In this paper we explore three different notions of constancy: mathematical, operational, and predictive. Using a large measurement dataset gathered from the NIMI infrastructure, we then apply these notions to three Internet path properties: loss, delay, and throughput. Our aim is to provide guidance as to when assumptions of various forms of constancy are sound, versus when they might prove misleading.
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
Cites
Nonparametric Statistics for the Behavioral Sciences
Guitton, H., & Siegel, S. (1958) · Revue économique · doi:10.2307/3498751 · Cited by 35,245
On a measure of lack of fit in time series models
LJUNG, G. M., & BOX, G. E. P. (1978) · Biometrika · doi:10.1093/biomet/65.2.297 · Cited by 6,668
Congestion avoidance and control
Jacobson, V. (1995) · ACM SIGCOMM Computer Communication Review · doi:10.1145/205447.205462 · Cited by 5,301
Wide area traffic: the failure of Poisson modeling
Paxson, V., & Floyd, S. (1995) · IEEE/ACM Transactions on Networking · doi:10.1109/90.392383 · Cited by 3,708
Non-Parametric Statistics for the Behavioral Sciences.
Stuart, A., & Siegel, S. (1957) · Economica · doi:10.2307/2551606 · Cited by 3,383
Mathematical Statistics and Data Analysis
Rabinowitz, L. (1989) · Technometrics · doi:10.1080/00401706.1989.10488573 · Cited by 3,116
Capacity of a Burst-Noise Channel
Gilbert, E. N. (1960) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1960.tb03959.x · Cited by 2,313
Koziol, J. A., D'Agostino, R. B., & Stephens, M. A. (1987) · Journal of Educational Statistics · doi:10.2307/1165059 · Cited by 1,982
Equation-based congestion control for unicast applications
Floyd, S., Handley, M., Padhye, J., & Widmer, J. (2000) · ACM SIGCOMM Computer Communication Review · doi:10.1145/347057.347397 · Cited by 1,414
Receiver-driven layered multicast
McCanne, S., Jacobson, V., & Vetterli, M. (1996) · Conference proceedings on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/248156.248168 · Cited by 1,195
Cited by
CUBIC: a new TCP-friendly high-speed TCP variant
Ha, S., Rhee, I., & Xu, L. (2008) · ACM SIGOPS Operating Systems Review · doi:10.1145/1400097.1400105 · Cited by 2,287
CS2P: Improving Video Bitrate Selection and Adaptation with Data-Driven Throughput Prediction
Sun, Y., Yin, X., Jiang, J., Sekar, V., Lin, F., Wang, N., Liu, T., & Sinopoli, B. (2016) · Proceedings of the 2016 ACM SIGCOMM Conference · doi:10.1145/2934872.2934898 · Cited by 407
A Machine Learning Approach to TCP Throughput Prediction
Mirza, M., Sommers, J., Barford, P., & Zhu, X. (2010) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2009.2037812 · Cited by 132
Metadata
- Authors
- Zhang, Y., & Duffield, N.
- Venue
- Proceedings of the First ACM SIGCOMM Workshop on Internet Measurement - IMW '01
- Publisher
- ACM Press
- Published
- 2001
- Pages
- 197
- OpenAlex
- W2116398767
- Cited by
- 466
- References
- 17
- Type
- conference abstract
- 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: On the constancy of internet path properties. https://app.cochat.ai/papers/10.1145/505202.505228
- The paper
- Zhang, Y., & Duffield, N. (2001). On the constancy of internet path properties. Proceedings of the First ACM SIGCOMM Workshop on Internet Measurement - IMW '01. https://doi.org/10.1145/505202.505228
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.
