基于层次分解的网络链路时延分布快速推测算法  

A Fast Link Delay Distribution Inference Algorithm Based on Hierarchy Decomposition

作　　者：杨京礼[1] 孙超[1] 姜守达[1] 魏长安[1] 

机构地区：[1]哈尔滨工业大学自动化测试与控制研究所,哈尔滨150080

出　　处：《电子与信息学报》2013年第8期2005-2012,共8页Journal of Electronics & Information Technology

基　　金：黑龙江省博士后基金(LBH-Z11171)资助课题

摘　　要：为提高离散时延模型下的网络链路时延分布的测量速度,该文提出一种基于层次分解的网络链路时延分布快速推测算法。按照树型网络拓扑的层次对端到端路径时延进行子树分解,以子树作为链路时延分布计算的基本单元,减少端到端路径时延分解到链路时延后造成的冗余计算,缩短链路时延分布的计算时间。仿真实验结果表明,该文提出的算法能够在不损失测量精度的条件下,有效缩短测量总时间,提高链路时延分布的测量速度。In order to speed up the inference algorithm of the link delay distribution based on discrete delay model,a fast inference algorithm based on hierarchy decomposition is proposed.This algorithm decomposes the end-to-end path delay into subtree units by the levels of the topology,and calculates the link delay distribution based on those subtree units.Through the reducing of the redundancy decomposition process of the end-to-end path delay,it can speed up the process of the inference of the link delay distribution.Simulation results show that this algorithm can improve the speed of the link delay distribution without loss of the accuracy.

关 键 词：网络层析成像 链路时延分布 层次分解 期望最大化算法 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]