电子学报2016，Vol.44Issue(3)：565-571,7.DOI:10.3969/j.issn.0372-2112.2016.03.011
基于子树丢包模式的链路丢包率快速推断算法
A Fast Network Link Loss Inference Algorithm Based on Subtree Loss Pattern
摘要
Abstract
In order to improve the efficiency of link loss inference algorithm,a novel inference algorithm based on subtree loss pattern is proposed.The iterations of the algorithm are reduced by obtaining a more appropriate initialization of loss rates.According to the outcomes of end-to-end measurements,this algorithm partitions the network topology into one ar-ea in which the transmission state is determinate,and several areas in which the transmission state is indeterminate.By de-composing all the indeterminate areas,a subtree loss pattern database is constructed.The loss rate is calculated based on the loss pattern.Through reducing the redundancy decomposition process,it can speed up the process of the inference of the link loss rate.Simulation results show that the algorithm can reduce the time of link loss rate inference with identical accuracy.关键词
网络测量/网络层析成像/链路丢包率/丢包模式Key words
network measurement/network tomography/link packet loss rate/loss pattern分类
信息技术与安全科学引用本文复制引用
尹文涛,杨京礼,姜守达,魏长安..基于子树丢包模式的链路丢包率快速推断算法[J].电子学报,2016,44(3):565-571,7.基金项目
黑龙江省博士后基金 （）
