Journal of Optical Communications and Networking
Vol. 9,
Issue 11,
pp. 934-944
(2017)
•https://doi.org/10.1364/JOCN.9.000934

Congestion-Aware Local Reroute for Fast Failure Recovery in Software-Defined Networks

Zijing Cheng, Xiaoning Zhang, Yichao Li, Shui Yu, Rongping Lin, and Lei He

Not Accessible

Your library or personal account may give you access

Get PDF
Email
Share
Get Citation
Copy Citation Text
Zijing Cheng, Xiaoning Zhang, Yichao Li, Shui Yu, Rongping Lin, and Lei He, "Congestion-Aware Local Reroute for Fast Failure Recovery in Software-Defined Networks," J. Opt. Commun. Netw. 9, 934-944 (2017)

Export Citation
- BibTex
- Endnote (RIS)
- HTML
- Plain Text
Citation alert
Save article

Check for updates

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.

Full Article | PDF Article

More Like This

Independent Transient Plane Design for Protection in OpenFlow-Based Networks

Nattapong Kitsuwan, Séamas McGettrick, Frank Slyne, David B. Payne, and Marco Ruffini
J. Opt. Commun. Netw. 7(4) 264-275 (2015)

Segment Routing for Effective Recovery and Multi-domain Traffic Engineering

A. Giorgetti, A. Sgambelluri, F. Paolucci, F. Cugini, and P. Castoldi
J. Opt. Commun. Netw. 9(2) A223-A232 (2017)

Software-Defined Optical Networks and Network Abstraction With Functional Service Design [Invited]

Xiaoyuan Cao, Noboru Yoshikane, Ion Popescu, Takehiro Tsuritani, and Itsuro Morita
J. Opt. Commun. Netw. 9(4) C65-C75 (2017)

Previous Article Next Article

Cited By

You do not have subscription access to this journal. Cited by links are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access Optica Member Subscription

Figures (9)

You do not have subscription access to this journal. Figure files are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access Optica Member Subscription

Tables (5)

You do not have subscription access to this journal. Article tables are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access Optica Member Subscription

Equations (9)

You do not have subscription access to this journal. Equations are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Login to access Optica Member Subscription

Notation	Description
$G (V, E)$	Network topology, where $V$ denotes the set of nodes and $E$ denotes the set of links
$l$	Failed link in the network
$s_{l}$	Source node of $l$
$d_{l}$	Destination node of $l$
$m$	Number of disrupted traffic flows
$M$	Set of disrupted traffic flows in the network
$f_{j}$	$j$ th disrupted traffic flow, where $1 \leq j \leq m$
$b_{j}$	Bandwidth of $f_{j}$
$w_{j}$	Working path of $f_{j}$
$S_{j}$	Set of switches on $w_{j}$
$n$	Number of computed local reroute paths after $l$ fails
$N$	Set of computed local reroute paths
$p_{i}$	$i$ th local reroute path, where $1 \leq i \leq n$
$q_{i}$	Number of switches on $p_{i}$
$R_{i}$	Set of switches on $p_{i}$
$l_{i}^{z}$	$z$ th link of $p_{i}$ , where $1 \leq z \leq q_{i} - 1$
$c_{i}^{z}$	Capacity of $l_{i}^{z}$
$r_{i}^{z}$	Traffic load of $l_{i}^{z}$
$T_{u}$	Utilization threshold of link capacity, where $0 < T_{u} < 1$ (in our study, we set $T_{u} = 0.8$ )
$a_{i}$	Available path capacity of $p_{i}$ , where $a_{i} = \min {T_{u} c_{i}^{z} - r_{i}^{z}} (1 \leq z \leq q_{i} - 1)$
$h_{i}$	Binary variable. 1 if at least one disrupted flow is assigned to $p_{i}$ , 0 otherwise
$x_{i j}$	Binary variable. 1 if $f_{j}$ is assigned to $p_{i}$ , 0 otherwise
$y_{u, v}^{p_{i}}$	Binary variable. 1 if $p_{i}$ traverses link $(u, v)$ , 0 otherwise

	Failed Link	Number of Disrupted Flows	PR	LR	LFR	CALFR
Case 1	7–9	15	76	45	16	19
Case 2	5–10	16	80	48	16	20
Case 3	5–10	19	89	57	18	23
Case 4	9–13	15	71	30	17	17
Case 5	11–15	19	85	57	18	23

	Failed Link	Number of Disrupted Flows	Total Bandwidth of Disrupted Flows	PR	LR	LFR
Case 1	7–9	25	498 Mbps	2	3	3
Case 2	7–9	23	477 Mbps	2	3	3
Case 3	11–15	19	367 Mbps	0	2	2
Case 4	11–15	21	409 Mbps	2	2	2
Case 5	5–10	26	483 Mbps	1	2	2

Notation	Description
$G (V, E)$	Network topology, where $V$ denotes the set of nodes and $E$ denotes the set of links
$l$	Failed link in the network
$s_{l}$	Source node of $l$
$d_{l}$	Destination node of $l$
$m$	Number of disrupted traffic flows
$M$	Set of disrupted traffic flows in the network
$f_{j}$	$j$ th disrupted traffic flow, where $1 \leq j \leq m$
$b_{j}$	Bandwidth of $f_{j}$
$w_{j}$	Working path of $f_{j}$
$S_{j}$	Set of switches on $w_{j}$
$n$	Number of computed local reroute paths after $l$ fails
$N$	Set of computed local reroute paths
$p_{i}$	$i$ th local reroute path, where $1 \leq i \leq n$
$q_{i}$	Number of switches on $p_{i}$
$R_{i}$	Set of switches on $p_{i}$
$l_{i}^{z}$	$z$ th link of $p_{i}$ , where $1 \leq z \leq q_{i} - 1$
$c_{i}^{z}$	Capacity of $l_{i}^{z}$
$r_{i}^{z}$	Traffic load of $l_{i}^{z}$
$T_{u}$	Utilization threshold of link capacity, where $0 < T_{u} < 1$ (in our study, we set $T_{u} = 0.8$ )
$a_{i}$	Available path capacity of $p_{i}$ , where $a_{i} = \min {T_{u} c_{i}^{z} - r_{i}^{z}} (1 \leq z \leq q_{i} - 1)$
$h_{i}$	Binary variable. 1 if at least one disrupted flow is assigned to $p_{i}$ , 0 otherwise
$x_{i j}$	Binary variable. 1 if $f_{j}$ is assigned to $p_{i}$ , 0 otherwise
$y_{u, v}^{p_{i}}$	Binary variable. 1 if $p_{i}$ traverses link $(u, v)$ , 0 otherwise

	Failed Link	Number of Disrupted Flows	PR	LR	LFR	CALFR
Case 1	7–9	15	76	45	16	19
Case 2	5–10	16	80	48	16	20
Case 3	5–10	19	89	57	18	23
Case 4	9–13	15	71	30	17	17
Case 5	11–15	19	85	57	18	23

Congestion-Aware Local Reroute for Fast Failure Recovery in Software-Defined Networks

Author Affiliations

ORCID

Abstract

Cited By

Figures (9)

Tables (5)

Equations (9)

Journal of Optical Communications and Networking