2015/08/06 by Weiping Zhu, Zhu, Weiping
Computer Science · Mathematics · Physics and Astronomy · #Complex Network Analysis Techniques #FOS: Computer and information sciences #Graph theory and applications #Network Traffic and Congestion Control #Networking and Internet Architecture (cs.NI)
paper · pdf · doi:10.48550/arxiv.1508.01274
openalex publication_date 2015/08/06 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Three types of explicit estimators are proposed here to estimate the loss rates of the links in a network of the tree topology. All of them are derived by the maximum likelihood principle and proved to be either asymptotic unbiased or unbiased. In addition, a set of formulae are derived to compute the efficiencies and variances of the estimators that also cover some of the estimators proposed previously. The formulae unveil that the variance of the estimates obtained by a maximum likelihood estimator for the pass rate of the root link of a multicast tree is equal to the variance of the pass rate of the multicast tree divided by the pass rate of the tree connected to the root link. Using the formulae, we are able to evaluate the estimators proposed so far and select an estimator for a data set.