TY  - JOUR
AB  - © 2019 Elsevier Ltd Round-trip link delay is an important indicator for network performance optimization and troubleshooting. The Software-Defined Networking (SDN) paradigm, which provides flexible and centralized control capability, paves the way for efficient round-trip link delay measurement. In this paper, we study the round-trip link delay measurement problem in SDN networks. We propose an efficient measurement scheme, which infers round-trip link delays from end-to-end delay of some measurement paths implemented with few flow rules in each SDN switch. Furthermore, to reduce measurement cost and meet measurement constraint, we address the Monitor Placement and Link Assignment (MPLA) problem involved in the measurement scheme. Specifically, we formulate the MPLA problem as a Mixed Integer Linear Programming (MILP) problem, prove that it is NP-hard, and propose an efficient algorithm called MPLA Algorithm based on Biding Strategy (MPLAA-BS) to solve the problem. The extensive simulation results on real network topologies reveal that the proposed scheme can efficiently and accurately measure round-trip link delays in SDN networks, and the MPLAA-BS can find feasible and resource-efficient solutions for the MPLA problem.
AU  - Wang, X
AU  - Yang, Y
AU  - Liu, H
AU  - Ren, J
AU  - Xu, S
AU  - Wang, S
AU  - Yu, S
DA  - 2020/01/15
DO  - 10.1016/j.jnca.2019.102468
EP  - 102468
JO  - Journal of Network and Computer Applications
PB  - Elsevier BV
PY  - 2020/01/15
SP  - 102468
TI  - Efficient measurement of round-trip link delays in software-defined networks
VL  - 150
Y1  - 2020/01/15
Y2  - 2026/05/28
ER  -