loading...
Wavelength Assignment in WDM Rings with Splitable Lightpaths
Dallas/Richardson, Texas, USA December 07-December 07
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ISPAN.2000.9002882000 International Symposium on Paral ...
 This Article 
 
Buy PURCHASE ARTICLE: $19
PDF
HTML
Buy IEEE Xplore Subscribers
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
ASCII Text
x 
 
Gruia Galinescu, Peng-Jun Wan, "Wavelength Assignment in WDM Rings with Splitable Lightpaths," Parallel Architectures, Algorithms, and Networks, International Symposium on, pp. 216, 2000 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN '00), 2000.
 
 
BibTex
x
 
@article{ 10.1109/ISPAN.2000.900288,
author = {Gruia Galinescu and Peng-Jun Wan},
title = {Wavelength Assignment in WDM Rings with Splitable Lightpaths},
journal ={Parallel Architectures, Algorithms, and Networks, International Symposium on},
volume = {0},
year = {2000},
issn = {1087-4089},
pages = {216},
doi = {http://doi.ieeecomputersociety.org/10.1109/ISPAN.2000.900288},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Parallel Architectures, Algorithms, and Networks, International Symposium on
TI - Wavelength Assignment in WDM Rings with Splitable Lightpaths
SN - 1087-4089
SP
EP
A1 - Gruia Galinescu,
A1 - Peng-Jun Wan,
PY - 2000
KW - Wavelength division multiplexing (WDM)
KW - optical networks
KW - SONET
KW - add-drop multiplexer (ADM)
KW - WADM
KW - grooming
KW - approximation algorithm.
VL - 0
JA - Parallel Architectures, Algorithms, and Networks, International Symposium on
ER -
 

This paper presents a new practical approximation algorithm for wavelength assignment to splitable lightpaths over WDM rings, with the objective of minimizing the number of SONET ADMs. Allowing the splitting of traffic streams can significantly reduce the number of required ADMs.

Moreover, while finding the best assignment is proved to be NP-Hard, the problem seems easier to approximate than the variation when traffic streams cannot be split. In the worst case, the output of the new polynomial-time algorithm is at most 25% more than the optimum solution. This result is significantly better than the best known approximation ratio for non-splitable traffic streams.

Index Terms:
Wavelength division multiplexing (WDM), optical networks, SONET, add-drop multiplexer (ADM), WADM, grooming, approximation algorithm.
Citation:
Gruia Galinescu, Peng-Jun Wan, "Wavelength Assignment in WDM Rings with Splitable Lightpaths," ispan, pp.216, 2000 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN '00), 2000
Usage of this product signifies your acceptance of the Terms of Use.