Implementation of Resource Allocation Algorithms for C+L Dynamic Optical Networks Source Codes and Datasets

This repository contains the source code and dataset accompanying the paper: “Evaluating QoT-Aware Hybrid Grooming Schemes in Dynamic C+L-Band Optical Networks” The work investigates three resource allocation strategies in dynamic optical networks: Min-Max Channel Algorithm: Minimizes the maximum channel index to balance spectrum utilization. Max Grooming Capacity Algorithm: Minimizes the activation of new lightpath channel instances (LCIs) by leveraging available spare capacity. Time-Aware Algorithm: Minimizes the number of reconfigurations by explicitly considering request departure times. The implementation enables reproducibility of the results presented in the paper and provides a framework for evaluating trade-offs between spectrum utilization, LCI deployment cost, and reconfiguration overhead. Contents: Python/Matlab source code of the algorithms (with documentation). Simulation scripts used for experiments. Example input and output datasets. The pre-print version of the manuscript.