A Near-Optimal Solution Approach for the Multi-hop Traffic Grooming Problem

In this paper we consider a capacity sizing and routing problem in synchronous digital hierarchy/wavelength division multiplexing networks with nodes having switching capabilities. This problem is well known in the literature as the multi-hop traffic grooming problem and is generally formulated as a...

Full description

Saved in:
Bibliographic Details
Published in:Journal of optical communications and networking 2011-11, Vol.3 (11), p.891-901
Main Authors: Balma, A., Hadj-Alouane, N. B., Hadj-Alouane, A. B.
Format: Article
Language:English
Subjects:
Branch-and-bound
Channels
Demand
Mathematical models
Multi-hop traffic grooming
Network design
Networks
Nonuniform
Optical switches
Optimization
Routing
SDH/WDM
SONET
Switching theory
Synchronous digital hierarchy
Traffic engineering
Traffic flow
WDM networks
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper we consider a capacity sizing and routing problem in synchronous digital hierarchy/wavelength division multiplexing networks with nodes having switching capabilities. This problem is well known in the literature as the multi-hop traffic grooming problem and is generally formulated as an integer linear program, which is especially hard to solve when the demand channels are unsplittable and nonuniform. To overcome this difficulty we develop a branching strategy, using a lower bound that is close to the optimal solution. We also devise a reformulation which accelerates branch-and-bound-based solvers. The computational results clearly show that our method is effective in reducing execution time as well as memory consumption, in comparison to traditional methods based on branch-and-bound.
ISSN:1943-0620
1943-0639
DOI:10.1364/JOCN.3.000891