Abstract：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.
杨京礼, 孙超, 姜守达, 魏长安. 基于层次分解的网络链路时延分布快速推测算法[J]. 电子与信息学报, 2013, 35(8): 2005-2012.
Yang Jing-Li, Sun Chao, Jiang Shou-Da, Wei Chang-An. A Fast Link Delay Distribution Inference Algorithm Based on Hierarchy Decomposition. , 2013, 35(8): 2005-2012.
2013, Vol. 35 
