Spectrum allocation scheme considering spectrum slicing in elastic optical networks

Nattapong Kitsuwan; Kaito Akaki; Praphan Pavarangkoon; Avishek Nag

doi:10.1364/JOCN.422915

Journal of Optical Communications and Networking
Vol. 13,
Issue 7,
pp. 169-181
(2021)
•https://doi.org/10.1364/JOCN.422915

Spectrum allocation scheme considering spectrum slicing in elastic optical networks

Nattapong Kitsuwan, Kaito Akaki, Praphan Pavarangkoon, and Avishek Nag

Not Accessible

Your library or personal account may give you access

Get PDF
Email
Share
Get Citation
Copy Citation Text
Nattapong Kitsuwan, Kaito Akaki, Praphan Pavarangkoon, and Avishek Nag, "Spectrum allocation scheme considering spectrum slicing in elastic optical networks," J. Opt. Commun. Netw. 13, 169-181 (2021)

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

Abstract

Recent advances in physical layer optics have made slicing of optical bands into multiple subbands with different bandwidths possible. Due to this development, spectrum allocation has become easier in elastic optical networks (EONs). More specifically, owing to the slicing technology, the defragmentation problem in EONs can be addressed easily, i.e., more demands can be fit into empty spectrum slots by breaking the demands as needed using the slicing technology. This paper proposes a spectrum allocation scheme considering the slicing process at any nodes, e.g., source node and intermediate nodes, in EONs. Slicing-and-stitching technology is applied to break the contiguous-spectrum constraint in an EON so that spectrum fragmentation is reduced. While slicing a demand from one node to another, the following questions must be answered: (1) Which parts of the spectrum band should be sliced? (2) In which node(s) along the path of a demand should the slicings be done to reduce the bandwidth blocking rate? To answer the above questions, we formulate a mixed-integer linear programming (MILP) model that jointly addresses the above questions as well as minimizes the total number of slicers in a network. To measure the performance of the MILP, we used the bandwidth blocking ratio (BBR) of the network as a performance metric. Our results from the MILP show that introducing slicing at every node in the network improves the BBR by as much as 68% compared to a conventional case where slicing a demand is allowed only at the source node.

Full Article | PDF Article

More Like This

Towards Elastic and Fine-Granular Bandwidth Allocation in Spectrum-Sliced Optical Networks

Yang Wang, Xiaojun Cao, Qian Hu, and Yi Pan
J. Opt. Commun. Netw. 4(11) 906-917 (2012)

Fragmentation-Aware Routing and Spectrum Allocation Scheme Based on Distribution of Traffic Bandwidth in Elastic Optical Networks

Xin Chen, Juhao Li, Paikun Zhu, Ruizhi Tang, Zhangyuan Chen, and Yongqi He
J. Opt. Commun. Netw. 7(11) 1064-1074 (2015)

Efficient Resource Allocation for All-Optical Multicasting Over Spectrum-Sliced Elastic Optical Networks

Long Gong, Xiang Zhou, Xiahe Liu, Wenwen Zhao, Wei Lu, and Zuqing Zhu
J. Opt. Commun. Netw. 5(8) 836-847 (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 (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 (4)

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

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

Characteristic	Push-Pull [7,8]	Hop-Tuning [9]	First-Fit [10]	First-Last-Exact Fit [5]	Conventional [12,13]	Proposed (This Paper)
Type of solution	Defragmentation	Defragmentation	RSA	RSA	RSA	RSA
Need backup lightpath	No	Yes	No	No	No	No
Reconfiguration of existing slots	Yes	Yes	No	No	No	No
Time to activate the scheme	When a new request cannot be allocated	When a new request cannot be allocated	When each request arrives	When each request arrives	When each request arrives	When each request arrives
Spectrum allocation rules	Continuous and contiguous	Continuous and contiguous	Continuous and contiguous	Continuous and contiguous	Only contiguous	Only contiguous
Use slice-and-stitching	No	No	No	No	Yes	Yes
Placement of slicers	–	–	–	–	Only source node	Source and intermediate nodes

Set	Description
$V$	Set of nodes
$E$	Set of links
$F$	Set of spectrum slots
$P$	Set of shortest paths
$S$	Set of spectrum components
$Q$	Set of slicing patterns
$(q, s) \in R$	Set of the ordered pair of pattern $q \in Q$ and spectrum component $s \in S$
$(i, j, p) \in M$	Set of routes, where $(i, j, p)$ indicates that link $(i, j) \in E$ is on path $p \in P$
$U$	Set of occupied slots on links

Parameter	Description
$H$	Source node of the request
$T$	Number of requested slots
$G$	Number of slots for the guardband
$O^{q s}$	Number of utilized slots for spectrum component $s \in S$ with slicing pattern $q \in Q$ for the request
$l^{q}$	Number of required slicers used for slicing pattern $q \in Q$
$r_{i j}^{p}$	Given binary parameter, which indicates the utilized link $(i, j) \in E$ on path $p \in P$
$δ_{i}$	Given parameter that indicates the number of available slicers at node $i \in V$
$g_{f i j}$	Slot index $f \in F$ on link $(i, j) \in E$ is occupied if it is set to 1, and 0 otherwise, where $(f, i, j) \in U$

Variable	Description
$c$	Maximum allocated spectrum slots for request
$x_{f i j}^{p q s}$	Binary decision variable that is set to 1 if slot index $f \in F$ is possible to be a starting spectrum slot index on link $(i, j) \in E$ on path $p \in P$ for the sth spectrum component with slicing pattern $q \in Q$
$y_{f i j}^{p q s}$	Binary decision variable that is set to 1 if slot index $f \in F$ is used on link $(i, j) \in E$ on path $p \in P$ for the sth spectrum component with slicing pattern $q \in Q$
$z_{f i j}^{p q s}$	Binary decision variable that is set to 1 if slot index $f \in F$ is the ending spectrum slot index on link $(i, j) \in E$ on path $p \in P$ for the sth spectrum component with slicing pattern $q \in Q$
$a_{i j}^{p q}$	Binary decision variable that is set to 1 if link $(i, j) \in E$ on path $p \in P$ and slicing pattern $q \in Q$ is selected
$α_{i}$	Number of utilized slicers on node $i$

Characteristic	Push-Pull [7,8]	Hop-Tuning [9]	First-Fit [10]	First-Last-Exact Fit [5]	Conventional [12,13]	Proposed (This Paper)
Type of solution	Defragmentation	Defragmentation	RSA	RSA	RSA	RSA
Need backup lightpath	No	Yes	No	No	No	No
Reconfiguration of existing slots	Yes	Yes	No	No	No	No
Time to activate the scheme	When a new request cannot be allocated	When a new request cannot be allocated	When each request arrives	When each request arrives	When each request arrives	When each request arrives
Spectrum allocation rules	Continuous and contiguous	Continuous and contiguous	Continuous and contiguous	Continuous and contiguous	Only contiguous	Only contiguous
Use slice-and-stitching	No	No	No	No	Yes	Yes
Placement of slicers	–	–	–	–	Only source node	Source and intermediate nodes

Abstract

Cited By

Figures (15)

Tables (4)

Equations (31)

Journal of Optical Communications and Networking