Link-protection and FIPP p-cycle designs in translucent elastic optical networks

Rujia Zou; Hiroshi Hasegawa; Masahiko Jinno; Suresh Subramaniam

doi:10.1364/JOCN.382561

Journal of Optical Communications and Networking
Vol. 12,
Issue 7,
pp. 163-176
(2020)
•https://doi.org/10.1364/JOCN.382561

Link-protection and FIPP p-cycle designs in translucent elastic optical networks

Rujia Zou, Hiroshi Hasegawa, Masahiko Jinno, and Suresh Subramaniam

Get PDF
Email
Share
Get Citation
Copy Citation Text
Rujia Zou, Hiroshi Hasegawa, Masahiko Jinno, and Suresh Subramaniam, "Link-protection and FIPP p-cycle designs in translucent elastic optical networks," J. Opt. Commun. Netw. 12, 163-176 (2020)

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

Related Topics
Optics & Photonics Topics
?

The topics in this list come from the Optics and Photonics Topics applied to this article.

About this Article
History
- Original Manuscript: November 5, 2019
- Revised Manuscript: March 18, 2020
- Manuscript Accepted: March 19, 2020
- Published: April 21, 2020

Accepted Manuscript
Download Accepted Manuscript
Access to this article is made available via and is subject to OSA Publishing Terms of Use.

Abstract

Elastic optical networks (EONs) are able to provide high spectrum utilization efficiency due to flexibility in resource assignment. In translucent EONs, by employing regenerators and using advanced modulation formats for transmission, spectrum efficiency can be further improved. Survivability is regarded as an important aspect of EONs, and p-cycle protection is considered to be an attractive scheme due to its fast restoration and high protection efficiency. In this paper, we propose methods for evaluating and selecting p-cycles for both link protection (LP) and failure-independent path protection (FIPP) to survive single-link failures. After considering the various factors that affect the performance of a p-cycle, we propose two evaluation metrics for LP and FIPP, namely, individual p-cycle cost and set of cycles cost. Based on these metrics, we propose two algorithms for selecting a set of p-cycles in translucent EONs: Traffic Independent P-cycle Selection (TIPS), which selects a set of cycles without knowledge of the traffic, and Traffic-Oriented P-cycle Selection (TOPS), which takes given traffic information into account. A routing and spectrum assignment algorithm is designed for translucent EONs, and our p-cycle design algorithms are evaluated using both static and dynamic traffic models. Simulation results show that the proposed algorithms have better performance than commonly used baseline algorithms. We also compare the performance of LP p-cycles and FIPP p-cycles.

Full Article | PDF Article

More Like This

Service Availability Oriented p-Cycle Protection Design in Elastic Optical Networks

Xiaoliang Chen, Fan Ji, and Zuqing Zhu
J. Opt. Commun. Netw. 6(10) 901-910 (2014)

Energy-Efficient Resilience in Translucent Optical Networks With Mixed Regenerator Placement

Xiaoliang Chen, Fan Ji, Yanan Wu, and Zuqing Zhu
J. Opt. Commun. Netw. 5(7) 741-750 (2013)

Elastic Versus WDM Networks With Dedicated Multicast Protection

Anliang Cai, Zheyu Fan, Kai Xu, Moshe Zukerman, and Chun-Kit Chan
J. Opt. Commun. Netw. 9(11) 921-933 (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 (15)

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

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

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

1:	procedure Generate-P-cycle-set
2:	while The network is not fully protected do
3:	Initialize p-cycle $p$
4:	Calculate $I C$ for $p$ as $p_{IC}$ and initialize ${I C}_{min}$ as $p_{IC}$
5:	while Expand_p-cycle $(p) \neq N U L L$ do
6:	$p^{'} =$ Expand_p-cycle $(p)$
7:	Calculate the $I C$ of $p^{'}$ as $p_{IC}^{'}$
8:	if $p_{IC}^{'} < {I C}_{min}$ then
9:	Update the candidate p-cycle to $p^{'}$
10:	Update ${I C}_{min}$ to $p_{IC}^{'}$
11:	end if
12:	$p = p^{'}$
13:	end while
14:	Add the candidate p-cycle to p-cycle set P
15:	Mark links (for LP) or node pairs (for FIPP) that can be
	protected by candidate cycle as protected
16:	end while

1:	procedure Initialize-LP-p-cycle
2:	Randomly select an unprotected link $l$
3:	Remove link $l$
4:	Use Dijkstra’s algorithm to find a shortest path $sp$ between
	the two ends of the link
5:	Merge $l$ and $sp$ as a p-cycle $p$

1:	procedure Initialize-FIPP-p-cycle
2:	Randomly select an unprotected node pair $a$ and $b$
3:	Use Dijkstra’s algorithm to find a shortest path ${sp}_{1}$
	between the two ends.
4:	Remove the links on path ${sp}_{1}$ from the topology.
5:	Remove links that connect with nodes on ${sp}_{1}$ from the
	network
6:	Use Dijkstra’s algorithm to find a shortest path ${sp}_{2}$
	between the two ends.
7:	Merge ${sp}_{1}$ and ${sp}_{2}$ as a p-cycle $p$

1:	procedure Expand-p-cycle ( $p$ )
2:	Randomly select an unchecked on-cycle link $l$ on cycle $p$
3:	Mark the two ends of $l$ as $a$ , $b$
4:	Remove all the links on $p$ from the network
5:	Remove links that are incident to the nodes on
	$p$ (excluding $a$ and $b$ ) from the network
6:	Use Dijkstra’s algorithm to find the shortest path $R$ in
	hops between $a$ and $b$
7:	if $R$ does not exist then
8:	Mark link $l$ as checked;
9:	if All the on-cycle links are marked as checked then
10:	End procedure and return NULL
11:	else
12:	Goto line 2
13:	end if
14:	end if
15:	Merge $R$ and $p$ and make this the new cycle $p$

1:	procedure Route-and-assign-spectrum
2:	for Each request $r (s, d, w) \in R$ do
3:	Calculate working lightpath $L P$ by CR algorithm
4:	for Each link or node pair do
5:	Calculate the longest segment of protection path
6:	Calculate the modulation factor $M$ with distance
7:	end for
8:	Select the modulation format with the highest
	modulation factor
9:	Determine the number of FSs $F$
10:	Set $S I_{start} = 1$
11:	while $S I_{start} \leq S I_{max} - F + 1$ do
12:	for every link $l \in L P$ do
13:	if FSs with index $S I_{start}$ to $S I_{start} + F - 1$ are
	available then
14:	Assign $S I_{start}$ to $S I_{start} + F - 1$ as working and
	protection FSs of $L P$ .
15:	BREAK
16:	else
17:	$S I_{start} = S I_{start} + 1$
18:	end if
19:	end for
20:	end while
21:	end for

Modulation	Transparent Reach
16QAM	500 km
8QAM	1000 km
QPSK	2000 km
BPSK	>2000 km

Modulation	Transparent Reach
16QAM	500 km
8QAM	1000 km
QPSK	2000 km
BPSK	>2000 km

Abstract

Cited By

Figures (15)

Tables (6)

Equations (10)

Journal of Optical Communications and Networking