T-Trail: Link Failure Monitoring in Software-Defined Optical Networks

Zijing Cheng; Xiaoning Zhang; Shaohui Shen; Shui Yu; Jing Ren; Rongping Lin

doi:10.1364/JOCN.10.000344

Journal of Optical Communications and Networking
Vol. 10,
Issue 4,
pp. 344-352
(2018)
•https://doi.org/10.1364/JOCN.10.000344

T-Trail: Link Failure Monitoring in Software-Defined Optical Networks

Zijing Cheng, Xiaoning Zhang, Shaohui Shen, Shui Yu, Jing Ren, and Rongping Lin

Not Accessible

Your library or personal account may give you access

Get PDF
Email
Share
Get Citation
Copy Citation Text
Zijing Cheng, Xiaoning Zhang, Shaohui Shen, Shui Yu, Jing Ren, and Rongping Lin, "T-Trail: Link Failure Monitoring in Software-Defined Optical Networks," J. Opt. Commun. Netw. 10, 344-352 (2018)

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

Abstract

Monitoring trail (m-trail) provides a striking mechanism for fast and unambiguous link failure localization in all-optical networks. However, allocating dedicated supervisory lightpaths (m-trail) undoubtedly increases total network cost. Accordingly, how to maximally reduce monitoring cost in an optical network is an important issue. To this end, we propose a concept of traffic trail (t-trail) that uses traffic lightpaths, instead of dedicated supervisory lightpaths, to localize a single link failure in the context of a software-defined optical network (SDON). The central controller of an SDON collects routing information of all t-trails in the network. Thus, any link failure can be localized according to the ON–OFF status of the traversing t-trails. We first formulate the problem as an integer linear programming (ILP) model. Since the ILP is not feasible for solving the problem in large-size networks, an efficient heuristic algorithm t-trail allocation (TTA) is proposed to address it. We conduct extensive simulations to evaluate the performance of TTA. The results show that compared with the existing m-trail schemes, TTA can reduce total costs by 20.91% on average.

Full Article | PDF Article

More Like This

Multi-link Failure Localization via Monitoring Bursts

Mohammed L. Ali, Pin-Han Ho, János Tapolcai, and Suresh Subramaniam
J. Opt. Commun. Netw. 6(11) 952-964 (2014)

M-Burst: A Framework of SRLG Failure Localization in All-Optical Networks

Mohammed L. Ali, Pin-Han Ho, János Tapolcai, and Basem Shihada
J. Opt. Commun. Netw. 4(8) 628-638 (2012)

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
J. Opt. Commun. Netw. 9(11) 934-944 (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 (8)

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 (3)

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 (13)

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)$	The network topology, where $V$ denotes the set of nodes and $E$ denotes the set of links
$n$	The total number of traffic demands
$m$	The index of the traffic demand, where $1 \leq m \leq n$
$d_{m}$	The $m$ th traffic demand
$j$	The index of the t-trail
$t_{j}$	The $j$ th t-trail
$s_{u}^{j}$	A binary variable. It takes 1 if node $u$ is the source node of $t_{j}$ , 0 otherwise
$r_{v}^{j}$	A binary variable. It takes 1 if node $v$ is the sink node of $t_{j}$ , 0 otherwise
$f_{u}^{m}$	A binary variable. It takes 1 if node $u$ is the source node of $d_{m}$ , 0 otherwise
$g_{v}^{m}$	A binary variable. It takes 1 if node $v$ is the sink node of $d_{m}$ , 0 otherwise
$γ$	Predefined cost ratio of one pair of transceivers to a wavelength link
$h_{u v}$	Predefined cost of a wavelength on link ( $u$ , $v$ ). Either hop count or distance-related cost can be used (hop count is used in this paper)
$L$	The maximum hop count of t-trail when carrying traffic demand
$e_{u v}^{j}$	A binary variable. It takes 1 if $u \to v$ is an on-trail vector of $t_{j}$ , 0 otherwise
$z_{u}^{j}$	A binary variable. It takes 1 if node $u$ is traversed by $t_{j}$ , 0 otherwise
$f_{u v}^{x y}$	A binary variable. For two distinct links $(u, v)$ and $(x, y)$ , it takes 1 if $a_{u v} > a_{x y}$ , and 0 if $a_{u v} < a_{x y}$
$a_{u v}$	A general integer variable. It is the decimal alarm code assigned to link $(u, v)$

Notation	Description
$G (V, E)$	The network topology, where $V$ denotes the set of nodes and $E$ denotes the set of links
$n$	The total number of traffic demands
$m$	The index of the traffic demand, where $1 \leq m \leq n$
$d_{m}$	The $m$ th traffic demand
$j$	The index of the t-trail
$t_{j}$	The $j$ th t-trail
$s_{u}^{j}$	A binary variable. It takes 1 if node $u$ is the source node of $t_{j}$ , 0 otherwise
$r_{v}^{j}$	A binary variable. It takes 1 if node $v$ is the sink node of $t_{j}$ , 0 otherwise
$f_{u}^{m}$	A binary variable. It takes 1 if node $u$ is the source node of $d_{m}$ , 0 otherwise
$g_{v}^{m}$	A binary variable. It takes 1 if node $v$ is the sink node of $d_{m}$ , 0 otherwise
$γ$	Predefined cost ratio of one pair of transceivers to a wavelength link
$h_{u v}$	Predefined cost of a wavelength on link ( $u$ , $v$ ). Either hop count or distance-related cost can be used (hop count is used in this paper)
$L$	The maximum hop count of t-trail when carrying traffic demand
$e_{u v}^{j}$	A binary variable. It takes 1 if $u \to v$ is an on-trail vector of $t_{j}$ , 0 otherwise
$z_{u}^{j}$	A binary variable. It takes 1 if node $u$ is traversed by $t_{j}$ , 0 otherwise
$f_{u v}^{x y}$	A binary variable. For two distinct links $(u, v)$ and $(x, y)$ , it takes 1 if $a_{u v} > a_{x y}$ , and 0 if $a_{u v} < a_{x y}$
$a_{u v}$	A general integer variable. It is the decimal alarm code assigned to link $(u, v)$

Abstract

Cited By

Figures (8)

Tables (3)

Equations (13)

Journal of Optical Communications and Networking