Energy Efficient Survivable IP-Over-WDM Networks With Network Coding

Mohamed Musa; Taisir Elgorashi; Jaafar Elmirghani

doi:10.1364/JOCN.9.000207

Journal of Optical Communications and Networking
Vol. 9,
Issue 3,
pp. 207-217
(2017)
•https://doi.org/10.1364/JOCN.9.000207

Energy Efficient Survivable IP-Over-WDM Networks With Network Coding

Mohamed Musa, Taisir Elgorashi, and Jaafar Elmirghani

Not Accessible

Your library or personal account may give you access

Get PDF
Email
Share
Get Citation
Copy Citation Text
Mohamed Musa, Taisir Elgorashi, and Jaafar Elmirghani, "Energy Efficient Survivable IP-Over-WDM Networks With Network Coding," J. Opt. Commun. Netw. 9, 207-217 (2017)

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

Abstract

In this work we investigate the use of network coding in $1 + 1$ survivable IP-over-wavelength-division-multiplexing (WDM) networks by encoding the protection paths of multiple flows with each other at intermediate nodes. We study the energy efficiency of this scheme through mixed-integer linear programming (MILP) and a heuristic with five operating options. We evaluate the MILP and the heuristics on typical and regular network topologies. Our results show that implementing network coding can produce savings up to 37% on the ring topology and 23% considering typical topologies. We also study the impact of varying the demand volumes on the network coding performance.

Full Article | PDF Article

Corrections

22 February 2017: A correction was made to the acknowledgments.

More Like This

Bounds for Energy-Efficient Survivable IP Over WDM Networks With Network Coding

Mohamed Musa, Taisir Elgorashi, and Jaafar Elmirghani
J. Opt. Commun. Netw. 10(5) 471-481 (2018)

A Comparative Performance Study of Load Adaptive Energy Saving Schemes for IP-Over-WDM Networks

Marcel Caria, Mohit Chamania, and Admela Jukan
J. Opt. Commun. Netw. 4(3) 152-164 (2012)

Design for Energy-Efficient IP Over WDM Networks With Joint Lightpath Bypass and Router-Card Sleeping Strategies

Yunlei Lui, Gangxiang Shen, and Weidong Shao
J. Opt. Commun. Netw. 5(11) 1122-1138 (2013)

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

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

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

Set	Description
$N$	Set of the network nodes
$N_{m}$	Set of the neighboring nodes to node $m$

Parameter	Description
$V^{d}$	The volume of demand $d$ in Gbps
$src (d)$	The source node of demand $d$
$dst (d)$	The destination node of demand $d$
$p_{p}$	The power consumption of a router port
$p_{t}$	The power consumption of a transponder
$p_{e}$	The power consumption of an EDFA
$B$	The capacity of a wavelength in Gbps
$W$	Number of wavelengths per fiber
$p_{xor}$	The power used by a network coding/decoding operation

Variable	Description
$P_{T}$	The total power of the network
$x_{m n}^{d}$	Binary variable, $x_{m n}^{d} = 1$ if the working path of demand $d$ is routed over link $(m, n)$ , and $x_{m n}^{d} = 0$ otherwise
$y_{m n}^{d}$	Binary variable, $y_{m n}^{d} = 1$ if the protection path of demand $d$ is routed over link $(m, n)$ , and $y_{m n}^{d} = 0$ otherwise
$b_{d_{2}}^{d_{1}}$	Binary variable, $b_{d_{2}}^{d_{1}} = 1$ if demand $d_{1}$ is encoded with demand $d_{2}$ , and $b_{d_{2}}^{d_{1}} = 0$ otherwise
$h_{d_{2}}^{d_{1}}$	The number of shared links between the demand $d_{1}$ and $d_{2}$
$β_{m n}^{d_{1} d_{2}}$	Binary variable, $β_{m n}^{d_{1} d_{2}} = 1$ if demand $d_{1}$ is encoded with demand $d_{2}$ on link $(m, n)$ , and $β_{m n}^{d_{1} d_{2}} = 0$ otherwise
$A_{m n}$	The number of EDFAs in a physical link $(m, n)$ . Typically $A_{m n} = ⌊ L_{m n} / S - 1 ⌋$ , where $S$ is the distance between two neighboring EDFAs
$f_{m n}$	The number of fibers on physical link $(m, n)$

Parameter	Value
Distance between neighboring EDFAs	80 km
Number of wavelengths in a fiber (W)	16
Capacity of each wavelength (B)	40 Gbps
Power consumption or a normal port (Pp) [26]	1 kW
Power consumption of a coded port (Px)	1.1 kW
Power consumption of a transponder (Pt) [27]	73 W
Power consumption of an optical switch (PO) [28]	85 W
Power consumption of a MUX/DeMUX [29]	16 W
EDFA power consumption (Pe) [30]	8 W
Power consumption of the coding operation ( $p_{xor}$ )	20 W

Set	Description
$N$	Set of the network nodes
$N_{m}$	Set of the neighboring nodes to node $m$

Abstract

Corrections

Cited By

Figures (18)

Tables (5)

Equations (17)

Journal of Optical Communications and Networking