A global approach for designing reliable WDM networks and grooming the traffic

Authors:
Abderraouf Bahri;Steven Chamberland
Affiliations:
Department of Computer Engineering, ícole Polytechnique de Montréal, C.P. 6079, Succ. Centre-ville, Montréal, Qué., Canada H3C 3A7;Department of Computer Engineering, ícole Polytechnique de Montréal, C.P. 6079, Succ. Centre-ville, Montréal, Qué., Canada H3C 3A7
Venue:
Computers and Operations Research
Year:
2008

Citing 10
Cited 2

Optical networks: a practical perspective

Optical networks: a practical perspective
Optical Networking & WDM

Optical Networking & WDM
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
A 5/4-approximation algorithm for minimum 2-edge-connectivity

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
A novel generic graph model for traffic grooming in heterogeneous WDM mesh networks

IEEE/ACM Transactions on Networking (TON)
Approximating minimum-size k-connected spanning subgraphs via matching

FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Joint routing and wavelength assignment in wavelength division multiplexing networks for permanent and reliable paths

Computers and Operations Research
Traffic grooming in WDM networks

IEEE Communications Magazine
SONET: now it's the standard optical network

IEEE Communications Magazine
Traffic grooming in an optical WDM mesh network

IEEE Journal on Selected Areas in Communications

Using a OMNET++ network based simulator as test-bed for network design algorithms

SMO'08 Proceedings of the 8th conference on Simulation, modelling and optimization
An algorithm for traffic grooming in WDM mesh networks using dynamic path selection strategy

ICDCN'11 Proceedings of the 12th international conference on Distributed computing and networking

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this paper, we address the global problem of designing reliable wavelength division multiplexing (WDM) networks including the traffic grooming. This global problem consists in finding the number of optical fibers between each pair of optical nodes, finding the configuration of each node with respect to transponders, finding the virtual topology (i.e., the set of lightpaths), routing the lightpaths, grooming the traffic (i.e, grouping the connections and routing them over the lightpaths) and, finally, assigning wavelengths to the lightpaths. Instead of partitioning the problem into subproblems and solving them successively, we propose a mathematical programming model that addresses it as a whole. Numerical results are presented and analyzed.