Name
Abstract | ||
|---|---|---|
Identifying congested links accurately to ensure the Service Level Agreements is an important but challenging task, since it is costly or even practically unfeasible to monitor massive interior links directly for large networks. Network tomography has been proposed to overcome this problem by using end-to-end (path) measurements. However, most of existing tomographic methods only focus on the loss performance degradation, while paying much less attention the fact that network congestion will also greatly worsen the delay performance. Nevertheless, most of them normally work under single-path routing, which may also get violated in today’s Internet as multipath routing is increasingly common. In this paper, we consider the problem of using end-to-end measurements to identify congested links when multipath routing is employed in a non-tree network. Firstly, we use both link delay variances and link loss rates to model the system constraints between end- to-end paths and the interior links, and transfer the issue of congested link identification as an optimization problem. By theoretically demonstrating that the link delay variances are identifiable from the end-to-end delay measurements with certain topology conditions, we further prove that the above optimization problem is a Non-deterministic Polynomial-time hard (NP-hard) problem. Then in order to solve such an NP-hard problem, two greedy algorithms based on bool and additive congestion statuses are proposed. Lastly, simulation studies show that with extra delay constraints, our proposed algorithms are able to achieve better identification performances than existing methods under multipath routing. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1007/s10922-018-9471-2 | Journal of Network and Systems Management |
Keywords | Field | DocType |
Network measurements,Boolean tomography,Congested link identification,End-to-end measurement,Multipath routing,NP-hard | Large networks,Multipath routing,Service level,Computer science,Computer network,Greedy algorithm,Network tomography,Network congestion,Optimization problem,The Internet,Distributed computing | Journal |
Volume | Issue | ISSN |
27 | 2 | 1573-7705 |
Citations | PageRank | References |
1 | 0.34 | 22 |
Authors | ||
6 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Shengli Pan | 1 | 1 | 0.34 |
| Yingjie Zhou | 2 | 52 | 11.57 |
| Zhiyong Zhang | 3 | 4 | 2.42 |
| Song Yang | 4 | 6 | 3.20 |
| Feng Qian | 5 | 18 | 3.15 |
| Guang-min Hu | 6 | 87 | 19.78 |