Title :
A Lagrangian-based heuristic for traffic grooming in WDM optical networks
Author :
Patrocínio, Zenilton K G, Jr. ; Mateus, Geraldo Robson
Author_Institution :
Depart. de Ciencia da Computacao, Univ. Fed. de Minas Gerais, Brazil
Abstract :
Traffic grooming problem (TGP) deals with efficiently combining low-speed traffic streams into high-capacity wavelength channels in order to improve bandwidth utilization and minimize network cost. In this paper, we investigate TGP in WDM optical networks regardless of underlying physical topology. The problem is formulated as an integer linear program (ILP) and a Lagrangian-based heuristic is proposed. Numerical results for ring and mesh networks are presented and analyzed.
Keywords :
bandwidth allocation; channel capacity; integer programming; linear programming; optical fibre networks; telecommunication network topology; telecommunication traffic; wavelength division multiplexing; Lagrangian-based heuristic; WDM optical network; bandwidth utilization; integer linear programming; mesh network; ring network; traffic grooming problem; wavelength-division multiplexing; All-optical networks; Intelligent networks; Lagrangian functions; Mesh networks; Network topology; Optical fiber networks; SONET; Telecommunication traffic; WDM networks; Wavelength division multiplexing;
Conference_Titel :
Global Telecommunications Conference, 2003. GLOBECOM '03. IEEE
Print_ISBN :
0-7803-7974-8
DOI :
10.1109/GLOCOM.2003.1258739
