The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
Multicast-based inference of network-internal loss characteristics
Abstract
Robust measurements of network dynamics are increasingly important to the design and operation of large internetworks like the Internet. However, administrative diversity makes it impractical to monitor every link on an end-to-end path. At the same time, it is difficult to determine the performance characteristics of individual links from end-to-end measurements of unicast traffic. In this paper, we introduce the use of end-to-end measurements of multicast traffic to infer network-internal characteristics. The bandwidth efficiency of multicast traffic makes it suitable for large-scale measurements of both end-to-end and internal network dynamics. We develop a maximum-likelihood estimator for loss rates on internal links based on losses observed by multicast receivers. It exploits the inherent correlation between such observations to infer the performance of paths between branch points in the tree spanning a multicast source and its receivers. We derive its rate of convergence as the number of measurements increases, and we establish robustness with respect to certain generalizations of the underlying model. We validate these techniques through simulation and discuss possible extensions and applications of this work
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
Rudin, W. (1973) · Cited by 13,740
Random early detection gateways for congestion avoidance
Floyd, S., & Jacobson, V. (1993) · IEEE/ACM Transactions on Networking · doi:10.1109/90.251892 · Cited by 6,290
Congestion avoidance and control
Jacobson, V. (1995) · ACM SIGCOMM Computer Communication Review · doi:10.1145/205447.205462 · Cited by 5,301
Markov Chains and Stochastic Stability
Meyn, S. P., & Tweedie, R. L. (1993) · Springer eBooks · doi:10.1007/978-1-4471-3267-7 · Cited by 5,041
Ziegel, E. R., Lehmann, E. L., & Casella, G. (1999) · Technometrics · doi:10.2307/1270597 · Cited by 4,203
Large Deviations Techniques and Applications
Schmock, U., Dembo, A., & Zeitouni, O. (2000) · Journal of the American Statistical Association · doi:10.2307/2669805 · Cited by 3,524
(2011) · SpringerReference · doi:10.1007/springerreference_27387 · Cited by 3,053
Congestion avoidance and control
Jacobson, V. (1988) · Symposium proceedings on Communications architectures and protocols · doi:10.1145/52324.52356 · Cited by 2,479
Postel, J. (1981) · doi:10.17487/rfc0793 · Cited by 2,122
Lehmann, E. L. (1983) · Springer eBooks · doi:10.1007/978-1-4757-2769-2 · Cited by 1,356
Cited by
Coates, A., Hero III, A. O., Nowak, R., & Yu, B. (2002) · IEEE Signal Processing Magazine · doi:10.1109/79.998081 · Cited by 529
iPlane: an information plane for distributed services
Madhyastha, H. V., Isdal, T., Piatek, M., Dixon, C., Anderson, T. E., Krishnamurthy, A., & Venkataramani, A. (2006) · doi:10.5555/1298455.1298490 · Cited by 526
Network Tomography: Recent Developments
Castro, R., Coates, M., Liang, G., Nowak, R., & Yu, B. (2004) · Statistical Science · doi:10.1214/088342304000000422 · Cited by 433
Trajectory sampling for direct traffic observation
Duffield, N. G., & Grossglauser, M. (2001) · IEEE/ACM Transactions on Networking · doi:10.1109/90.929851 · Cited by 260
Metadata
- Authors
- Cascares, Duffield, Horowitz, & Towsley
- Venue
- IEEE Transactions on Information Theory
- Published
- 1999-11
- Volume
- 45
- Issue
- 7
- Pages
- 2462-2480
- ISSN
- 0018-9448 (ISSN-L)
- OpenAlex
- W2163935672
- Cited by
- 410
- References
- 19
- FWCI
- 30.92
- 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: Multicast-based inference of network-internal loss characteristics. https://app.cochat.ai/papers/10.1109/18.796384
- The paper
- Cascares, Duffield, Horowitz, & Towsley. (1999). Multicast-based inference of network-internal loss characteristics. IEEE Transactions on Information Theory. https://doi.org/10.1109/18.796384
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.