Identify Congested Links Based on Enlarged State Space |
| |
| Authors: | Sheng-Li Pan Zhi-Yong Zhang Ying-Jie Zhou Feng Qian Guang-Min Hu |
| |
| Affiliation: | 1.School of Communication and Information Engineering,University of Electronic Science and Technology of China,Chengdu,China;2.School of Computer and Communication Sciences,Swiss Federal Institute of Technology Lausanne,Lausanne,Switzerland;3.College of Computer Science,Sichuan University,Chengdu,China |
| |
| Abstract: | When paths share a common congested link, they will all suffer from a performance degradation. Boolean tomography exploits these performance-level correlations between different paths to identify the congested links. It is clear that the congestion of a path will be distinctly intensive when it traverses multiple congested links. We adopt an enlarged state space model to mirror different congestion levels and employ a system of integer equations, instead of Boolean equations, to describe relationships between the path states and the link states. We recast the problem of identifying congested links into a constraint optimization problem, including Boolean tomography as a special case. For a logical tree, we propose an up-to-bottom algorithm and prove that it always achieves a solution to the problem. Compared with existing algorithms, the simulation results show that our proposed algorithm achieves a higher detection rate while keeping a low false positive rate. |
| |
| Keywords: | |
| 本文献已被 万方数据 SpringerLink 等数据库收录！ |
|
