Traffic grooming for survivable WDM mesh networks

Abstract

This paper addresses the problem of dynamically establishing dependable low-rate traffic stream connections in WDM mesh networks with traffic grooming capabilities. To establish a dependable connection, we set up link-disjoint primary and backup traffic stream paths between the source and destination and use backup multiplexing to reduce the overhead of backup traffic streams. We present a dynamic algorithm to obtain the optimal spare capacity on a wavelength on a link when a number of backup traffic streams are multiplexed onto it. We propose two schemes for grooming traffic streams onto wavelengths: Mixed Primary-Backup Grooming Policy (MOP) and Segregated Primary-Backup Grooming Policy (SGP). We illustrate how these schemes can be applied in a WDM mesh network scenario along with a routing and wavelength assignment algorithm. We conduct simulation experiments to evaluate the effectiveness of the proposed schemes on different network topologies, using different routing and wavelength assignment methods. The effect of change in granularity and change in the number of alternate paths on the grooming policies are also presented. From the simulation results, it is inferred that SGP is useful in network topologies, such as mesh-torus, characterized by good connectivity and a good amount of traffic switching and mixing at the nodes. On the other hand, MGP is useful in network topologies, such as a ring, characterized by low connectivity and high load correlation.

Survivable traffic grooming with non‐service‐interruptive wavelength retuning in a WDM mesh network

“…It needs the global information of all the lightpaths and connections to compute the route and wavelength for the new connection request. Thiagarajan and Samari [18] presented two grooming policies, namely mixed primary-backup grooming policy and segregated primary-backup grooming policy. The results indicate that in order to achieve good performance in a dynamic environment, different grooming policies and route-computation algorithms need to be used under different network states.…”

A novel generic graph model for traffic grooming in heterogeneous WDM mesh networks

“…In [26], two route-computation algorithms are proposed and compared, and the results indicate that, in order to achieve good performance in a dynamic environment, different grooming policies and route-computation algorithms need to be used under different network states. The work in [27] compares two schemes to dynamically establish reliable low-speed traffic in WDM mesh networks with traffic-grooming capability. In [28], the problem of planning and designing a WDM mesh network with certain forecast traffic demands, to satisfy all the connections as well as minimize the network cost, is studied.…”

Survivable traffic grooming with path protection at the connection level in WDM mesh networks

“…The work in [10] focused on the survivable grooming policies, as to whether primary connections and backup connections should be groomed on the same lightpath. The work in [5] compared PAL and PAC in the WDM mesh grooming networks.…”

“…The work in [11] presented an ILP formulation of the STG problem to minimize the total number of wavelength links in WDM optical networks with path protection. In [5], [10], and [11], either node-or link-disjoint constraints were considered to solve the STG problem.…”