Please use this identifier to cite or link to this item: https://hdl.handle.net/20.500.14365/3556
Title: Survivable impairment-aware traffic grooming and regenerator placement with shared connection-level protection
Authors: Gao C.
Cankaya H.C.
Patel A.N.
Jue J.P.
Wang X.
Zhang Q.
Palacharla P.
Keywords: Impairment
Regenerator Placement
Survivability
Traffic Grooming
WDM Network
Impairment
Regenerator Placement
Survivability
Traffic Grooming
WDM Network
Algorithms
Auxiliary equipment
Regenerators
Transparent optical networks
Wavelength division multiplexing
Fiber optic networks
Abstract: In this paper, we address the problem of survivable traffic grooming and regenerator placement in optical WDM networks with impairment constraints. The working connections are protected end to end by provisioning bandwidth along a sequence of lightpaths by using a shared connection-level protection scheme. An auxiliary-graph-based approach is proposed to address the placement of regenerators and grooming equipment for both working and shared backup connections in the network with the goal of minimizing the total equipment cost. Simulation results show that the proposed algorithm outperforms the dedicated connection-level protection algorithm as the load increases. © 2011 IEEE.
Description: Vetenskap och Konst (KTH);acreo;Instytut Lacznosci - Panstwowy Instytut Badawczy;Vetenskapsradet;STAD-Stockholm
2011 13th International Conference on Transparent Optical Networks, ICTON 2011 -- 26 June 2011 through 30 June 2011 -- Stockholm -- 87103
URI: https://doi.org/10.1109/ICTON.2011.5970959
https://hdl.handle.net/20.500.14365/3556
ISBN: 9.78146E+12
ISSN: 2162-7339
Appears in Collections:Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection

Files in This Item:
File SizeFormat 
2646.pdf
  Restricted Access
307.68 kBAdobe PDFView/Open    Request a copy
Show full item record



CORE Recommender

Page view(s)

46
checked on Nov 25, 2024

Google ScholarTM

Check




Altmetric


Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.