A. Jaekel and Y. Chen (Canada)
Scheduled traffic model, traffic grooming, WDM networks, and RWA
The vast majority of the current work on traffic grooming for WDM mesh networks can be classified into one of two categories i) static grooming, where the demands are allocated for the duration of the network or ii) dynamic grooming, where the start times and durations of demands are generated randomly based on certain traffic distributions. However, in many situations, the individual traffic demands require bandwidth at certain predefined intervals, and resources allocated to non-overlapping demands can be re-used in time. In this paper, we propose a new traffic grooming technique that exploits knowledge of the connection holding times of traffic demands to lead to more efficient resource allocation. Although individual demands may be short lived, it is desirable to have a logical topology that is relatively stable and not subject to frequent changes. Therefore, our objective is to design a stable logical topology that can accommodate a collection of low-speed traffic demands with specified setup and teardown times. We present an integer linear program (ILP) formulation that addresses the complete traffic grooming problem including topology design, RWA and routing of traffic demands over the selected topology. Experimental results demonstrate that our approach is feasible for practical networks and outperforms connection holding time unaware techniques.
Important Links:
Go Back
