Itinerant routing in elastic optical networks

TL;DR

This paper introduces the concept of itinerant routing in elastic optical networks, addressing the need for dynamic connection reconfiguration as end nodes change, and proposes an efficient reconfiguration algorithm validated through extensive simulations.

Contribution

It defines the new problem of itinerant routing, presents two use cases, and proposes a novel reconfiguration algorithm that improves efficiency without degrading network performance.

Findings

The proposed algorithm requires half as many new links as shortest-path reconfiguration.

Extensive simulations demonstrate the algorithm's effectiveness and efficiency.

It supports dynamic end-node changes in elastic optical networks.

Abstract

We state a new problem of \emph{itinerant routing} in elastic optical networks, which we define as the establishment and reconfiguration of an \emph{itinerant connection}. In an itinerant connection, one of the connection end nodes is allowed to change. Itinerant routing could also be considered a form of connection restoration, where a connection has to be restored to a different end node. With the introduction of new mobile-network architectures, the progressing integration of wireless and optical networks, the continuing growth of wireless high-bitrate services, and the eventual deployment of elastic optical networks, there is a need to support this itinerant routing in the elastic optical networks. We present and discuss two major use cases of the itinerant routing, and propose a \emph{novel reconfiguration algorithm}. Our algorithm does not deteriorate the network performance, and requires half as many new links to configure as the shortest-path reconfiguration algorithm. The performance evaluation was carried out with 46800 simulation runs using randomly-generated realistic transport networks.