The DOI matches its Crossref record.
Estimating point-to-point and point-to-multipoint traffic matrices: an information-theoretic approach
Abstract
Traffic matrices are required inputs for many IP network management tasks, such as capacity planning, traffic engineering, and network reliability analysis. However, it is difficult to measure these matrices directly in large operational IP networks, so there has been recent interest in inferring traffic matrices from link measurements and other more easily measured data. Typically, this inference problem is ill-posed, as it involves significantly more unknowns than data. Experience in many scientific and engineering fields has shown that it is essential to approach such ill-posed problems via "regularization". This paper presents a new approach to traffic matrix estimation using a regularization based on "entropy penalization". Our solution chooses the traffic matrix consistent with the measured data that is information-theoretically closest to a model in which source/destination pairs are stochastically independent. It applies to both point-to-point and point-to-multipoint traffic matrix estimation. We use fast algorithms based on modern convex optimization theory to solve for our traffic matrices. We evaluate our algorithm with real backbone traffic and routing data, and demonstrate that it is fast, accurate, robust, and flexible.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Bayesian Neural Networks for Internet Traffic Classification
Auld, T., Moore, A. W., & Gull, S. F. (2007) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2006.883010 · Cited by 494
Spatio-Temporal Compressive Sensing and Internet Traffic Matrices (Extended Version)
Roughan, M., Zhang, Y., Willinger, W., & Qiu, L. (2012) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2011.2169424 · Cited by 267
Self-citation
Metadata
- Authors
- Zhang, Y., Roughan, M., Lund, C., & Donoho, D. L.
- Venue
- IEEE/ACM Transactions on Networking
- Published
- 2005-10
- Volume
- 13
- Issue
- 5
- Pages
- 947-960
- ISSN
- 1063-6692 (ISSN-L)
- OpenAlex
- W2115829001
- Cited by
- 185
- References
- 0
- FWCI
- 20.45
- 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: Estimating point-to-point and point-to-multipoint traffic matrices: an information-theoretic approach. https://app.cochat.ai/papers/10.1109/tnet.2005.857115
- The paper
- Zhang, Y., Roughan, M., Lund, C., & Donoho, D. L. (2005). Estimating point-to-point and point-to-multipoint traffic matrices: an information-theoretic approach. IEEE/ACM Transactions on Networking. https://doi.org/10.1109/tnet.2005.857115
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.