Distance‐adaptive routing and spectrum assignment in rings. Issue 3 (1st May 2016)

• Record Type: Journal Article
• Authors: Talebi, Sahar; Katib, Iyad; Rouskas, George N.
• Is Part Of: IET networks. Volume 5:Issue 3(2016)
• Page Start: 64
• Page End: 70
• Publication Date: 2016-05-01
• Subjects: optical fibre networks -- channel allocation -- telecommunication network routing -- telecommunication scheduling -- telecommunication network topology -- processor scheduling; distance adaptive routing -- ring topology -- distance‐adaptive spectrum allocation -- spectrum width -- distance‐adaptive routing and spectrum assignment -- multiprocessor scheduling problem; Computer network architectures -- Periodicals; Computer network protocols -- Periodicals; Information networks -- Periodicals; Telecommunication systems -- Periodicals; 004.605
• DOI: 10.1049/iet-net.2015.0085
• Languages: English
• ISSNs: 2047-4954

Abstract

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.