An experimental study of maximum profit wavelength assignment in WDM rings

Bampas, E; Pagourtzis, A; Potika, K

dc.contributor.author	Bampas, E	en
dc.contributor.author	Pagourtzis, A	en
dc.contributor.author	Potika, K	en
dc.date.accessioned	2014-03-01T02:47:16Z
dc.date.available	2014-03-01T02:47:16Z
dc.date.issued	2011	en
dc.identifier.issn	0028-3045	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/33051
dc.subject	approximation algorithms	en
dc.subject	experimental evaluation	en
dc.subject	maximum profit	en
dc.subject	optical networks	en
dc.subject	ring networks	en
dc.subject	wavelength assignment	en
dc.subject	WDM	en
dc.subject.classification	Computer Science, Hardware & Architecture	en
dc.subject.classification	Operations Research & Management Science	en
dc.subject.other	experimental evaluation	en
dc.subject.other	maximum profit	en
dc.subject.other	Optical networks	en
dc.subject.other	ring networks	en
dc.subject.other	wavelength assignment	en
dc.subject.other	WDM	en
dc.subject.other	Fiber optic networks	en
dc.subject.other	Heuristic algorithms	en
dc.subject.other	Multiplexing equipment	en
dc.subject.other	Optical communication	en
dc.subject.other	Profitability	en
dc.subject.other	Wavelength division multiplexing	en
dc.subject.other	Approximation algorithms	en
dc.title	An experimental study of maximum profit wavelength assignment in WDM rings	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1002/net.20425	en
heal.identifier.secondary	http://dx.doi.org/10.1002/net.20425	en
heal.language	English	en
heal.publicationDate	2011	en
heal.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. (C) 2010 Wiley Periodicals, Inc. NETWORKS, Vol. 57(3), 285-293 2011	en
heal.publisher	WILEY-BLACKWELL	en
heal.journalName	Networks	en
dc.identifier.doi	10.1002/net.20425	en
dc.identifier.isi	ISI:000290359800010	en
dc.identifier.volume	57	en
dc.identifier.issue	3	en
dc.identifier.spage	285	en
dc.identifier.epage	293	en