z-logo
open-access-imgOpen Access
Dynamic adaptive spectrum allocation in flexible grid optical network with multi‐path routing
Author(s) -
Ujjwal Ujjwal,
Mahala Neha,
Thangaraj Jaisingh
Publication year - 2020
Publication title -
iet communications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.355
H-Index - 62
eISSN - 1751-8636
pISSN - 1751-8628
DOI - 10.1049/cmu2.12046
Subject(s) - adaptive routing , computer science , frequency allocation , grid , path (computing) , routing (electronic design automation) , distributed computing , computer network , static routing , routing protocol , mathematics , geometry
Fragmentation is one of the major issues in elastic optical network (EON) due to its dynamic characteristics which may possibly degrade the spectrum efficiency. Several techniques have been presented in the literature to get the optimal solution of this problem while multi‐path provisioning comes out to be very compelling among them. In multi‐path provisioning enable networks, multi‐path routing and spectrum assignment (MPRSA) creates further complications due to the hardware availability and more spectrum consumption. This paper presents a novel technique termed as adaptive service provisioning (ASP) to come up with a solution of the MPRSA problem and it minimizes the spectrum fragments in the network by precisely managing the scattered spectrum slots. This technique performs the adaptive traffic demand splitting on disjoint paths in case it is unable to be served by k‐shortest routing paths based on the parameters such as hardware support, capacity available and demand. An integer linear programming (ILP) model as well as a heuristic algorithm for solving MPRSA problem in large optical networks where ILP is not compliant is developed. Numerical simulations are performed to investigate the performance of the algorithm in terms of blocking probability and spectrum utilization.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here