Print Email Facebook Twitter Survivable Impairment-aware Traffic Grooming in WDM Rings Title Survivable Impairment-aware Traffic Grooming in WDM Rings Author Beshir, A. Fernando Kuipers, F. Orda, A. Van Mieghem, P. Faculty Electrical Engineering, Mathematics and Computer Science Department Network Architectures and Services (NAS) Group Abstract Wavelength Division Multiplexing (WDM) optical networks offer a large amount of bandwidth using multiple, but independent wavelength channels (or lightpaths), each operating at several Gb/s. Since the traffic between users is usually only a fraction of the capacity offered by a wavelength, several independent traffic streams can be groomed together. In addition, in order to reverse the effect of noise and signal degradations (physical impairments), optical signals need to be regenerated after a certain impairment threshold is reached. We consider survivable impairment-aware traffic grooming in WDM rings, which are among the most widely deployed optical network topologies. We first show that the survivable impairment-aware traffic grooming problem, where the objective is to minimize the total cost of grooming and regeneration, is NP-hard. We then provide approximation algorithms (for uniform traffic), and efficient heuristic algorithms whose performance is shown to be close to the lower-bounds (for non-uniform traffic) both when (1) the impairment threshold can be ignored, and (2) the impairment threshold should be considered. To reference this document use: http://resolver.tudelft.nl/uuid:b8a50475-f89b-4fb2-9650-a4efe1a57e83 Publisher ITCP ISBN 9780983628309 Source 23nd International Teletraffic Congress (ITC 23), September 6-8, San Francisco, USA. Part of collection Institutional Repository Document type conference paper Rights (c) 2011 Beshir, A.Fernando Kuipers, F.Orda, A.Van Mieghem, P. Files PDF ITC_2011_TrafficGrooming.pdf 322.18 KB Close viewer /islandora/object/uuid:b8a50475-f89b-4fb2-9650-a4efe1a57e83/datastream/OBJ/view