Routing and wavelength assignment in multifiber WDM networks with non-uniform fiber cost

Nomikos, C; Pagourtzis, A; Potika, K; Zachos, S

dc.contributor.author	Nomikos, C	en
dc.contributor.author	Pagourtzis, A	en
dc.contributor.author	Potika, K	en
dc.contributor.author	Zachos, S	en
dc.date.accessioned	2014-03-01T01:25:06Z
dc.date.available	2014-03-01T01:25:06Z
dc.date.issued	2006	en
dc.identifier.issn	1389-1286	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/17543
dc.subject	Graph theory	en
dc.subject	Multifiber optical networks	en
dc.subject	Wavelength assignment	en
dc.subject.classification	Computer Science, Hardware & Architecture	en
dc.subject.classification	Computer Science, Information Systems	en
dc.subject.classification	Engineering, Electrical & Electronic	en
dc.subject.classification	Telecommunications	en
dc.subject.other	Full-duplex communication	en
dc.subject.other	Multifiber optical networks	en
dc.subject.other	Wavelength assignment	en
dc.subject.other	WDM networks	en
dc.subject.other	Algorithms	en
dc.subject.other	Communication systems	en
dc.subject.other	Fiber optic networks	en
dc.subject.other	Problem solving	en
dc.subject.other	Wavelength division multiplexing	en
dc.subject.other	Computer networks	en
dc.title	Routing and wavelength assignment in multifiber WDM networks with non-uniform fiber cost	en
heal.type	journalArticle	en
heal.identifier.primary	10.1016/j.comnet.2004.11.028	en
heal.identifier.secondary	http://dx.doi.org/10.1016/j.comnet.2004.11.028	en
heal.language	English	en
heal.publicationDate	2006	en
heal.abstract	Motivated by the increasing importance of multifiber WDM networks we study a routing and wavelength assignment problem in such networks. In this problem the number of wavelengths per fiber is given and the goal is to minimize the cost of fiber links that need to be reserved in order to satisfy a set of communication requests; we introduce a generalized setting where network pricing is non-uniform, that is the cost of hiring a fiber may differ from link to link. We consider two variations: undirected, which corresponds to full-duplex communication, and directed, which corresponds to one-way communication. Moreover, for rings we also study the problem in the case of pre-determined routing. We present exact or constant-ratio approximation algorithms for all the above variations in chain, ring and spider networks. (c) 2005 Elsevier B.V. All rights reserved.	en
heal.publisher	ELSEVIER SCIENCE BV	en
heal.journalName	Computer Networks	en
dc.identifier.doi	10.1016/j.comnet.2004.11.028	en
dc.identifier.isi	ISI:000233330200001	en
dc.identifier.volume	50	en
dc.identifier.issue	1	en
dc.identifier.spage	1	en
dc.identifier.epage	14	en