Congestion-aware local reroute for fast failure recovery in software-defined networks

Cheng, Z; Zhang, X; Li, Y; Yu, S; Lin, R; He, L

Congestion-aware local reroute for fast failure recovery in software-defined networks

Cheng, Z Zhang, X Li, Y Yu, S

Lin, R He, L

Permalink

Publisher:: Optica
Publication Type:: Journal Article
Citation:: Journal of Optical Communications and Networking, 2017, 9, (11), pp. 934-944
Issue Date:: 2017-11-01

Closed Access

	Filename	Description	Size
	Congestion-aware_local_reroute_for_fast_failure_recovery_in_software-defined_networks.pdf		474.58 kB	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	Cheng, Z
dc.contributor.author	Zhang, X
dc.contributor.author	Li, Y
dc.contributor.author	Yu, S https://orcid.org/0000-0003-4485-6743
dc.contributor.author	Lin, R
dc.contributor.author	He, L
dc.date.accessioned	2022-08-16T04:45:32Z
dc.date.available	2022-08-16T04:45:32Z
dc.date.issued	2017-11-01
dc.identifier.citation	Journal of Optical Communications and Networking, 2017, 9, (11), pp. 934-944
dc.identifier.issn	1943-0620
dc.identifier.issn	1943-0639
dc.identifier.uri	http://hdl.handle.net/10453/160332
dc.description.abstract	Although a restoration approach derives a reroute path when failure occurs and greatly reduces forwarding rules in switches compared with a protection approach, software-defined networks (SDNs) induce a long failure recovery process because of frequent flow operations between the SDN controller and switches. Accordingly, it is indispensable to design a new resilience approach to balance failure recovery time and forwarding rule occupation. To this end, we leverage flexible flow aggregation in fast reroute to solve this problem. In the proposed approach, each disrupted traffic flow is reassigned to a local reroute path for the purpose of congestion avoidance. Thus, all traffic flows assigned to the same local reroute path are aggregated into a new 'big' flow, and the number of reconfigured forwarding rules in the restoration process is greatly reduced. We first formulate this problem as an integer linear programming model, then design an efficient heuristic named the 'congestion-aware local fast reroute' (CALFR). Extensive emulation results show that CALFR enables fast recovery while avoiding link congestion in the post-recovery network.
dc.language	English
dc.publisher	Optica
dc.relation.ispartof	Journal of Optical Communications and Networking
dc.relation.isbasedon	10.1364/JOCN.9.000934
dc.rights	info:eu-repo/semantics/closedAccess
dc.subject	0906 Electrical and Electronic Engineering, 0915 Interdisciplinary Engineering, 1005 Communications Technologies
dc.title	Congestion-aware local reroute for fast failure recovery in software-defined networks
dc.type	Journal Article
utslib.citation.volume	9
utslib.for	0906 Electrical and Electronic Engineering
utslib.for	0915 Interdisciplinary Engineering
utslib.for	1005 Communications Technologies
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology/School of Computer Science
utslib.copyright.status	closed_access	*
pubs.consider-herdc	false
dc.date.updated	2022-08-16T04:45:31Z
pubs.issue	11
pubs.publication-status	Published
pubs.volume	9
utslib.citation.issue	11

Abstract:

Although a restoration approach derives a reroute path when failure occurs and greatly reduces forwarding rules in switches compared with a protection approach, software-defined networks (SDNs) induce a long failure recovery process because of frequent flow operations between the SDN controller and switches. Accordingly, it is indispensable to design a new resilience approach to balance failure recovery time and forwarding rule occupation. To this end, we leverage flexible flow aggregation in fast reroute to solve this problem. In the proposed approach, each disrupted traffic flow is reassigned to a local reroute path for the purpose of congestion avoidance. Thus, all traffic flows assigned to the same local reroute path are aggregated into a new 'big' flow, and the number of reconfigured forwarding rules in the restoration process is greatly reduced. We first formulate this problem as an integer linear programming model, then design an efficient heuristic named the 'congestion-aware local fast reroute' (CALFR). Extensive emulation results show that CALFR enables fast recovery while avoiding link congestion in the post-recovery network.

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

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