Dynamic Traffic Grooming Algorithms for Reconfigurable SONET Over WDM Networks

The emergence of wavelength-division multiplexing (WDM) technology provides the capability for increasing the bandwidth of synchronous optical network (SONET) rings by grooming low-speed traffic streams onto different high-speed wavelength channels. Since the cost of SONET add–drop multiplexers (SADM) at each node dominates the total cost of these networks, how to assign the wavelength, groom the traffic, and bypass the traffic through the intermediate nodes has received a lot of attention from researchers recently. Moreover, the traffic pattern of the optical network changes from time to time. How to develop dynamic reconfiguration algorithms for traffic grooming is an important issue. In this paper, two cases (best fit and full fit) for handling reconfigurable SONET over WDM networks are proposed. For each approach, an integer linear programming model and heuristic algorithms (TS-1 and TS-2, based on the tabu search method) are given. The results demonstrate that the TS-1 algorithm can yield better solutions but has a greater running time than the greedy algorithm for the best fit case. For the full fit case, the tabu search heuristic yields competitive results compared with an earlier simulated annealing based method and it is more stable for the dynamic case.

Dynamic traffic grooming algorithms for reconfigurable SONET over WDM networks

The emergence of Wavelength Division Multiplexing (WDM) technology provides the capability for increasing the bandwidth of Synchronous Optical Network (SONET) rings by grooming low-speed traffic streams onto different high-speed wavelength channels. Since the cost of SONET add-drop multiplexers (SADM) at each node dominates the total cost of these networks, how to assign the wavelength, groom in the traffic and bypass the traffic through the intermediate nodes has received a lot of attention from researchers recently.

Vanishing of Ext and Tor over complete intersections

Let (R,m) be a local complete intersection, that is, a local ring whose m-adic completion is the quotient of a complete regular local ring by a regular sequence. Let M and N be finitely generated R-modules. This dissertation concerns the vanishing of Tor(M, N) and Ext(M, N). In this context, M satisfies Serre's condition (S_{n}) if and only if M is an nth syzygy. The complexity of M is the least nonnegative integer r such that the nth Betti number of M is bounded by a polynomial of degree r-1 for all sufficiently large n. We use this notion of Serre's condition and complexity to study the vanishing of Tor_{i}(M, N). In particular, building on results of C. Huneke, D. Jorgensen and R. Wiegand [32], and H. Dao [21], we obtain new results showing that good depth properties on the R-modules M, N and MtensorN force the vanishing of Tor_{i}(M, N) for all i>0. We give examples showing that our results are sharp. We also show that if R is a one-dimensional domain and M and MtensorHom(M,R) are torsion-free, then M is free if and only if M has complexity at most one. If R is a hypersurface and Ext^{i}(M, N) has finite length for all i>>0, then the Herbrand difference [18] is defined as length(Ext^{2n}(M, N))-(Ext^{2n-1}(M, N)) for some (equivalently, every) sufficiently large integer n. In joint work with Hailong Dao, we generalize and study the Herbrand difference. Using the Grothendieck group of finitely generated R-modules, we also examined the number of consecutive vanishing of Ext^{i}(M, N) needed to ensure that Ext^{i}(M, N) = 0 for all i>>0. Our results recover and improve on most of the known bounds in the literature, especially when R has dimension two.