Modified Dual-Path Allocation Algorithm in Elastic Optical Networks

Ireneusz Olszewski

doi:10.1007/s10922-020-09513-4

Abstract

Dual-path allocation problem is considered to be a case of multipath routing in Elastic Optical Networks. In this article, the optimization problem is formulated and a dual-path allocation algorithm that solves this problem proposed. In the considered problem all traffic for each request is broken into two equal parts, which are directed along two link-disjoint paths. After any link failure, half of the traffic for each affected request is realized. The proposed algorithm is based on the two weight matrices: the elements of the first one depend on the actual length of the links and their utilization, while the elements of the second one assume unit values if the links exist in the network. The proposed algorithm rejects smaller requests and provides a much lower bandwidth blocking probability than other analyzed algorithms.

Highlights

The proliferation of services requiring large bandwidth such as High Definition Television (HDTV), Video on Demand (VoD) or cloud computing services have resulted in a dynamic increase of IP traffic in the networks
In [4], an online problem of Shared Backup Path Protection (SBPP) was used to increase the usage of spectrum compared to Dedicated Path Protection (DPP)
This chapter contains a comparison of the Modified DPA algorithm with P-DPP, DPA and Primary F–F Modified Backup L–F algorithms

Summary

Introduction

The proliferation of services requiring large bandwidth such as High Definition Television (HDTV), Video on Demand (VoD) or cloud computing services have resulted in a dynamic increase of IP traffic in the networks. In [1], an offline Routing and Spectrum Allocation (RSA) problem with Dedicated Path Protection (DPP) in EON is proposed. In [4], an online problem of Shared Backup Path Protection (SBPP) was used to increase the usage of spectrum compared to DPP. In [8] an online RSA problem with an SBPP in EON was considered The algorithm solving this problem is based on Spectrum Window Planes (SWPs), where the weight of each SWP edge is equal to the required number of slots for the request. In [9] an online RSA problem with a shared backup path protection is solved based on the Primary First-Fit Modified Backup Last-Fit algorithm. Algorithms with a dedicated or shared path protection provide traffic protection between each pair of nodes in case of a single-link failure in the network.

Dual Path Allocation and Multipath Routing Problems

Optimization Problem for Dual‐Path Allocation

Optimization Problem Solution

Obtained Results and Discussion

Summary and Conclusions