Static resource allocation of advanced reservation requests in elastic optical networks

Area of Science:

• Telecommunications Engineering
• Computer Networking
• Optical Network Optimization

Background:

• Elastic optical networks (EONs) face challenges in efficiently allocating resources for advanced reservation (AR) requests.
• Static routing, modulation, spectrum, and time assignment (RMSTA) is crucial for economic spectrum deployment and maximizing served requests.

Purpose of the Study:

• To address the static RMSTA problem for AR requests in EONs.
• To develop a method for economical spectrum resource deployment and increased request serving capacity.
• To find a trade-off between minimizing maximum utilized frequency and time slot indices.

Main Methods:

• Formulation of the RMSTA problem using a multi-objective integer linear program (ILP) model.
• Proposal of the proportion optimal RMSTA (PO-RMSTA) heuristic algorithm.
• Evaluation of three sorting strategies: ascending order of elastic time (AET), descending order of data volume (DDV), and ascending order of alternative schemes (AAS).

Main Results:

• The PO-RMSTA algorithm with the proposed sorting strategies yields near-optimal solutions.
• The AET sorting policy excels at minimizing the maximum utilized frequency slot index.
• The DDV sorting policy is most effective for minimizing the maximum utilized time slot index.
• Both AET and AAS sorting policies offer satisfactory compromises between the two optimization objectives.

Conclusions:

• The proposed PO-RMSTA heuristic algorithm effectively solves the static RMSTA problem in EONs.
• Different sorting strategies within the PO-RMSTA algorithm provide distinct advantages for specific optimization goals.
• The study demonstrates a practical approach to enhance resource utilization and service capacity in elastic optical networks.