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

Saved in:
Bibliographic Details
Title: Routing and wavelength assignment in multifiber WDM networks with non-uniform fiber cost
Authors: Nomikos, Christos1 cnomikos@cs.uoi.gr, Pagourtzis, Aris2 pagour@cs.ece.ntua.gr, Potika, Katerina2 epotik@cs.ece.ntua.gr, Zachos, Stathis2,3 zachos@cs.ece.ntua.gr
Source: Computer Networks. Jan2006, Vol. 50 Issue 1, p1-14. 14p.
Abstract: 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. [Copyright &y& Elsevier]
Copyright of Computer Networks is the property of Elsevier B.V. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
Description
Abstract: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. [Copyright &y& Elsevier]
ISSN:13891286
DOI:10.1016/j.comnet.2004.11.028