Adaptive Path Selection for Link Loss Inference in Network Tomography Applications.
In this study, we address the problem of selecting the optimal end-to-end paths for link loss inference in order to improve the performance of network tomography applications, which infer the link loss rates from the path loss rates. Measuring the path loss rates using end-to-end probing packets may...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Public Library of Science (PLoS)
2016-01-01
|
| Series: | PLoS ONE |
| Online Access: | http://europepmc.org/articles/PMC5049780?pdf=render |
| _version_ | 1828178978956902400 |
|---|---|
| author | Yan Qiao Jun Jiao Yuan Rao Huimin Ma |
| author_facet | Yan Qiao Jun Jiao Yuan Rao Huimin Ma |
| author_sort | Yan Qiao |
| collection | DOAJ |
| description | In this study, we address the problem of selecting the optimal end-to-end paths for link loss inference in order to improve the performance of network tomography applications, which infer the link loss rates from the path loss rates. Measuring the path loss rates using end-to-end probing packets may incur additional traffic overheads for networks, so it is important to select the minimum path set carefully while maximizing their performance. The usual approach is to select the maximum independent paths from the candidates simultaneously, while the other paths can be replaced by linear combinations of them. However, this approach ignores the fact that many paths always exist that do not lose any packets, and thus it is easy to determine that all of the links of these paths also have 0 loss rates. Not considering these good paths will inevitably lead to inefficiency and high probing costs. Thus, we propose an adaptive path selection method that selects paths sequentially based on the loss rates of previously selected paths. We also propose a theorem as well as a graph construction and decomposition approach to efficiently find the most valuable path during each round of selection. Our new method significantly outperforms the classical path selection method based on simulations in terms of the probing cost, number of accurate links determined, and the running speed. |
| first_indexed | 2024-04-12T05:24:03Z |
| format | Article |
| id | doaj.art-db611a1f65a144b5b48701ed7ee39f0c |
| institution | Directory Open Access Journal |
| issn | 1932-6203 |
| language | English |
| last_indexed | 2024-04-12T05:24:03Z |
| publishDate | 2016-01-01 |
| publisher | Public Library of Science (PLoS) |
| record_format | Article |
| series | PLoS ONE |
| spelling | doaj.art-db611a1f65a144b5b48701ed7ee39f0c2022-12-22T03:46:21ZengPublic Library of Science (PLoS)PLoS ONE1932-62032016-01-011110e016370610.1371/journal.pone.0163706Adaptive Path Selection for Link Loss Inference in Network Tomography Applications.Yan QiaoJun JiaoYuan RaoHuimin MaIn this study, we address the problem of selecting the optimal end-to-end paths for link loss inference in order to improve the performance of network tomography applications, which infer the link loss rates from the path loss rates. Measuring the path loss rates using end-to-end probing packets may incur additional traffic overheads for networks, so it is important to select the minimum path set carefully while maximizing their performance. The usual approach is to select the maximum independent paths from the candidates simultaneously, while the other paths can be replaced by linear combinations of them. However, this approach ignores the fact that many paths always exist that do not lose any packets, and thus it is easy to determine that all of the links of these paths also have 0 loss rates. Not considering these good paths will inevitably lead to inefficiency and high probing costs. Thus, we propose an adaptive path selection method that selects paths sequentially based on the loss rates of previously selected paths. We also propose a theorem as well as a graph construction and decomposition approach to efficiently find the most valuable path during each round of selection. Our new method significantly outperforms the classical path selection method based on simulations in terms of the probing cost, number of accurate links determined, and the running speed.http://europepmc.org/articles/PMC5049780?pdf=render |
| spellingShingle | Yan Qiao Jun Jiao Yuan Rao Huimin Ma Adaptive Path Selection for Link Loss Inference in Network Tomography Applications. PLoS ONE |
| title | Adaptive Path Selection for Link Loss Inference in Network Tomography Applications. |
| title_full | Adaptive Path Selection for Link Loss Inference in Network Tomography Applications. |
| title_fullStr | Adaptive Path Selection for Link Loss Inference in Network Tomography Applications. |
| title_full_unstemmed | Adaptive Path Selection for Link Loss Inference in Network Tomography Applications. |
| title_short | Adaptive Path Selection for Link Loss Inference in Network Tomography Applications. |
| title_sort | adaptive path selection for link loss inference in network tomography applications |
| url | http://europepmc.org/articles/PMC5049780?pdf=render |
| work_keys_str_mv | AT yanqiao adaptivepathselectionforlinklossinferenceinnetworktomographyapplications AT junjiao adaptivepathselectionforlinklossinferenceinnetworktomographyapplications AT yuanrao adaptivepathselectionforlinklossinferenceinnetworktomographyapplications AT huiminma adaptivepathselectionforlinklossinferenceinnetworktomographyapplications |