Route partitioning scheme for elastic optical networks with hitless defragmentation

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

Research output: Contribution to journalArticle

32 Citations (Scopus)

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.

Original languageEnglish
Article number7494881
Pages (from-to)356-370
Number of pages15
JournalJournal of Optical Communications and Networking
Volume8
Issue number6
DOIs
Publication statusPublished - 2016 Jun 1

Fingerprint

Fiber optic networks
Linear programming
Heuristic algorithms
Polynomials

Keywords

  • Elastic optical networks
  • First-last fit
  • Hitless defragmentation
  • Route partitioning

ASJC Scopus subject areas

  • Computer Networks and Communications

Cite this

Route partitioning scheme for elastic optical networks with hitless defragmentation. / Ba, Seydou; Chatterjee, Bijoy Chand; Okamoto, Satoru; Yamanaka, Naoaki; Fumagalli, Andrea; Oki, Eiji.

In: Journal of Optical Communications and Networking, Vol. 8, No. 6, 7494881, 01.06.2016, p. 356-370.

Research output: Contribution to journalArticle

Ba, Seydou ; Chatterjee, Bijoy Chand ; Okamoto, Satoru ; Yamanaka, Naoaki ; Fumagalli, Andrea ; Oki, Eiji. / Route partitioning scheme for elastic optical networks with hitless defragmentation. In: Journal of Optical Communications and Networking. 2016 ; Vol. 8, No. 6. pp. 356-370.
@article{8eaa5d154ea24136a660872bbac8fe34,
title = "Route partitioning scheme for elastic optical networks with hitless defragmentation",
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.",
keywords = "Elastic optical networks, First-last fit, Hitless defragmentation, Route partitioning",
author = "Seydou Ba and Chatterjee, {Bijoy Chand} and Satoru Okamoto and Naoaki Yamanaka and Andrea Fumagalli and Eiji Oki",
year = "2016",
month = "6",
day = "1",
doi = "10.1364/JOCN.8.000356",
language = "English",
volume = "8",
pages = "356--370",
journal = "Journal of Optical Communications and Networking",
issn = "1943-0620",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "6",

}

TY - JOUR

T1 - Route partitioning scheme for elastic optical networks with hitless defragmentation

AU - Ba, Seydou

AU - Chatterjee, Bijoy Chand

AU - Okamoto, Satoru

AU - Yamanaka, Naoaki

AU - Fumagalli, Andrea

AU - Oki, Eiji

PY - 2016/6/1

Y1 - 2016/6/1

N2 - 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.

AB - 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.

KW - Elastic optical networks

KW - First-last fit

KW - Hitless defragmentation

KW - Route partitioning

UR - http://www.scopus.com/inward/record.url?scp=84976449018&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84976449018&partnerID=8YFLogxK

U2 - 10.1364/JOCN.8.000356

DO - 10.1364/JOCN.8.000356

M3 - Article

AN - SCOPUS:84976449018

VL - 8

SP - 356

EP - 370

JO - Journal of Optical Communications and Networking

JF - Journal of Optical Communications and Networking

SN - 1943-0620

IS - 6

M1 - 7494881

ER -