An Experimental Study of Maximum Profit Wavelength Assignment in WDM Rings

Publication Date

December 2010

Document Type

Article

Publication Title

Networks

Volume

57

Issue

3

DOI

10.1002/net.20425

First Page

285

Last Page

293

Abstract

We are interested in the problem of satisfying a maximum‐profit subset of undirected communication requests in an optical ring that uses the Wavelength Division Multiplexing technology. We present four deterministic and purely combinatorial algorithms for this problem, and give theoretical guarantees for their worst‐case approximation ratios. Two of these algorithms are novel, whereas the rest are adaptation of earlier approaches. An experimental evaluation of the algorithms in terms of attained profit and execution time reveals that the theoretically best algorithm performs only marginally better than one of the new algorithms, while at the same time being several orders of magnitude slower. Furthermore, an extremely fast greedy heuristic with nonconstant approximation ratio performs reasonably well and may be favored over the other algorithms whenever it is crucial to minimize execution time. © 2011 Wiley Periodicals, Inc. NETWORKS, 2011

Keywords

ring networks, optical networks, WDM, wavelength assignment, maximum profit, approximation algorithms, experimental evaluation

Comments

SJSU users: Use the following link to login and access this article via SJSU databases.

Link to Full Text

Share

COinS