Wavelength Assignment in WDM Rings with Splitable Lightpaths

Thispaper presents a newpractical approximationalgorithmfor wavelengthassignmentto splitablelightpathsover WDM rings, with the objective ofminimizing the number of SONET ADMs. Allowing the splitting of traffic streams can significantlyreduce the number of requiredADMs. Moreover, whilefinding the best assignment isproved to be NP-Hard, the problem seems easier toapproximate than the variation when traffic streams cannot be split. In the worst case,the outputofthe newpolynomial-timealgorithm is at most 25% more than the optimumsolution. Thisresult is significantlybetter thanthe best known approximationratiofor non-splitable traffic streams.

• Type: Conference
• Year: 2000
• Where: ISPAN
• Authors: Gruia Calinescu, Peng-Jun Wan
• Keywords: Distributed And Parallel Computing, ISPAN 2000, Non-splitable Traffic Streams, Splitablelightpathsover Wdm Rings, Traffic Streams