The DOI matches its Crossref record; 33 of the 33 references it cites were found in a registry or an index.
Network Tomography: Recent Developments
Open accessAbstract
Today’s Internet is a massive, distributed network which continues to explode in size as e-commerce and related activities grow. The heterogeneous and largely unregulated structure of the Internet renders tasks such as dynamic routing, optimized service provision, service level verification and detection of anomalous/malicious behavior extremely challenging. The problem is compounded by the fact that one cannot rely on the cooperation of individual servers and routers to aid in the collection of network traffic measurements vital for these tasks. In many ways, network monitoring and inference problems bear a strong resemblance to other “inverse problems” in which key aspects of a system are not directly observable. Familiar signal processing or statistical problems such as tomographic image reconstruction and phylogenetic tree identification have interesting connections to those arising in networking. This article introduces network tomography, a new field which we believe will benefit greatly from the wealth of statistical theory and algorithms. It focuses especially on recent developments in the field including the application of pseudo-likelihood methods and tree estimation formulations.
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
Hierarchical Grouping to Optimize an Objective Function
Ward, J. H. (1963) · Journal of the American Statistical Association · doi:10.1080/01621459.1963.10500845 · Cited by 20,598
Monte Carlo sampling methods using Markov chains and their applications.
Hastings, W. K. (1970) · Biometrika · doi:10.1093/biomet/57.1.97 · Cited by 15,195
R: A Language for Data Analysis and Graphics
Ihaka, R., & Gentleman, R. (1996) · Journal of Computational and Graphical Statistics · doi:10.1080/10618600.1996.10474713 · Cited by 11,220
Spatial Interaction and the Statistical Analysis of Lattice Systems
Besag, J. (1974) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1974.tb00999.x · Cited by 6,067
Monte Carlo Statistical Methods
Kim, H. (2000) · Technometrics · doi:10.1080/00401706.2000.10485722 · Cited by 5,508
On the self-similar nature of Ethernet traffic (extended version)
Leland, W. E., Taqqu, M. S., Willinger, W., & Wilson, D. V. (1994) · IEEE/ACM Transactions on Networking · doi:10.1109/90.282603 · Cited by 5,233
BIRCH: an efficient data clustering method for very large databases
Zhang, T., Ramakrishnan, R., & Livny, M. (1996) · Proceedings of the 1996 ACM SIGMOD international conference on Management of data - SIGMOD '96 · doi:10.1145/233269.233324 · Cited by 3,935
Multivariate Density Estimation: Theory, Practice, and Visualization
Scott, D. W. (1992) · Wiley Series in Probability and Statistics · doi:10.1002/9780470316849 · Cited by 3,696
Multivariate Density Estimation, Theory, Practice, and Visualbation
Ramsay, P. H. (1993) · Technometrics · doi:10.1080/00401706.1993.10485361 · Cited by 2,789
COX, D. R. (1975) · Biometrika · doi:10.1093/biomet/62.2.269 · Cited by 2,292
Monte Carlo Statistical Methods
Robert, C. P., & Casella, G. (1999) · Springer Texts in Statistics · doi:10.1007/978-1-4757-3071-5 · Cited by 2,278
$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
Statistical Analysis of Non-Lattice Data
Besag, J. (1975) · The Statistician · doi:10.2307/2987782 · Cited by 1,559
Stochastic Complexity in Statistical Inquiry
Rissanen, J. (1998) · WORLD SCIENTIFIC eBooks · doi:10.1142/0822 · Cited by 1,539
A Survey of Recent Advances in Hierarchical Clustering Algorithms
Murtagh, F. (1983) · The Computer Journal · doi:10.1093/comjnl/26.4.354 · Cited by 1,058
Network Tomography: Estimating Source-Destination Traffic Intensities from Link Data
Vardi, Y. (1996) · Journal of the American Statistical Association · doi:10.1080/01621459.1996.10476697 · Cited by 794
Estimation, Inference and Specification Analysis
White, H. (1994) · Cambridge University Press eBooks · doi:10.1017/ccol0521252806 · Cited by 738
Recent trends in hierarchic document clustering: A critical review
Willett, P. (1988) · Information Processing & Management · doi:10.1016/0306-4573(88)90027-1 · Cited by 705
A Statistical Perspective on Ill-Posed Inverse Problems
O'Sullivan, F. (1986) · Statistical Science · doi:10.1214/ss/1177013525 · Cited by 670
Coates, A., Hero III, A. O., Nowak, R., & Yu, B. (2002) · IEEE Signal Processing Magazine · doi:10.1109/79.998081 · Cited by 529
Self-citationAn Efficient Data Clustering Method for Very Large Databases
Zhang, T. (1996) · Medical Entomology and Zoology · Cited by 494
Multicast-based inference of network-internal loss characteristics
Cascares, Duffield, Horowitz, & Towsley (1999) · IEEE Transactions on Information Theory · doi:10.1109/18.796384 · Cited by 410
Bayesian Inference on Network Traffic Using Link Count Data
Tebaldi, C., & West, M. (1998) · Journal of the American Statistical Association · doi:10.1080/01621459.1998.10473707 · Cited by 333
Time-Varying Network Tomography: Router Link Data
Cao, J., Davis, D., Vander Wiel, S., & Yu, B. (2000) · Journal of the American Statistical Association · doi:10.1080/01621459.2000.10474303 · Cited by 319
Self-citationIntegrated likelihood methods for eliminating nuisance parameters
Berger, J. O., Liseo, B., & Wolpert, R. L. (1999) · Statistical Science · doi:10.1214/ss/1009211804 · Cited by 310
Multicast-based inference of network-internal delay distributions
Lo Presti, F., Duffield, N. G., Horowitz, J., & Towsley, D. (2002) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2002.805026 · Cited by 249
Maximum likelihood network topology identification from edge-based unicast measurements
Coates, M., Castro, R., Nowak, R., Gadhiok, M., King, R., & Tsang, Y. (2002) · Proceedings of the 2002 ACM SIGMETRICS international conference on Measurement and modeling of computer systems · doi:10.1145/511334.511337 · Cited by 167
Self-citationMaximum pseudo likelihood estimation in network tomography
Liang, G., & Yu, B. (2003) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2003.814464 · Cited by 165
Self-citationTsang, Y., Coates, M., & Nowak, R. D. (2003) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2003.814520 · Cited by 156
Self-citationLikelihood Based Hierarchical Clustering
Castro, R. M., Coates, M., & Nowak, R. D. (2004) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2004.831124 · Cited by 83
Self-citationComment on Perlman and Wu, “The Emperor’s new tests” (with rejoinder by authors)
Berger, R. L. (1999) · Statistical Science · doi:10.1214/ss/1009212518 · Cited by 75
Passive network tomography using Bayesian inference
Padmanabhan, V. N., Qiu, L., & Wang, H. J. (2002) · doi:10.1145/637201.637214 · Cited by 35
Pseudo likelihood estimation in network tomography
Liang, G., & Yu, B. (2004) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.2003.1209231 · Cited by 24
Self-citation
Cited by
An overview of composite likelihood methods
Varin, C., Reid, N. M., & Firth, D. (2011) · doi:10.82444/warw.33615778 · Cited by 868
An Overview on Application of Machine Learning Techniques in Optical Networks
Musumeci, F., Rottondi, C., Nag, A., Macaluso, I., Zibar, D., Ruffini, M., & Tornatore, M. (2019) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2018.2880039 · Cited by 639
Thirty Years of Machine Learning: The Road to Pareto-Optimal Wireless Networks
Wang, J., Jiang, C., Zhang, H., Ren, Y., Chen, K.-C., & Hanzo, L. (2020) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2020.2965856 · Cited by 486
Learning Graphs From Data: A Signal Representation Perspective
Dong, X., Thanou, D., Rabbat, M., & Frossard, P. (2019) · IEEE Signal Processing Magazine · doi:10.1109/msp.2018.2887284 · Cited by 406
Metadata
- Authors
- Castro, R., Coates, M., Liang, G., Nowak, R., & Yu, B.
- Venue
- Statistical Science
- Publisher
- Institute of Mathematical Statistics
- Published
- 2004-08-01
- Volume
- 19
- Issue
- 3
- Pages
- 499-517
- ISSN
- 0883-4237 (ISSN-L)
- OpenAlex
- W2098865491
- Cited by
- 433
- References
- 33
- FWCI
- 18.46
- Type
- journal article
- Language
- en
- Open access
- bronze
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
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.