A network flow approach for static and dynamic traffic grooming in WDM networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Information Sciences: an International Journal
Reconfigurable grooming of dynamic traffic in SONET/WDM ring networks
Journal of High Speed Networks
Rerouting schemes for dynamic traffic grooming in optical WDM networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Grooming of Dynamic Traffic in WDM Tree Networks Using Genetic Algorithms
ISNN 2009 Proceedings of the 6th International Symposium on Neural Networks: Advances in Neural Networks - Part II
On M-concurrency path computation and its application in dynamic service multi-layer networks
ONDM'10 Proceedings of the 14th conference on Optical network design and modeling
Minimum cost dimensioning of ring optical networks
Optical Switching and Networking
Hi-index | 0.07 |
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.