Paper Info
Title
Offline Distance-Adaptive Routing and Spectrum Assignment in Mesh Elastic Optical Networks.
Abstract
The routing and spectrum assignment (RSA) problem has emerged as the key design and control problem in elastic optical networks. Distance-adaptive spectrum allocation exploits the tradeoff between spectrum width and reach to improve resource utilization by tailoring the modulation format to the level of impairments along the path. In this paper, we consider the distance-adaptive RSA (DA-RSA) problem with fixed alternate routing. We first show that the DA-RSA problem in networks of general topology is a special case of a well-studied multiprocessor scheduling problem. We then leverage insights from the scheduling theory to 1) present new results regarding the complexity of the DA-RSA problem and 2) build upon the list of scheduling concepts to develop a computationally efficient solution approach that is effective in utilizing the available spectrum resources.
Year
DOI
Venue
2016
10.1364/JOCN.9.000456
IEEE/OSA Journal of Optical Communications and Networking
Keywords
Field
DocType
Program processors,Processor scheduling,Routing,Optical fiber networks,Modulation,Topology,Network topology
Resource management,Multiprocessor scheduling,Dynamic Source Routing,General topology,Computer science,Static routing,Destination-Sequenced Distance Vector routing,Computer network,Network topology,Real-time computing,Frequency allocation,Distributed computing
Conference
Volume
Issue
ISSN
9
5
1943-0620
Citations 
PageRank 
References 
2
0.41
0
Authors
3
Name
Order
Citations
PageRank
Sahar Talebi121.09
George N. Rouskas299088.88
Iyad Katib38413.00