.png){kind=icon}
返回
Network delay tomography using flexicast experiments
.png){kind=icon}
OA
AI
DOI：10.1111/j.1467-9868.2006.00567.x.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Estimating and monitoring the quality of service of computer and communications networks is a problem of considerable interest. The paper focuses on estimating link level delay distributions from end-to-end path level data collected by using active probing experiments. This is an interesting large scale statistical inverse (deconvolution) problem. We describe a flexible class of probing experiments ('flexicast') for data collection and develop conditions under which the link level delay distributions are identifiable. Maximum likelihood estimation using the EM algorithm is studied. It does not scale well for large trees, so a faster algorithm based on solving for local maximum likehood estimators and combining their information is proposed. The usefulness of the methods is illustrated on real voice over Internet protocol data that were collected from the University of North Carolina campus network.
Keyword:
deconvolution
EM algorithm
Internet
inverse problem
tree-structured graphs
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
J
IF:
3.6
论文数:
1.5K
被引数:
3.2W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏
分享收藏 没有更多内容
没有更多内容