Routing, Modulation, and Spectrum Assignment in Programmable Networks Based on Optical White Boxes

Vahid Abedifar; Marija Furdek; Ajmal Muhammad; Mohammad Eshghi; Lena Wosinska

doi:10.1364/JOCN.10.000723

Journal of Optical Communications and Networking
Vol. 10,
Issue 9,
pp. 723-735
(2018)
•https://doi.org/10.1364/JOCN.10.000723

Routing, Modulation, and Spectrum Assignment in Programmable Networks Based on Optical White Boxes

Vahid Abedifar, Marija Furdek, Ajmal Muhammad, Mohammad Eshghi, and Lena Wosinska

Not Accessible

Your library or personal account may give you access

Get PDF
Email
Share
Get Citation
Copy Citation Text
Vahid Abedifar, Marija Furdek, Ajmal Muhammad, Mohammad Eshghi, and Lena Wosinska, "Routing, Modulation, and Spectrum Assignment in Programmable Networks Based on Optical White Boxes," J. Opt. Commun. Netw. 10, 723-735 (2018)

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

Abstract

Elastic optical networks (EONs) can help overcome the flexibility challenges imposed by emerging heterogeneous and bandwidth-intensive applications. Among the different solutions for flexible optical nodes, optical white box switches implemented by architecture on demand (AoD) have the capability to dynamically adapt their architecture and module configuration to the switching and processing requirements of the network traffic. Such adaptability allows for unprecedented flexibility in balancing the number of required nodal components in the network, spectral resource usage, and length of the established paths. To investigate these trade-offs and achieve cost-efficient network operation, we formulate the routing, modulation, and spectrum assignment (RMSA) problem in AoD-based EONs and propose three RMSA strategies aimed at optimizing a particular combination of these performance indicators. The strategies rely on a newly proposed internal node configuration matrix that models the structure of optical white box nodes in the network, thus facilitating hardware-aware routing of connection demands. The proposed strategies are evaluated in terms of the number of required modules and the related cost, spectral resource usage, and average path length. Extensive simulation results show that the proposed RMSA strategies can achieve remarkable cost savings by requiring fewer switching modules than the benchmarking approaches, at a favorable trade-off with spectrum usage and path length.

Full Article | PDF Article

More Like This

On-Demand Routing and Spectrum Allocation for Energy-Efficient AoD Nodes in SDM-EONs

Shohei Fujii, Yusuke Hirota, Hideki Tode, and Takashi Watanabe
J. Opt. Commun. Netw. 9(11) 960-973 (2017)

Introducing Flexible and Synthetic Optical Networking: Planning and Operation Based on Network Function Programmable ROADMs

Ajmal Muhammad, Georgios Zervas, Norberto Amaya, Dimitra Simeonidou, and Robert Forchheimer
J. Opt. Commun. Netw. 6(7) 635-648 (2014)

Dynamic routing, spectrum, and modulation-format allocation in mixed-grid optical networks

Tanjila Ahmed, Sabidur Rahman, Sifat Ferdousi, Massimo Tornatore, Abhijit Mitra, Bijoy Chand Chatterjee, and Biswanath Mukherjee
J. Opt. Commun. Netw. 12(5) 79-88 (2020)

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

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

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

Input:	- Physical topology $G (V, E)$ ;
	- Set of connection demands $T = {{(s, d, t)}_{i}}$ ;
1: Initialize the used modules Modules_I $(\| V \|) = M o d u l e s_O (\| V \|) = 0$ ;
2: Initialize the INC matrices $I N C_I = 0.5$ , $I N C_O = 0.5$ ;
3: Initialize the link weights $W$ according to INC_I, INC_O;
4: Sort $T$ in descending order of requested traffic ( $t_{i}$ );
5: for each demand $(s, d, t) ε$ sorted $T$ do
6: HRA (Alg. 2) / HSRA (Alg. 3) / HPRA (Alg. 4);
7: Update $W$ using Eq. (1);
8: end for

	- Path length $P L$ (km) of the connection demand;
		- Traffic $t$ (Gb/s) of the connection demand;
	Input: - Set of $n$ available modulation formats $M o d = {{(L, M, R, B, C)}_{i}, 1 \leq i \leq n}$ , with linerate $L$ (Gb/s), modulation format $M$ , reach $R$ (km), bandwidth $B$ (GHz), and transponder cost $C$ ;
1: Initialize the set of possible modulation formats $M o d^{'} = ϕ$ ;
2: Initialize the number of assigned frequency slots $n_s l o t s = 0$ ;
3: for each modulation format $i$ in Mod do
4: if ( $P L \leq R_{i}$ ) do
5: Add ${(L, M, R, B, C)}_{i}$ to $M o d^{'}$ ;
6: end if
7: end for
8: for each modulation format $j$ in $M o d^{'}$ do
9: $s l o t_{j} = ⌈ B_{j} / 12.5 GHz ⌉ * ⌈ t / L_{j} ⌉$ ;
10: end for
11: $n_s l o t s = \min {s l o t_{j}}$ ;
12: if $n (\min {s l o t_{j}}) \geq 1$ do
13: $n_s l o t s = {\min {s l o t_{j}} \|}_{\min {C_{j^{*}} ⌈ t / L_{j} ⌉}}$ ;
14: end if

Line Rate (Gb/s)	Modulation Format	Channel Bandwidth (GHz)	Reach (km)	Cost (a.u.)
100	DP-QPSK	37.5	2000	1.5
200	DP-16QAM	37.5	700	2
400	DP-16QAM	75	500	3.7

Input:	- Physical topology $G (V, E)$ ;
	- Set of connection demands $T = {{(s, d, t)}_{i}}$ ;
1: Initialize the used modules Modules_I $(\| V \|) = M o d u l e s_O (\| V \|) = 0$ ;
2: Initialize the INC matrices $I N C_I = 0.5$ , $I N C_O = 0.5$ ;
3: Initialize the link weights $W$ according to INC_I, INC_O;
4: Sort $T$ in descending order of requested traffic ( $t_{i}$ );
5: for each demand $(s, d, t) ε$ sorted $T$ do
6: HRA (Alg. 2) / HSRA (Alg. 3) / HPRA (Alg. 4);
7: Update $W$ using Eq. (1);
8: end for

	- Path length $P L$ (km) of the connection demand;
		- Traffic $t$ (Gb/s) of the connection demand;
	Input: - Set of $n$ available modulation formats $M o d = {{(L, M, R, B, C)}_{i}, 1 \leq i \leq n}$ , with linerate $L$ (Gb/s), modulation format $M$ , reach $R$ (km), bandwidth $B$ (GHz), and transponder cost $C$ ;
1: Initialize the set of possible modulation formats $M o d^{'} = ϕ$ ;
2: Initialize the number of assigned frequency slots $n_s l o t s = 0$ ;
3: for each modulation format $i$ in Mod do
4: if ( $P L \leq R_{i}$ ) do
5: Add ${(L, M, R, B, C)}_{i}$ to $M o d^{'}$ ;
6: end if
7: end for
8: for each modulation format $j$ in $M o d^{'}$ do
9: $s l o t_{j} = ⌈ B_{j} / 12.5 GHz ⌉ * ⌈ t / L_{j} ⌉$ ;
10: end for
11: $n_s l o t s = \min {s l o t_{j}}$ ;
12: if $n (\min {s l o t_{j}}) \geq 1$ do
13: $n_s l o t s = {\min {s l o t_{j}} \|}_{\min {C_{j^{*}} ⌈ t / L_{j} ⌉}}$ ;
14: end if

Abstract

Cited By

Figures (19)

Tables (6)

Equations (5)

Journal of Optical Communications and Networking