一种IP网络拥塞链路丢包率范围推断算法  

Congested Link Loss Rate Range Inference Algorithm in IP Network

作　　者：陈宇[1,2] 周巍[1] 段哲民[1] 钱叶魁 赵鑫[3,4] 

机构地区：[1]西北工业大学电子信息学院,陕西西安710072 [2]郑州航空工业管理学院,河南郑州450015 [3]解放军防空兵学院,河南郑州450052 [4]中国电子科技集团公司第五十四研究所通信网信息传输与分发技术重点实验室,河北石家庄050081

出　　处：《软件学报》2017年第5期1296-1314,共19页Journal of Software

基　　金：国家重点基础研究发展计划(973)(2013CB329104);国家自然科学基金(61103225);通信网信息传输与分发技术重点实验室基金~~

摘　　要：针对大规模IP网络拥塞链路丢包率范围推断算法中存在的不足,提出一种贪婪启发式拥塞链路丢包率范围推断算法.借助多时隙路径探测,避开单时隙探测对时钟同步的强依赖;通过学习各链路拥塞先验概率,借助贝叶斯最大后验定位拥塞链路;提出了聚类拥塞链路相关、性能相近路径集合的策略,通过对聚类路径集合中性能相似系数求解,循环推断拥塞链路丢包率范围.实验验证了算法的准确性及鲁棒性.Addressing the shortcomings of existing link congestion loss rate range inference algorithms in large scale IP network, a new link congestion loss rate range inference algorithm based on greedy heuristic method is proposed. The strong dependency on the clock synchronization of single slot E2E path measurements is avoided through using multiple slots E2E path measurements. Each congested link can be located through adopting the link congestion Bayesian maximum a-posterior （BMAP） after learning prior probabilities of the link congestion. The set consisting of paths with related congested links and similar performance is constructed. Through solving the performance similarity coefficient dynamically, loss rate range of each congested link can be recurrently inferred. The accuracy and robustness of the algorithm proposed in this paper is verified by experiments.

关 键 词：IP网络 拥塞链路推断 丢包率范围 贝叶斯最大后验概率 贪婪启发算法 

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