Time-varying network tomography: Router link data

被引:177
作者
Cao, J [1 ]
Davis, D [1 ]
Vander Wiel, S [1 ]
Yu, B [1 ]
机构
[1] Univ Calif Berkeley, Berkeley, CA 94720 USA
关键词
expectation-maximization algorithm; filtering; normal; inverse problem; link data; maximum likelihood estimation; network traffic; smoothing; variance model;
D O I
10.2307/2669743
中图分类号
O21 [概率论与数理统计]; C8 [统计学];
学科分类号
020208 ; 070103 ; 0714 ;
摘要
The origin-destination (OD) traffic matrix of a computer network is useful for solving problems in design, routing, configuration debugging, monitoring, and pricing. Directly measuring this matrix is not usually feasible, but less informative Link measurements are easy to obtain. This work studies the inference of OD byte counts from link byte counts measured at router interfaces under a fixed routing scheme. A basic model of the OD counts assumes that they are independent normal over OD pairs and lid over successive measurement periods. The normal means and variances are functionally related through a power law. We deal with the time-varying nature of the counts by fitting the basic lid model locally using a moving data window. Identifiability of the model is proved for router link data and maximum likelihood is used for parameter estimation. The OD counts are estimated by their conditional expectations given the link counts and estimated parameters. Thus, OD estimates are forced to be positive and to harmonize with the link count measurements and the routing scheme. Finally, maximum likelihood estimation is improved by using an adaptive prior, Proposed methods are applied to two simple networks at Lucent Technologies and found to perform well. Furthermore, the estimates are validated in a single-router network fur which direct measurements of origin-destination counts are available through special software.
引用
收藏
页码:1063 / 1075
页数:13
相关论文
共 17 条
[1]  
Anderson B., 1979, OPTIMAL FILTERING
[2]  
*CAIDA, 1999, CFLOWD FLOW AN SOFTW
[3]  
Chambers JohnM., 1993, Statistical Models in S
[4]   I-DIVERGENCE GEOMETRY OF PROBABILITY DISTRIBUTIONS AND MINIMIZATION PROBLEMS [J].
CSISZAR, I .
ANNALS OF PROBABILITY, 1975, 3 (01) :146-158
[5]   On a least squares adjustment of a sampled frequency table when the expected marginal totals are known [J].
Deming, WE ;
Stephan, FF .
ANNALS OF MATHEMATICAL STATISTICS, 1940, 11 :427-444
[6]   MAXIMUM LIKELIHOOD FROM INCOMPLETE DATA VIA EM ALGORITHM [J].
DEMPSTER, AP ;
LAIRD, NM ;
RUBIN, DB .
JOURNAL OF THE ROYAL STATISTICAL SOCIETY SERIES B-METHODOLOGICAL, 1977, 39 (01) :1-38
[7]   SUBROUTINES FOR UNCONSTRAINED MINIMIZATION USING A MODEL TRUST-REGION APPROACH [J].
GAY, DM .
ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE, 1983, 9 (04) :503-524
[8]  
Gelman A., 1995, Bayesian Data Analysis
[9]  
Hastie T., 1990, STAT SCI, DOI DOI 10.1214/SS/1177013604
[10]  
IRELAND CT, 1968, BIOMETRIKA, V55, P179