Routing, Spectrum, and Core Assignment in SDM-EONs With MCF: Node-Arc ILP/MILP Methods and an Efficient XT-Aware Heuristic Algorithm

Mingcong Yang; Yongbing Zhang; Qian Wu

doi:10.1364/JOCN.10.000195

Journal of Optical Communications and Networking
Vol. 10,
Issue 3,
pp. 195-208
(2018)
•https://doi.org/10.1364/JOCN.10.000195

Routing, Spectrum, and Core Assignment in SDM-EONs With MCF: Node-Arc ILP/MILP Methods and an Efficient XT-Aware Heuristic Algorithm

Mingcong Yang, Yongbing Zhang, and Qian Wu

Not Accessible

Your library or personal account may give you access

Get PDF
Email
Share
Get Citation
Copy Citation Text
Mingcong Yang, Yongbing Zhang, and Qian Wu, "Routing, Spectrum, and Core Assignment in SDM-EONs With MCF: Node-Arc ILP/MILP Methods and an Efficient XT-Aware Heuristic Algorithm," J. Opt. Commun. Netw. 10, 195-208 (2018)

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

Abstract

In this paper, we focus on the static routing, spectrum, and core assignment (RSCA) problem in space-division multiplexing (SDM)-based elastic optical networks (EONs) with multi-core fiber (MCF). In RSCA problems, it is a challenging task to control the inter-core interference, called inter-core crosstalk (XT), within an acceptable level and simultaneously maximize the spectrum utilization. We first consider XT in a worst interference scenario (i.e., XT-unaware), which can simplify the RSCA problem. In this scenario, we formulate the RSCA problem using a node-arc-based integer linear programming (ILP) method in which the numbers of both variables and constraints are greatly reduced compared with previous ILP methods, thereby leading to a significant improvement in convergence efficiency. Then, we consider the XT strictly (i.e., XT-aware) and formulate the problem using a mixed integer linear programming (MILP) method, which is an extension of the above node-arc-based ILP method. It is more suitable for different XT thresholds and/or geographically large networks, in that it has a higher degree of generalizability. Finally, we propose an XT-aware-based heuristic algorithm. The simulation results demonstrate that our heuristic algorithm achieves higher spectrum efficiency, higher degree of generalizability, and higher computational efficiency than the existing heuristic algorithm(s).

Full Article | PDF Article

Corrections

27 March 2018: A typographical correction was made to Algorithm 1.

More Like This

Joint Banding-Node Placement and Resource Allocation for Multigranular Elastic Optical Networks

Jingxin Wu, Maotong Xu, Suresh Subramaniam, and Hiroshi Hasegawa
J. Opt. Commun. Netw. 10(8) C27-C38 (2018)

Impairment-Aware Manycast Routing, Modulation Level, and Spectrum Assignment in Elastic Optical Networks

Mehdi Habibi and Hamzeh Beyranvand
J. Opt. Commun. Netw. 11(5) 179-189 (2019)

Efficient Dynamic Routing and Spectrum Assignment for Multifiber Elastic Optical Networks

Jingxin Wu, Suresh Subramaniam, and Hiroshi Hasegawa
J. Opt. Commun. Netw. 11(5) 190-201 (2019)

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

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

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

Model	# Variables	# Constraints
Our ILP model	$O ({\| R \|}^{2})$	$O ({\| R \|}^{2} \cdot \| E \|)$
Our MILP model	$O ({\| R \|}^{2} \cdot \| E \| \cdot λ)$	$O ({\| R \|}^{2} \cdot \| E \| \cdot λ)$
ILP model in Ref. [21]	$O ({\| R \|}^{2} \cdot \| E \|)$	$O ({\| R \|}^{2} \cdot \| E \|)$ or $O (\| R \| \cdot \| P \|)$
ILP model in Ref. [18]	$O ({\| R \|}^{2} \cdot {\| P \|}^{2})$	$O ({\| R \|}^{2} \cdot {\| P \|}^{2})$

Model	Columns	Rows	Non-Zeros
Our ILP model (Section II.A)	736	6,285	31,185
Our MILP model (Section II.B)	35,836	33,823	449,578
ILP Model in Ref. [21] (All paths)	15,623	23,239	95,490
ILP Model in Ref. [21] ( $\| P \| = 5$ )	14,671	23,205	94,026
ILP Model in Ref. [21] ( $\| P \| = 3$ )	13,831	23,175	92,796
ILP Model in Ref. [18] (All paths)	44,674	99,560	375,536
ILP Model in Ref. [18] ( $\| P \| = 5$ )	21,586	47,850	180,240
ILP Model in Ref. [18] ( $\| P \| = 3$ )	8,026	17,550	65,820

$Θ$ (dB)	−30	−32	−34	−36	−38	−40
Number of Blocked $r$	0	0	1	3	7	12

$Θ$ (dB)	−26	−27	−28	−29	−30	−31	−32
NSF-14	1.1	8.7	23.8	40.7	56.6	70.9	81.5
EON-28	0.0	16.5	31.9	44.0	62.6	71.4	80.2

Model	# Variables	# Constraints
Our ILP model	$O ({\| R \|}^{2})$	$O ({\| R \|}^{2} \cdot \| E \|)$
Our MILP model	$O ({\| R \|}^{2} \cdot \| E \| \cdot λ)$	$O ({\| R \|}^{2} \cdot \| E \| \cdot λ)$
ILP model in Ref. [21]	$O ({\| R \|}^{2} \cdot \| E \|)$	$O ({\| R \|}^{2} \cdot \| E \|)$ or $O (\| R \| \cdot \| P \|)$
ILP model in Ref. [18]	$O ({\| R \|}^{2} \cdot {\| P \|}^{2})$	$O ({\| R \|}^{2} \cdot {\| P \|}^{2})$

Routing, Spectrum, and Core Assignment in SDM-EONs With MCF: Node-Arc ILP/MILP Methods and an Efficient XT-Aware Heuristic Algorithm

Author Affiliations

ORCID

Abstract

Corrections

Cited By

Figures (10)

Tables (6)

Equations (20)

Journal of Optical Communications and Networking