The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Maximum pseudo likelihood estimation in network tomography
Abstract
Network monitoring and diagnosis are key to improving network performance. The difficulties of performance monitoring lie in today's fast growing Internet, accompanied by increasingly heterogeneous and unregulated structures. Moreover, these tasks become even harder since one cannot rely on the collaboration of individual routers and servers to measure network traffic directly. Even though the aggregative nature of possible network measurements gives rise to inverse problems, existing methods for solving inverse problems are usually computationally intractable or statistically inefficient. A pseudo likelihood approach is proposed to solve a group of network tomography problems. The basic idea of pseudo likelihood is to form simple subproblems and ignore the dependences among the subproblems to form a product likelihood of the subproblems. As a result, this approach keeps a good balance between the computational complexity and the statistical efficiency of the parameter estimation. Some statistical properties of the pseudo likelihood estimator, such as consistency and asymptotic normality, are established. A pseudo expectation-maximization (EM) algorithm is developed to maximize the pseudo log-likelihood function. Two examples, with simulated or real data, are used to illustrate the pseudo likelihood proposal: 1) inference of the internal link delay distributions through multicast end-to-end measurements; 2) origin-destination matrix estimation through link traffic counts.
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
Cites
$I$-Divergence Geometry of Probability Distributions and Minimization Problems
Csiszar, I. (1975) · The Annals of Probability · doi:10.1214/aop/1176996454 · Cited by 1,645
Cited by
An overview of composite likelihood methods
Varin, C., Reid, N. M., & Firth, D. (2011) · doi:10.82444/warw.33615778 · Cited by 868
Network Tomography: Recent Developments
Castro, R., Coates, M., Liang, G., Nowak, R., & Yu, B. (2004) · Statistical Science · doi:10.1214/088342304000000422 · Cited by 433
Self-citationOn composite marginal likelihoods
Varin, C. (2008) · AStA Advances in Statistical Analysis · doi:10.1007/s10182-008-0060-7 · Cited by 326
An information-theoretic approach to traffic matrix estimation
Zhang, Y., Roughan, M., Lund, C., & Donoho, D. (2003) · Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/863955.863990 · Cited by 303
Predicting future traffic using Hidden Markov Models
Chen, Z., Wen, J., & Geng, Y. (2016) · 2016 IEEE 24th International Conference on Network Protocols (ICNP) · doi:10.1109/icnp.2016.7785328 · Cited by 72
Metadata
- Authors
- Liang, G., & Yu, B.
- Venue
- IEEE Transactions on Signal Processing
- Published
- 2003-08
- Volume
- 51
- Issue
- 8
- Pages
- 2043-2053
- ISSN
- 1053-587X (ISSN-L)
- OpenAlex
- W2002677656
- Cited by
- 165
- References
- 1
- FWCI
- 13.53
- 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: Maximum pseudo likelihood estimation in network tomography. https://app.cochat.ai/papers/10.1109/tsp.2003.814464
- The paper
- Liang, G., & Yu, B. (2003). Maximum pseudo likelihood estimation in network tomography. IEEE Transactions on Signal Processing. https://doi.org/10.1109/tsp.2003.814464
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.