Efficient Solution of the Traffic Grooming Problem in Light-Trail Optical Networks

The concept of light-trails has been introduced in [1] as an efficient and feasible technology for IP transport over all-optical networks. Light-trails have been shown to offer a number of advantages over other technologies such as Optical Burst Switching (OBS) or Optical Packet Switching (OPS). This paper discusses the routing problem of light-trails. We present an enhancement for reducing the size of the routing problem before optimally solving it using Integer Linear Programming (ILP). We also propose an efficient heuristic for solving the static routing problem. The results show the efficiency of the proposed heuristic scheme.