Distance-adaptive routing and spectrum assignment in rings

  title={Distance-adaptive routing and spectrum assignment in rings},
  author={Sahar Talebi and Iyad A. Katib and George N. Rouskas},
  journal={IET Networks},
Distance adaptive spectrum allocation exploits the tradeoff between spectrum width and reach to improve resource utilisation by tailoring the modulation format to the level of impairments along the path. The authors first show that the distance-adaptive routing and spectrum assignment (DA-RSA) problem is a special case of a multiprocessor scheduling problem. The authors then develop a suite of efficient and effective DA-RSA algorithms for ring networks, that build upon list scheduling concepts… 

Figures from this paper

SDN enabled restoration with triggered precomputation in elastic optical inter-datacenter networks

This paper extends the controller functionality and OpenFlow protocol for software-defined elastic optical inter-datacenter network architectures and develops a fast restoration strategy with triggered precomputation (FR-TP) that achieves fast failure recovery with minimal resource overhead.



On Routing and Spectrum Assignment in Rings

The complexity of the routing and spectrum assignment problem in ring networks is derived and new constant-ratio approximation algorithms with a ratio that is strictly smaller than the best known ratio to date are developed.

On routing and spectrum allocation in spectrum-sliced optical networks

It is proved that RSA is NP-complete even when the optical network topology is as simple as a chain or a ring, and approximation algorithms for RSA are provided to provide a heuristic for the network with arbitrary topology and measure the effectiveness of the heuristic with extensive simulation.

A study of the routing and spectrum allocation in spectrum-sliced Elastic Optical Path networks

This work comprehensively study the routing and spectrum allocation (RSA) problem in the SLICE network, and formulate the RSA problem using the Integer Linear Programming (ILP) formulations to optimally minimize the maximum number of sub-carriers required on any fiber of a SLice network.

Spectrum assignment in optical networks: A multiprocessor scheduling perspective

This work shows that the spectrum assignment (SA) problem in mesh networks transforms to the problem of scheduling multiprocessor tasks on dedicated processors, and develops new constant-ratio approximation algorithms for the SA problem in chains when the number of links is fixed.

Routing, modulation level, and spectrum assignment in optical metro ring networks using elastic transceivers

This paper proposes methods based on integer linear programs and heuristic approaches to solve the routing, modulation level, and spectrum assignment problem in optical rings with elastic transceivers and rate-adaptive modulation formats and shows a significant reduction in terms of transceiver utilization and spectrum occupation.

Dynamic routing and spectrum assignment in flexible optical path networks

The novel algorithms enable dynamic spectrum assignment with more efficient resource utilization and less traffic blockings in OFDM-based optical networks.

Distance-adaptive spectrum resource allocation in spectrum-sliced elastic optical path network [Topics in Optical Communications]

A concept of a novel adaptation scheme in SLICE called distance-adaptive spectrum resource allocation, which can save more than 45 percent of required spectrum resources for a 12-node ring network, is presented.

Distance-adaptive spectrum allocation in elastic optical path network (SLICE) with bit per symbol adjustment

We present a concept of spectrally-efficient optical networking with distance-adaptive spectral allocation by adjusting the number of modulation levels. We demonstrate it by routing 40 Gb/s optical

Spectrum management techniques for elastic optical networks: A survey