A fast link delay distribution inference algorithm based on hierarchy decomposition

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.