Class-of-Service-Based Multilayer Architecture for Traffic Restoration in Elastic Optical Networks

Djamel Amar; Esther Le Rouzic; Nicolas Brochier; Catherine Lepers

doi:10.1364/JOCN.8.000A34

Journal of Optical Communications and Networking
Vol. 8,
Issue 7,
pp. A34-A44
(2016)
•https://doi.org/10.1364/JOCN.8.000A34

Class-of-Service-Based Multilayer Architecture for Traffic Restoration in Elastic Optical Networks

Djamel Amar, Esther Le Rouzic, Nicolas Brochier, and Catherine Lepers

Not Accessible

Your library or personal account may give you access

Get PDF
Email
Share
Get Citation
Copy Citation Text
Djamel Amar, Esther Le Rouzic, Nicolas Brochier, and Catherine Lepers, "Class-of-Service-Based Multilayer Architecture for Traffic Restoration in Elastic Optical Networks," J. Opt. Commun. Netw. 8, A34-A44 (2016)

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

Abstract

In this work, we propose and investigate a class-of-service-based multilayer architecture for traffic restoration in elastic optical networks. This architecture benefits from both data rate elasticity and low quality of service requirements of best-effort traffic in IP-over-WDM optical networks, combining $1 + 1$ IP protection for gold traffic and optical restoration for best-effort traffic. Numerical simulations reveal that the proposed architecture can further reduce capital expenditures, even with the significant extra cost of elastic transponders.

Full Article | PDF Article

More Like This

Joint Multi-layer Survivability Techniques for IP-Over-Elastic-Optical-Networks

P. Papanikolaou, K. Christodoulopoulos, and E. Varvarigos
J. Opt. Commun. Netw. 9(1) A85-A98 (2017)

Multi-objective Design of Survivable Flexible-Grid DWDM Networks

António Eira, João Santos, João Pedro, and João Pires
J. Opt. Commun. Netw. 6(3) 326-339 (2014)

Multiperiod IP-Over-Elastic Network Reconfiguration With Adaptive Bandwidth Resizing and Modulation

Takafumi Tanaka, Tetsuro Inui, Akihiro Kadohata, Wataru Imajuku, and Akira Hirano
J. Opt. Commun. Netw. 8(7) A180-A190 (2016)

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

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

Data Rate	Format	Reach	Transponder Cost	Regenerator Cost	Elastic Transp. Cost	Required IP Interfaces	IP Int. Cost
25 Gbps	SP-BPSK^a	6000 km	1	$2 \times 1$	$1 + α$	$1 \times 100 Gbps$	$1 \times 2$
50 Gbps	DP-BPSK^b	4800 km	1	$2 \times 1$	$1 + α$	$1 \times 100 Gbps$	$1 \times 2$
75 Gbps	PS-QPSK^c	3200 km	1	$2 \times 1$	$1 + α$	$1 \times 100 Gbps$	$1 \times 2$
100 Gbps	DP-QPSK^d	2100 km	1	$2 \times 1$	$1 + α$	$1 \times 100 Gbps$	$1 \times 2$
200 Gbps	DP-16QAM^e	400 km	1	$2 \times 1$	$1 + α$	$2 \times 100 Gbps$	$2 \times 2$

Data
$G (N, E)$	Graph $G$ with set of nodes $N$ and links $E$
$C_{I}$	Cost of one 100 Gbps IP interface
$C_{T}$	Cost of one transponder
$S_{x y}$	Shortest path between nodes $x$ and $y$
$P$	Set of virtual links $P_{l}$
$P_{s d}$	Path between nodes $s$ and $d$
$R_{k}$	Data rate of a transponder of type $k$
$β_{o p k}$	Equals 1 if a transponder of type $k$ can be used on the shortest path between nodes $o, p \in N$ without regenerators; 0 otherwise
$β_{l k}$	Equals 1 if a transponder of type $k$ can be used on the physical link corresponding to the virtual link $P_{l} \in P$ without regenerators; 0 otherwise
$Δ_{s d}$	Traffic demand between nodes $s, d \in N$
$B_{I}$	IP interface capacity (100 Gbps)
$D_{B}$	Best-effort traffic to be restored in Phase III
Decision Variables
$Z_{i j}^{s d λ}$	Traffic between nodes $s, d \in N$ routed on the lightpath $(i, j)$ with wavelength $λ$
$Y_{p o}^{i j λ}$	Traffic on lightpath $(i, j)$ and sublightpath $(o, p)$ with wavelength $λ$
$I_{i j}^{λ}$	Number of IP interfaces corresponding to the lightpath $(i, j)$ and used with the wavelength $λ$ . For example, two 100 Gbps interfaces are required with a 200 Gbps transponder.
$X_{o p k}^{i j λ}$	Equals 1 if a transponder of type $k$ is used on a sublightpath $(o, p)$ corresponding to a lightpath $(i, j)$ with a wavelength $λ$ ; 0 otherwise
$X_{k λ l}$	Equals 1 if a transponder of type $k$ is used on the virtual link $P_{l} \in P$ with wavelength $λ$ ; 0 otherwise

Lightpaths		Traffic Demands	Candidate Transponders	# IP Interfaces	Regeneration Is Needed?	Cost
$λ_{1}$	(1, 2)	$D_{2}$	50, 75, 100	2	no	6
	(2, 4)	$D_{2}$ , $D_{3}$	100	2	no	6
	(4, 5)	$D_{3}$	50, 75, 100	2	no	6
$λ_{2}$	(1, 2)	D1, $D_{4}$	200	4	no	10
$λ_{2}$	(2, 6)	$D_{4}$	200	4	yes	12
Total cost						40

Data Rate	Format	Reach	Transponder Cost	Regenerator Cost	Elastic Transp. Cost	Required IP Interfaces	IP Int. Cost
25 Gbps	SP-BPSK^a	6000 km	1	$2 \times 1$	$1 + α$	$1 \times 100 Gbps$	$1 \times 2$
50 Gbps	DP-BPSK^b	4800 km	1	$2 \times 1$	$1 + α$	$1 \times 100 Gbps$	$1 \times 2$
75 Gbps	PS-QPSK^c	3200 km	1	$2 \times 1$	$1 + α$	$1 \times 100 Gbps$	$1 \times 2$
100 Gbps	DP-QPSK^d	2100 km	1	$2 \times 1$	$1 + α$	$1 \times 100 Gbps$	$1 \times 2$
200 Gbps	DP-16QAM^e	400 km	1	$2 \times 1$	$1 + α$	$2 \times 100 Gbps$	$2 \times 2$

Data
$G (N, E)$	Graph $G$ with set of nodes $N$ and links $E$
$C_{I}$	Cost of one 100 Gbps IP interface
$C_{T}$	Cost of one transponder
$S_{x y}$	Shortest path between nodes $x$ and $y$
$P$	Set of virtual links $P_{l}$
$P_{s d}$	Path between nodes $s$ and $d$
$R_{k}$	Data rate of a transponder of type $k$
$β_{o p k}$	Equals 1 if a transponder of type $k$ can be used on the shortest path between nodes $o, p \in N$ without regenerators; 0 otherwise
$β_{l k}$	Equals 1 if a transponder of type $k$ can be used on the physical link corresponding to the virtual link $P_{l} \in P$ without regenerators; 0 otherwise
$Δ_{s d}$	Traffic demand between nodes $s, d \in N$
$B_{I}$	IP interface capacity (100 Gbps)
$D_{B}$	Best-effort traffic to be restored in Phase III
Decision Variables
$Z_{i j}^{s d λ}$	Traffic between nodes $s, d \in N$ routed on the lightpath $(i, j)$ with wavelength $λ$
$Y_{p o}^{i j λ}$	Traffic on lightpath $(i, j)$ and sublightpath $(o, p)$ with wavelength $λ$
$I_{i j}^{λ}$	Number of IP interfaces corresponding to the lightpath $(i, j)$ and used with the wavelength $λ$ . For example, two 100 Gbps interfaces are required with a 200 Gbps transponder.
$X_{o p k}^{i j λ}$	Equals 1 if a transponder of type $k$ is used on a sublightpath $(o, p)$ corresponding to a lightpath $(i, j)$ with a wavelength $λ$ ; 0 otherwise
$X_{k λ l}$	Equals 1 if a transponder of type $k$ is used on the virtual link $P_{l} \in P$ with wavelength $λ$ ; 0 otherwise

Abstract

Cited By

Figures (8)

Tables (3)

Equations (16)

Journal of Optical Communications and Networking