Distance-adaptive routing and spectrum assignment in rings

3Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

Abstract

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. This work explores the tradeoffs involved in DA-RSA algorithm design, and opens up new research directions that may leverage the vast literature in scheduling theory.

Cite

CITATION STYLE

APA

Talebi, S., Katib, I., & Rouskas, G. N. (2016). Distance-adaptive routing and spectrum assignment in rings. IET Networks, 5(3), 64–70. https://doi.org/10.1049/iet-net.2015.0085

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free