ILP Formulation of Grooming over Wavelength-Routing with Protection
ONDM '01 Proceedings of the IFIP TC6 Fifth Working Conference on Optical Network Design and Modeling: Towards an Optical Internet: New Visions in Optical Network Design and Modelling
A novel generic graph model for traffic grooming in heterogeneous WDM mesh networks
IEEE/ACM Transactions on Networking (TON)
Survivability and Traffic Grooming in WDM Optical Networks
Survivability and Traffic Grooming in WDM Optical Networks
Theoretical Computer Science
Genetic evolutionary algorithm for static traffic grooming to SONET over WDM optical networks
Computer Communications
ONDM'07 Proceedings of the 11th international IFIP TC6 conference on Optical network design and modeling
All-optical wavelength conversion: technologies and applications in DWDM networks
IEEE Communications Magazine
IP over optical networks: architectural aspects
IEEE Communications Magazine
Traffic grooming in WDM networks
IEEE Communications Magazine
IEEE Communications Magazine
Intelligent optical networking for multilayer survivability
IEEE Communications Magazine
Multilayer traffic engineering for GMPLS-enabled networks
IEEE Communications Magazine
Dynamic Traffic Grooming in Optical Networks with Wavelength Conversion
IEEE Journal on Selected Areas in Communications - Part Supplement
IEEE Network: The Magazine of Global Internetworking
IEEE Network: The Magazine of Global Internetworking
Hi-index | 0.00 |
In Multi-Layer networks, where more than one layer is switched, i.e., connections are set up using not only the upper, e.g., IP layer but the underlying wavelength layer as well leads often to suboptimal performance due to long wavelength paths, that do not allow routing the traffic along the shortest path. The role of MLTE (Multi-Layer Traffic Engineering) is to cut (fragment) these long wavelength-paths into parts (fragments) that allow better routing at the upper layer, or to concatenate (defragment) two or more fragments into longer paths when the network load is low and therefore fewer hops are preferred. In this paper we present a new model, the Fragment Graph (FG) and an algorithm for this model that supports Fragmentation and De-Fragmentation of wavelength paths making the network always instantly adapt to changing traffic conditions. We introduce the notion of shadow links to model ''@l-path tailoring''. We implicitly assume that the wavelength paths carry such, e.g., IP traffic that can be interrupted for a few milliseconds and that even allows minor packet reordering. To show the superior performance of our approach in various network and traffic conditions we have carried out an intensive simulation study where we compare blocking ratios and path lengths and we analyze the dynamic behavior and fairness of the proposed and of reference methods.