Route Partitioning Scheme for Elastic Optical Networks With Hitless Defragmentation

Seydou Ba; Bijoy Chand Chatterjee; Satoru Okamoto; Naoaki Yamanaka; Andrea Fumagalli; Eiji Oki

doi:10.1364/JOCN.8.000356

Journal of Optical Communications and Networking
Vol. 8,
Issue 6,
pp. 356-370
(2016)
•https://doi.org/10.1364/JOCN.8.000356

Route Partitioning Scheme for Elastic Optical Networks With Hitless Defragmentation

Seydou Ba, Bijoy Chand Chatterjee, Satoru Okamoto, Naoaki Yamanaka, Andrea Fumagalli, and Eiji Oki

Get PDF
Email
Share
Get Citation
Copy Citation Text
Seydou Ba, Bijoy Chand Chatterjee, Satoru Okamoto, Naoaki Yamanaka, Andrea Fumagalli, and Eiji Oki, "Route Partitioning Scheme for Elastic Optical Networks With Hitless Defragmentation," J. Opt. Commun. Netw. 8, 356-370 (2016)

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

Related Topics
Optics & Photonics Topics
?

The topics in this list come from the Optics and Photonics Topics applied to this article.

About this Article
History
- Original Manuscript: June 29, 2015
- Revised Manuscript: January 31, 2016
- Manuscript Accepted: April 7, 2016
- Published: May 5, 2016

Accepted Manuscript
Download Accepted Manuscript
Access to this article is made available via and is subject to OSA Publishing Terms of Use.

Abstract

Hitless defragmentation has been introduced as an approach to limit the spectrum fragmentation in elastic optical networks without traffic disruption. It facilitates the accommodation of new requests by creating large spectrum blocks as it moves active lightpaths (retuning) to fill in gaps left in the spectrum by expired ones. Nevertheless, hitless defragmentation witnesses limitations for gradual retuning with the conventionally used first-fit allocation. The first-fit allocation stacks all lightpaths to the lower end of the spectrum. This leads to a large number of lightpaths that need to be retuned and are subject to interfering with each other’s retuning. This paper proposes a route partitioning scheme for hitless defragmentation in order to increase the admissible traffic in elastic optical networks. The proposed scheme uses route partitioning with the first-last fit allocation to increase the possibilities of lightpath retuning by avoiding the retuning interference among lightpaths. The first-last fit allocation is used to set a bipartition with one partition allocated with the first fit and the second with the last fit. Lightpaths that are allocated on different partitions cannot interfere with each other. Thus, the route partitioning avoids interference among lightpaths when retuning. We define the route partitioning problem as an optimization problem to minimize the total interference. We then introduce an integer linear programming problem (ILP) that yields an optimal routing and partitioning. We prove that the route partitioning problem is non-deterministic polynomial-time hard (NP-hard). We present a heuristic algorithm for large networks, where the ILP used to represent the route partitioning is not tractable. The simulation results show that the proposed route partitioning scheme using the first-last fit outperforms the conventional first-fit allocation for hitless defragmentation in term of allowable traffic.

Full Article | PDF Article

More Like This

Software-Defined Elastic Optical Network Node Supporting Spectrum Defragmentation

Paikun Zhu, Juhao Li, Dan Wu, Yuanxiang Chen, Yu Tian, Zhongying Wu, Dawei Ge, Xin Chen, Zhangyuan Chen, and Yongqi He
J. Opt. Commun. Netw. 9(1) A63-A70 (2017)

Protection lightpath-based hitless spectrum defragmentation for distance adaptive elastic optical networks

Chao Wang, Gangxiang Shen, and Limei Peng
Opt. Express 24(5) 4497-4511 (2016)

Holding-Time- and Impairment-Aware Shared Spectrum Allocation in Mixed-Line-Rate Elastic Optical Networks

Jijun Zhao, Bowen Bao, Hui Yang, Eiji Oki, and Bijoy Chand Chatterjee
J. Opt. Commun. Netw. 11(6) 322-332 (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 (12)

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

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

		Non-hitless Defragmentation		Hitless Defragmentation
Approaches		Alignment	Consecutiveness	Hop Retuning	Push–Pull Retuning
Proactive	Rerouting	M. Zang [8]
	Rerouting	M. Zang [9]
	No rerouting		R. Wang [18]	R. Proietti [12]	M. Sekiya [10]
				R. Proietti [12]	Y. Aoki [13]
				M. Zhang [14]	X. Wang [23]
				M. Zhang [14]	R. Wang [15]
		W. Shi [7], Y. Yin [16]
		X. Chen [21], W. Fadini [19]
Reactive	Rerouting	M. Zang [9]		M. Zang [9]
Reactive	No rerouting				R. Wang [15]

$G (V, E)$ :	Directed graph, where $V$ is a set of nodes and $E$ is a set of links.
$P$ :	Set of routes, $p \in P$ .
$w_{p q}$ :	Edge cost on auxiliary graph.
$y_{p q}$ :	Binary variable, 1 if routes $p$ and $q$ share at least a link, and 0 otherwise.
$d_{p q}$ :	Binary variable, 1 if routes $p$ and $q$ are on different sides of the cut, and 0 otherwise.
$x_{i j}^{p}$ :	Binary variable, 1 if route $p$ uses link $(i, j)$ , and 0 otherwise.
$k_{p q}$ :	Binary variable, 1 if routes $p$ and $q$ share a link and are on the same side of the cut, and 0 otherwise.

		Non-hitless Defragmentation		Hitless Defragmentation
Approaches		Alignment	Consecutiveness	Hop Retuning	Push–Pull Retuning
Proactive	Rerouting	M. Zang [8]
	Rerouting	M. Zang [9]
	No rerouting		R. Wang [18]	R. Proietti [12]	M. Sekiya [10]
				R. Proietti [12]	Y. Aoki [13]
				M. Zhang [14]	X. Wang [23]
				M. Zhang [14]	R. Wang [15]
		W. Shi [7], Y. Yin [16]
		X. Chen [21], W. Fadini [19]
Reactive	Rerouting	M. Zang [9]		M. Zang [9]
Reactive	No rerouting				R. Wang [15]

$G (V, E)$ :	Directed graph, where $V$ is a set of nodes and $E$ is a set of links.
$P$ :	Set of routes, $p \in P$ .
$w_{p q}$ :	Edge cost on auxiliary graph.
$y_{p q}$ :	Binary variable, 1 if routes $p$ and $q$ share at least a link, and 0 otherwise.
$d_{p q}$ :	Binary variable, 1 if routes $p$ and $q$ are on different sides of the cut, and 0 otherwise.
$x_{i j}^{p}$ :	Binary variable, 1 if route $p$ uses link $(i, j)$ , and 0 otherwise.
$k_{p q}$ :	Binary variable, 1 if routes $p$ and $q$ share a link and are on the same side of the cut, and 0 otherwise.

Abstract

Cited By

Figures (12)

Tables (3)

Equations (23)

Journal of Optical Communications and Networking