Efficient measurement of round-trip link delays in software-defined networks

Wang, X; Yang, Y; Liu, H; Ren, J; Xu, S; Wang, S; Yu, S

Efficient measurement of round-trip link delays in software-defined networks

Wang, X Yang, Y Liu, H Ren, J Xu, S Wang, S Yu, S

Permalink

Publisher:: Elsevier BV
Publication Type:: Journal Article
Citation:: Journal of Network and Computer Applications, 2020, 150, pp. 102468-102468
Issue Date:: 2020-01-15

Closed Access

	Filename	Description	Size
	1-s2.0-S1084804519303285-main.pdf	Published version	2.44 MB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Wang, X
dc.contributor.author	Yang, Y
dc.contributor.author	Liu, H
dc.contributor.author	Ren, J
dc.contributor.author	Xu, S
dc.contributor.author	Wang, S
dc.contributor.author	Yu, S https://orcid.org/0000-0003-4485-6743
dc.date.accessioned	2020-12-24T23:59:41Z
dc.date.available	2020-12-24T23:59:41Z
dc.date.issued	2020-01-15
dc.identifier.citation	Journal of Network and Computer Applications, 2020, 150, pp. 102468-102468
dc.identifier.issn	1084-8045
dc.identifier.issn	1095-8592
dc.identifier.uri	http://hdl.handle.net/10453/144951
dc.description.abstract	© 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.
dc.language	en
dc.publisher	Elsevier BV
dc.relation.ispartof	Journal of Network and Computer Applications
dc.relation.isbasedon	10.1016/j.jnca.2019.102468
dc.rights	info:eu-repo/semantics/closedAccess
dc.subject	0805 Distributed Computing, 1005 Communications Technologies
dc.subject.classification	Networking & Telecommunications
dc.title	Efficient measurement of round-trip link delays in software-defined networks
dc.type	Journal Article
utslib.citation.volume	150
utslib.for	0805 Distributed Computing
utslib.for	0805 Distributed Computing
utslib.for	1005 Communications Technologies
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney
utslib.copyright.status	closed_access	*
dc.date.updated	2020-12-24T23:59:26Z
pubs.publication-status	Published
pubs.volume	150

Abstract:

© 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.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/144951