Name
Abstract | ||
|---|---|---|
As one of the key performance metrics, path delay is of great significance for network policy making. Existing work has focused too much on the accuracy of delay measurement and neglected its timeliness. In response, in this paper, we propose a fast path delay measurement scheme using closeness centrality for software-defined network. First, the node ranking method using closeness centrality is used to select the initial point for the delay measurement to enable fast forwarding of probe packets. On this basis, we assign link weights according to the delay measurement results, and readjust the measurement points to optimize the performance. A series of simulation experiments on different topologies and network state verifies the advantage of the proposed scheme in this paper in terms of time overhead for delay measurement, compared to existing work. |
Year | DOI | Venue |
|---|---|---|
2022 | 10.1002/itl2.341 | INTERNET TECHNOLOGY LETTERS |
Keywords | DocType | Volume |
software-defined networking, closeness centrality, delay measurement | Journal | 5 |
Issue | Citations | PageRank |
4 | 0 | 0.34 |
References | Authors | |
0 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Binghao Yan | 1 | 0 | 0.34 |
| Qinrang Liu | 2 | 0 | 0.68 |
| Jianliang Shen | 3 | 0 | 0.34 |
| Liang Dong | 4 | 326 | 52.32 |