Fiber cost reduction and wavelength minimization in multifiber WDM networks

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:20:31Z
dc.date.available	2014-03-01T01:20:31Z
dc.date.issued	2004	en
dc.identifier.issn	0302-9743	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/15941
dc.subject	Approximate Algorithm	en
dc.subject	Cost Minimization	en
dc.subject	Cost Reduction	en
dc.subject	Network Pricing	en
dc.subject	Parallel Fiber	en
dc.subject	Routing and Wavelength Assignment	en
dc.subject	Satisfiability	en
dc.subject	Wdm Network	en
dc.subject.classification	Computer Science, Theory & Methods	en
dc.subject.other	RING NETWORKS	en
dc.title	Fiber cost reduction and wavelength minimization in multifiber WDM networks	en
heal.type	journalArticle	en
heal.identifier.primary	10.1007/978-3-540-24693-0_13	en
heal.identifier.secondary	http://dx.doi.org/10.1007/978-3-540-24693-0_13	en
heal.language	English	en
heal.publicationDate	2004	en
heal.abstract	Motivated by the increasing importance of multifiber WDM networks we study two routing and wavelength assignment problems in such networks: - Fiber Cost Minimization: the number of wavelengths per fiber is given and we want 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. - Wavelength Minimization: the number of available parallel fibers on each link is given and we want to minimize the wavelengths per fiber that are needed in order to satisfy a set of communication requests. For each problem 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, star and spider networks. © IFIP International Federation for Information Processing 2004.	en
heal.publisher	SPRINGER-VERLAG BERLIN	en
heal.journalName	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)	en
heal.bookName	LECTURE NOTES IN COMPUTER SCIENCE	en
dc.identifier.doi	10.1007/978-3-540-24693-0_13	en
dc.identifier.isi	ISI:000221521000013	en
dc.identifier.volume	3042	en
dc.identifier.spage	150	en
dc.identifier.epage	161	en