Routing and Wavelength Assignment in Optical
            <scp>WDM</scp>
            Networks

Rouskas, George N.

doi:10.1002/0471219282.eot205

Cited by 35 publications

(27 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Several variants of the RSA problem have been studied in the literature that take into account various design aspects including the reach versus modulation level (spectral efficiency) tradeoff [15], traffic grooming [16], and restoration [17]. These problem variants are NP-hard, as RSA is a generalization of the well-known routing and wavelength assignment (RWA) problem [18]. Therefore, while most studies provide integer linear program (ILP) formulations for the RSA variant they address, they propose heuristic algorithms for solving medium to large problem instances.…”

Section: Introductionmentioning

confidence: 99%

Spectrum Assignment in Mesh Elastic Optical Networks

Fayez

Katib

Rouskas

et al. 2015

2015 24th International Conference on Computer Communication and Networks (ICCCN)

Self Cite

View full text Add to dashboard Cite

Abstract-Spectrum assignment has emerged as the key design and control problem in elastic optical networks. We have shown that spectrum assignment in networks of general topology is a special case of scheduling multiprocessor tasks on dedicated processors. Based on this insight, we develop and evaluate efficient and effective algorithms for mesh and chain networks that build upon list scheduling concepts.

show abstract

Section: Introductionmentioning

confidence: 99%

Spectrum Assignment in Mesh Elastic Optical Networks

Fayez

Katib

Rouskas

et al. 2015

2015 24th International Conference on Computer Communication and Networks (ICCCN)

Self Cite

View full text Add to dashboard Cite

show abstract

“…Note also that the wavelength assignment (WA) problem [11] is a special case of the SA problem in which all demands are of size t sd = 1. Consequently, these two lemmas also establish that the WA problem is solvable in polynomial time in threeand four-node rings with shortest path routing.…”

Section: A Rings With N = 3 4 Nodesmentioning

confidence: 99%

Spectrum assignment in rings with shortest-path routing: Complexity and approximation algorithms

Talebi

Alam

Katib

et al. 2015

2015 International Conference on Computing, Networking and Communications (ICNC)

Self Cite

View full text Add to dashboard Cite

Abstract-We study the spectrum assignment (SA) problem in ring networks with shortest path (or, more generally, fixed) routing. With fixed routing, each traffic demand follows a predetermined path to its destination. In earlier work, we have shown that the SA problem can be viewed as a multiprocessor problem. Based on this insight, we prove that, under the shortest path assumption, the SA problem can be solved in polynomial time in small rings, and we develop constant-ratio approximation algorithms for large rings. For rings of size up to 16 nodes (the maximum size of a SONET/SDH ring), the approximation ratios of our algorithms are strictly smaller than the best known ratio to date.

show abstract

“…These problem variants are NP-hard, as RSA is a generalization of the well-known routing and wavelength assignment (RWA) problem [12]. Therefore, while most studies provide integer linear program (ILP) formulations for the RSA variant they address, they propose heuristic algorithms for solving medium to large problem instances.…”

Section: Introductionmentioning

confidence: 99%

Spectrum Assignment in Optical Networks: A Multiprocessor Scheduling Perspective

Talebi¹,

Bampis

Lucarelli

et al. 2014

J. Opt. Commun. Netw.

Self Cite

View full text Add to dashboard Cite

Abstract-The routing and spectrum assignment problem has emerged as the key design and control problem in elastic optical networks. In this work, we show that the spectrum assignment (SA) problem in mesh networks transforms to the problem of scheduling multiprocessor tasks on dedicated processors. Based on this new perspective, we show that the SA problem in chain (linear) networks is NP-hard for four or more links, but is solvable in polynomial time for three links. We also develop new constant-ratio approximation algorithms for the SA problem in chains when the number of links is fixed. Finally, we present several list scheduling algorithms that are computationally efficient and simple to implement, yet produce solutions that, on average, are within 1%-5% of the lower bound.

show abstract

Routing and Wavelength Assignment in Optical WDM Networks

Cited by 35 publications

References 23 publications

Spectrum Assignment in Mesh Elastic Optical Networks

Spectrum Assignment in Mesh Elastic Optical Networks

Spectrum assignment in rings with shortest-path routing: Complexity and approximation algorithms

Spectrum Assignment in Optical Networks: A Multiprocessor Scheduling Perspective

Contact Info

Product

Resources

About